Cod sursa(job #370813)
| Utilizator | Data | 2 decembrie 2009 12:51:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
bool a[2000000];
int n;
void torol(int x){
int temp;
temp=x;
while(temp<=n){
a[temp]=true;
temp=temp+x;
}
}
int main(){
int i,j,db=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++){
if(!a[i]){
db++;
torol(i);
}
}
printf("%d",db);
return 0;}