Cod sursa(job #2387031)
Utilizator | Data | 24 martie 2019 11:07:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int N=2000005;
bool v[N];
int n,cnt;
int main()
{
in>>n;
for(int i=2;i<=n;i++)
if(!v[i])
{
cnt++;
for(int j=i*i;j<=n;j=j+i)
v[j]=true;
}
out<<cnt;
return 0;
}