Cod sursa(job #1515405)
Utilizator | Data | 1 noiembrie 2015 16:19:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int main()
{
int n,nr=0;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
char x[2000005];
for(int i = 2;i<=n;i++){
x[i]=1;
}
for(int i = 2;i<=n;i++){
if(x[i]==1){
nr++;
for(int j = i+i;j<=n;j+=i)
x[j]=0;
}
}
printf("%d", nr);
return 0;
}