Cod sursa(job #2162192)
Utilizator | Data | 12 martie 2018 08:55:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
bool viz[2000100];
int main ()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
int nr=0;
for (int i=2; i<=n; i++){
if (viz[i]==0){
nr++;
for (int j=2; j*i<=n; j++)
viz[j*i]=1;
}
}
printf("%d", nr);
return 0;
}