Cod sursa(job #266965)
Utilizator | Data | 26 februarie 2009 14:50:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int main()
{
int n,i,j,nr=0;
char v[2000002];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<n;++i)
v[i]=1;
for(i=2;i*i<=n;++i)
if(v[i])
for(j=2;j*i<n;++j)
v[i*j]=0;
for(i=2;i<n;++i)
if(v[i])
nr++;
g<<nr;
f.close();
g.close();
return 0;
}