PAT (Basic Level) Practise：1013. 数素数

 1 #include <stdio.h>
 2 #include <math.h>
 3 
 4 int isPrime(unsigned int num)
 5 {
 6     int i, s;
 7 
 8     s = sqrt(num);
 9     for(i = 2; i <= s; i++)
10     {
11         if(num % i == 0)
12             return 0;
13     }
14     return 1;
15 }
16 
17 void test(void)
18 {
19     unsigned int n, m;
20     int num, cnt;
21     int pm;
22 
23     scanf("%d %d", &n, &m);
24     //if(n < m && n > 0 && m > 0)
25     {
26         cnt = 1;
27         num = 2;
28         pm = 1;
29         while(cnt <= m)
30         {
31             if(isPrime(num))
32             {
33                 if(cnt >= n)
34                 {
35                     printf("%d", num);
36                     if(pm != m-n+1)
37                     {
38                         if(pm % 10 == 0)
39                             printf("\n");
40                         else
41                             printf(" ");
42                     }
43                     pm++;
44                 }
45                 cnt++;
46             }
47             num++;
48         }
49     }
50 }
51 
52 int main(void)
53 {
54     test();
55     return 0;
56 }