1 //洛谷  P5723  质数口袋 
 2 #include "stdio.h" 
 3 int isPrimeFunc(int num){ // 函数isPrimeFunc（num）用于判断 num 是否为质数，如是，返回1，如否，返回0.
 4     int isPrime =1;
 5     for (int j=2; j*j <= num; j++)  
 6         if( num % j == 0 ){
 7             isPrime = 0;
 8             break;
 9         }
10     return isPrime;
11 }
12     
13 int main() {
14     int L, sum =0, i, count=0;
15     scanf("%d", &L);
16     for ( i=2; sum +i  <= L; i++)
17         if (isPrimeFunc(i) ){
18             sum += i;  
19             count++;
20             printf("%d\n", i);
21         } 
22     printf("%d\n",count );
23     return 0;      
24 }