Cod sursa(job #1837605)
Utilizator | Data | 30 decembrie 2016 00:06:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{ int i,nr=0,k;
bool ok;
long long N,d;
in>>N;
for(i=2;i<=N;i++)
{ if((i-1)%4==0||(i-3)%4==0||(i-1)%6==0||(i-5)%6==0)
{
ok=1;
for(d=2;d*d<=i;d++)
if(i%d==0)
{ d=i;
ok=0;
}
if(ok==1)
nr++;
}
}
out<<nr+1;
return 0;
in.close();
out.close();
}