Cod sursa(job #1284464)
Utilizator | Data | 6 decembrie 2014 15:46:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
bool ok[2000005]
int main()
{int i,p,nr=0;
in>>n;
for(p=2; p<=n; p++)
ok[p]=1;
for(p=2; p<=n; p++)
{
if(ok[p])
{
nr++;
for(i=1; i<=n/p; i++)
ok[p*i]=0;
}
}
out<<nr;
return 0;
}