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