-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprimeTest.c
57 lines (50 loc) · 954 Bytes
/
primeTest.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <stdio.h>
#include <cs50.h>
#include <math.h>
bool isPrime(int number)
{
for (int i = 1; i < number; i++)
{
if (number % i == 0 && i != 1)
{
return false;
}
}
return true;
}
int sumPrimes(int num)
{
int sum = 0;
for (int i = 2; i <= num; i++)
{
if (isPrime(i))
{
sum += i;
}
}
return sum;
}
bool testPrimes(void) {
if (sumPrimes(10) != 17) {
printf("fail sumPrimes(10)");
return false;
}
if (sumPrimes(977) != 73156) {
printf("fail sumPrimes(977)");
return false;
}
if (sumPrimes(44823) != 98469833) {
printf("fail sumPrimes(44823)");
return false;
}
if (sumPrimes(123456) != 678875932) {
printf("fail sumPrimes(44823)");
return false;
}
return true;
}
int main(void) {
if (testPrimes()) {
printf("Passed!\n");
}
}