Cod sursa(job #235756)
| Utilizator | Data | 25 decembrie 2008 19:39:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
void ciur(n)
{
bool a[200000];
int i,j,nr;
for(i=1;i<=n;i++)
{
a[i]=true;
}
a[1]=false;
for(i=1;i<=n;i++)
if(a[i])
for(j=i*i;j<=n;j+=i)
a[j]=false;
for(i=1;i<=n;i++)
if(a[i]) nr++;
printf("%d",nr);
int main()
{
int n;
freopen("ciur.in","w",stdin);
freopen("ciur.out","r",stdout);
scanf("%d",&n);
ciur(n);
return 0;
}