Cod sursa(job #2690699)
Utilizator | Data | 25 decembrie 2020 13:00:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define Nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ok[Nmax];
int main()
{
int i,j,n,cnt=0;;
fin>>n;
ok[1]=1;
for(i=2;i<=n;++i)
{
if(!ok[i])
{ ++cnt;
for(j=i+i;j<=n;j+=i)
ok[j]=1;
}
}
fout<<cnt;
return 0;
}