Cod sursa(job #665006)
Utilizator | Data | 21 ianuarie 2012 13:23:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,x,nr=1,v[2000001];
int main()
{in>>n;
for(int i=4;i<=n;i+=2)v[i]=1;
for(int i=3;i<=n;i+=2)if(v[i]==0){nr++;
for(int j=3*i;j<=n;j+=i)v[j]=1;
}
out<<nr<<'\n';
out.close();
return 0;
}