Cod sursa(job #1690458)
Utilizator | Data | 15 aprilie 2016 09:10:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int N, viz[2000007],k;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>N;
for(int i=2; i<=N;++i)
if(!viz[i])
for(int j=i+i; j<=N; j+=i)
viz[j]=1;
for(int i=2; i<=N;++i)
if(!viz[i])k++;
cout<<k;
return 0;
}