Cod sursa(job #1245954)
Utilizator | Data | 20 octombrie 2014 11:54:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in"); ofstream g("ciur.out");
const int Nmax=2000005;
int n,cnt;
char w[Nmax];
int main()
{ long long int i, j;
f>>n;
for(i=2;i<=n;i++)
if(w[i]==0)
{ cnt++;
for(j=i*i;j<=n;j+=i) w[j]=1;
}
g<<cnt<<'\n'; g.close(); return 0;
}