Chose_Prime

 1 #include <iostream>
 2 #define N 100001
 3 
 4 using namespace std;
 5 
 6 int prime[N];
 7 
 8 void Chose_Prime(int n)
 9 {
10     prime[0] = 1;
11     prime[1] = 1;
12     for (int i = 2; i * i <= n; i++)
13     {
14         if (prime[i] == 0)                          //找到了没有被删掉的数字i
15         {
16             for (int j = 2 * i; j <= n; j += i)
17             {
18                 prime[j] = 1;                       //prime数组里面值为0的便为素数
19             }
20         }
21     }
22 
23     for (int i = 0; i < n; i++)                     //打印素数
24     {
25         if (prime[i] == 0)
26         {
27             cout << i << endl;
28         }
29     }
30 }
31 int main()
32 {
33     Chose_Prime(100);
34     return 0;
35 }