Cod sursa(job #2046779)
Utilizator | Data | 24 octombrie 2017 09:20:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,i,j,nr;
bool ok[2000003];
int main()
{f>>N;
for(i=2;i<=N;i++)
ok[i]=true;
for(i=2;i*i<=N;i++)
{
if(ok[i]==true)
{
for(j=i*2;j<=N;j+=i)
ok[j]=false;
}
}
for(i=2;i<=N;i++)
if(ok[i]==true) nr++;
g<<nr;
return 0;
}