Cod sursa(job #293190)
Utilizator | Data | 1 aprilie 2009 00:57:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<cstdio>
#include<math.h>
int N;
int T;
int i,j;
int s[2000100];
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
for(i=2;i<=N;i++){
if(s[i]==0){
++T;
for(j=2;j<=N/i;j++){
s[i*j]=1;
}
}
}
printf("%d",T);
return 0;
}