#include <stdio.h>
#include <math.h>
int prime( int p );
int PrimeSum( int m, int n );
int main()
{
int m, n, p;
scanf("%d %d", &m, &n);
int a[1000], k = 0;
for( p=m; p<=n; p++ ) {
if( prime(p) != 0 )
{
a[k] = p;
k++;
}
}
printf("Sum of ( ");
int i;
for(i = 0; i < k; i++)
{
printf("%d ", a[i]);
}
printf(") = %d\n", PrimeSum(m, n));
return 0;
}
int prime(int p)
{
int sign = 1;
int t;
if(p <= 1) {sign = 0;}
else
{
for(t = 2; t <= sqrt(p); t++)
{
if(p % t == 0){sign = 0; break;}
}
}
return sign;
}
int PrimeSum(int m, int n)
{
int sum = 0;
int k;
for(k = m; k <= n; k++)
{
if(prime(k)){sum += k;}
}
return sum;
}
求m~n区间内素数的和
最新推荐文章于 2024-03-19 22:31:08 发布