Cod sursa(job #156518)
| Utilizator | Data | 12 martie 2008 16:44:09 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
char c[2000001];
int v[1001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
c[0]=c[1]=1;
int n,i,j,k=0;
scanf("%d",&n);
for(i=4; i<=n; i+=2)
c[i]=1;
for(i=3; i*i<=n; i+=2)
{
if(!c[i])
{
for(j=i+i+i; j<=n; j+=i+i)
c[j]=1;
}
}
for(i=n; i>1; i--)
{
if(!c[i])
{
k++;
if(k<1001)
v[k]=i;
}
}
printf("%d\n",k);
return 0;
}
