Cod sursa(job #1284502)
Utilizator | Data | 6 decembrie 2014 16:07:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[2000005];
int main()
{int n,,p,i,nr=0;
f>>n;
for(p=2;p<=n;p++) prim[p]=1;
for(p=2;p<=n;p++)
if(prim[p])
{nr++;
for(i=1;i<=n/p;i++)
prim[p*i]=0;
}
g<<nr;
return 0;
}