[백준1978]소수찾기

 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
58
59
60
61
62
63
#pragma warning(disable:4996)

#include <stdio.h>



int main() {

 

 int num;

 int count,prime_count=0;

 int i;



 scanf("%d",&count);

 

 while (count != 0) {

  scanf("%d",&num);



  for (i = 3; i < 1000; i = i + 2) {

   if(num == 1)

    break;

   if(num == 2)

    prime_count++;

   if(num % 2 == 0)

    break;

   if (num % i == 0 && num>i)

    break;

   else if (num == i)

    prime_count++; 

  }

  

  count--;

 }

 printf("%d\n",prime_count);

 return 0;

}

댓글