Cod sursa(job #2039681)
Utilizator | Data | 14 octombrie 2017 19:33:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <cstdio>
using namespace std;
bool ciur[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, nr=0;
scanf("%d", &n);
for(int i=2; i*i<=n; i++)
if(!ciur[i])
for(int j=i*i; j<=n; j+=i)
ciur[j]=1;
for(int i=2; i<n; i++)
if(ciur[i]==0)
nr++;
cout<<nr;
return 0;
}