Cod sursa(job #1876028)
Utilizator | Data | 11 februarie 2017 21:34:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
bool a[2000009];
int N;
int cnt=0;
f>>N;
for(int i=2; i<=N; i++)
a[i]=true;
for(int i=2; i<=N; i++)
if(a[i])
{for(int k=i+i; k<=N; k+=i)
a[k]=false;
cnt++;}
g<<cnt;
f.close();
g.close();
return 0;
}