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
|
using namespace std;
int main() { int n,i,j,a[N],k=1,counter=0,p=0; cin>>n; a[0]=1; for(i=3; i<=n; ++i) { for(j=2; j<=sqrt(i); ++j) { if(i%j==0) p++; } if(p==0) { a[k]=i; if(a[k]-a[k-1]==2) { counter++; a[k]=a[k-1]; } k++; }
p=0; }
cout<<counter<<endl; return 0; }
|
近期评论