Cod sursa(job #230415)
Utilizator | Data | 13 decembrie 2008 21:51:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
int i,j,n,nr;
char prim[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
nr=0;
f>>n;
for(i=2;i<=n;++i)
{
prim[i]=1;
}
for(i=2;i<=n;++i)
{
for(j=i+i;j<=n;j+=i)
{
prim[j]=0;
}
if(prim[i])
++nr;
}
g<<nr;
f.close();
g.close();
return 0;
}