Cod sursa(job #1964039)
Utilizator | Data | 12 aprilie 2017 23:53:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.2 kb |
#import<fstream>
std::ifstream f("ciur.in");
std::ofstream g("ciur.out");
int n,i,j,nr=1,P[2000005];
int main(){
for(i=3,f>>n;i<=n;i++)
if(P[i]==0&&(i&1))for(j=2*i,++nr;j<=n;P[j+=i]=1);
g<<nr;}