Cod sursa(job #882014)
Utilizator | Data | 18 februarie 2013 20:31:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n, cnt,i,j;
char prim[2000005];
int main(void)
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i = 2; i <= n; ++i)
prim[i] = 1;
for (i = 2; i <= n; ++i)
if (prim[i])
{
++cnt;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
fout<<cnt;
return 0;
}