#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
bool prime(int n)
{
for(int i=2; i<=n/i; i++)
{
if(n%i==0) return false;
}
return true;
}
int main()
{
int n;
cin>>n;
long long ans=0;
int x=0;
if(n<2)
{
printf("0\n");
return 0;
}
if(n==2)
{
printf("2\n1\n");
return 0;
}
for(int i=2; i<=n; i++)
{
if(ans+i>n)
{
printf("%d\n",x);
return 0;
}
if(prime(i))
{
printf("%d\n",i);
ans=ans+i;
x++;
}
}
return 0;
}
P5723 Prime Number Pocket
Guess you like
Origin blog.csdn.net/qq_45976312/article/details/112966588
Recommended
Ranking