Cod sursa(job #1322253)
| Utilizator | Data | 19 ianuarie 2015 21:47:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
char prim[2000005];
void ciur (int n){
int i,j,nr=0;
for (i=2;i<=n;i++)
prim[i]=1;
for (i=2;i<=n;i++)
{if (prim[i]==1){
nr++;
for (j=i+i;j<=n;j+=i)
{prim[j]=0;}
}
}
printf ("%d", nr);
}
int main(){
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
ciur(n);
return 0;
}
