Cod sursa(job #2366352)
Utilizator | Data | 4 martie 2019 19:41:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls9_ojiii | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,cnt;
bool b[2000001];
int main()
{
in>>n;
for(int i=2;i<=n;i++)
b[i]=1;
for(int i=2;i<=n;i++)
if(b[i])
{
cnt++;
for(int j=i*2;j<=n+10;j+=i)
b[j]=0;
}
out<<cnt;
return 0;
}