Cod sursa(job #1141905)
Utilizator | Data | 13 martie 2014 11:55:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <cstdio>
using namespace std;
int i,j,n,t,ciur[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);t=n-1;
for(i=2;i<=n;i++){
if(ciur[i]){--t;}
else{for(j=2;j<=n/i;j++){ciur[i*j]=1;}}
}
printf("%ld",t);
return 0;
}