要求编写函数判断自然数x是否为素数,函数原型为:
int IsPrime(unsigned int x); //x是素数返回1,不是素数返回0。
输入提示信息:"Please input n(n>1):"
输入格式:"%d"
每个素数的输出格式:"%d\n"
求和输出格式:"sum of prime numbers:%d"
#include<stdio.h>
int IsPrime(unsigned int x)
{
int i, flag = 1;
for (i = 2; i < x; i++)
{
if (x % i == 0)
{
flag = 0;
}
}
return flag;
}
int main()
{
printf("Please input n(n>1):");
int n, i, sum = 0, flag = 0;
scanf("%d", &n);
for (i = 2; i < n; i++)
{
flag = IsPrime(i);
if (flag == 1)
{
printf("%d\n", i);
sum = sum + i;
}
}
printf("sum of prime numbers:%d", sum);
}