Algorithms/Mathematics/primePyramid at dev · devel-hm/Algorithms · GitHub

8000 Algorithms/Mathematics/primePyramid at dev · devel-hm/Algorithms · GitHub

Repository navigation

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

#include<stdio.h>

int prime(int num);

int main() {

int i, j;

int num = 2;

for (i = 0; i < 5; i++) {

printf("\n");

for (j = 0; j <= i; j++) {

while (!prime(num)) {

num++;

}

printf("%d\t", num++);

}

}

return (0);

}

int prime(int num) {

int i, flag;

for (i = 2; i < num; i++) {

if (num % i != 0)

flag = 1;

else {

flag = 0;

break;

}

}

if (flag == 1 || num == 2)

return (1);

else

return (0);

}

0