Cod sursa(job #293181)
Utilizator | Data | 1 aprilie 2009 00:45:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
#include<set>
using namespace std;
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;
j=2;
while(i*j<=N){
s[i*j]=1;
j++;
}
}
}
printf("%ld",T);
return 0;
}