Cod sursa(job #2617589)
Utilizator | Data | 22 mai 2020 12:47:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
#define L 2000100
using namespace std;
char v[L+1];
int main(){
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, i, d, r;
for(i=2; i*i<L; i++)
if(v[i]==0)
for(d=i*i; d<L; d+=i)
v[d]=1;
scanf("%d", &n);
r=0;
for(i=2; i<=n; i++)
if(v[i]==0)
r++;
printf("%d\n", r);
return 0;
}