36 lines
492 B
C
36 lines
492 B
C
/*
|
|
* Compute the sum of prime numbers up to 10000.
|
|
*/
|
|
#include <stdio.h>
|
|
|
|
int isprime(int);
|
|
|
|
int main(void)
|
|
{
|
|
int sum, n;
|
|
|
|
sum = 0;
|
|
for (n=2; n<10000; ++n) {
|
|
if (isprime(n)) {
|
|
sum += n;
|
|
}
|
|
}
|
|
printf("Sum of primes less than 10000: %d\n", sum);
|
|
}
|
|
|
|
int isprime(int n)
|
|
{
|
|
int j;
|
|
|
|
if (n == 2)
|
|
return 1;
|
|
|
|
if (n % 2 == 0)
|
|
return 0;
|
|
|
|
for (j=3; j*j<=n; j+=2)
|
|
if (n % j == 0)
|
|
return 0;
|
|
return 1;
|
|
}
|