To find out the numbers that are divisible by one number and not by another number using array.

In this page I have written the program to find the numbers that are divisible by one number and not by another number. For more information
lets have a view for main source code. I have also added sample output of the program:

The main source code for this program is:

	#include<stdio.h>
	#include<conio.h>
	int main()
	{
	int array[100],count=0,sum=0,n1,n2,n,i;
	printf("how many terms you want to test\n");
	scanf("%d",&n);
	printf("Enter the no. you want to test\n");
	for(i=0;i<n;i++)
	{
	printf("enter element no. %d\n",i+1);
	scanf("%d",&array[i]);
	}
	printf("From which no. the above no. should be divisible\n");
	scanf("%d",&n1);
	printf("From which no. the above no. should not be divisible\n");
	scanf("%d",&n2);
	printf("\n");
	printf("\n");
	for(i=0;i<n;i++)
	{
	if(array[i]%n1==0 &&array[i]%n2!=0)
	{
	count++;
	printf("\t%d", array[i]);
	}
	}
	printf(" are the required elements that is divisible by %d but not by %d",n1,n2);
	printf("\nthe total number of required elements=%d",count);
	getch();
	}

view raw to find the numbers that are divisible by one number and not by another number hosted with ❤ by GitHub