Cod sursa(job #1331297)
Utilizator | Data | 31 ianuarie 2015 15:09:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int v[2000001];
int main()
{
int n,nr=0;
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
scanf("%d", &n);
for(int i=2; i*i<=n;i++){
if(v[i]==0){
for(int j=i*i; j<=n;j=j+i){
v[j]=1;
}
}
}
for(int i=2; i<=n; i++){
if(v[i]==0)
nr++;
}
printf("%d",nr);
return 0;
}