Cod sursa(job #1548395)
Utilizator | Data | 10 decembrie 2015 20:55:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
char prim[2000005];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(void)
{
int i,j,n,nr;
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])
{
++nr;
for (j = 2*i; j <= n; j=j+i)
prim[j] = 0;
}
fout<<nr;
return 0;
}