Cod sursa(job #353783)
Utilizator | Data | 6 octombrie 2009 09:49:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
long n=20, cnt,i,j;
bool prim[2000005];
void back(k)
int main(void)
{
scanf("%d", &n);
for(i=2;i<=n;++i)
prim[i]=1;
for(i=2;i<=n;++i)
if (prim[i])
{
++cnt;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
int k=0;
for(i=2;i<=n-2;i++)
if(prim[i]==1)
{
k++;
val[k]=i;
}
back(k);
return 0;
}