#include <stdio.h>
int isPrime(int);
int main(void)
{
int m, n, result;
printf("\nEnter m, n : ");
scanf("%d%d", &m, &n);
if (m > n)
{
m = m + n;
n = m - n;
m = m - n;
}
for( ; m <= n; m++)
{
result = isPrime(m);
if(result == 1)
printf("%d\t", m);
}
return 0;
}
int isPrime(int num)
{
/* Returns 1 if num is prime and returns 0 is num is not prime */
int i;
for(i = 2 ; i < num ; i++)
if(num % i == 0)
return 0;
return 1;
}
int isPrime(int);
int main(void)
{
int m, n, result;
printf("\nEnter m, n : ");
scanf("%d%d", &m, &n);
if (m > n)
{
m = m + n;
n = m - n;
m = m - n;
}
for( ; m <= n; m++)
{
result = isPrime(m);
if(result == 1)
printf("%d\t", m);
}
return 0;
}
int isPrime(int num)
{
/* Returns 1 if num is prime and returns 0 is num is not prime */
int i;
for(i = 2 ; i < num ; i++)
if(num % i == 0)
return 0;
return 1;
}
No comments:
Post a Comment
kiss on google ads if you are anonymous because your ip is trackable.thank you.
......from.admin