Cod sursa(job #788344)
Utilizator | Data | 14 septembrie 2012 15:44:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001],n,nr;
long long i,j,m;
int main ()
{
f>>n;
nr=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
m=i*i;
if(m<=n)
if(v[m]==0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
nr++;
}
}
g<<nr;
f.close();g.close();
return 0;
}