Cod sursa(job #1303998)
Utilizator | Data | 28 decembrie 2014 16:09:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim[2000005];
long N,i,nr;
void marcare(long i)
{
for(long j=i;j<=N;j+=i)
{
prim[j]=true;
}
}
int main()
{
fin>>N;
for(i=2;i<=N;++i)
if(prim[i]==false)
marcare(i),++nr;
fout<<nr;
return 0;
}