Cod sursa(job #596843)
Utilizator | Marian MarianG | Data | 20 iunie 2011 06:29:45 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#include <math.h>
int main()
{
unsigned int v[1000],m=2,j,i=1,rm=1,n;
v[0]=2;
v[1]=3;
freopen("ciur.in","r",stdin);
scanf("%d",&n);
fclose(stdin);
while(j<=n)
{
//while(j%v[i]!=0)
//{
//if(i>rm)
//{
// v[m]=j;
// m++;
//rm = (unsigned int) sqrt(m);
// break;
//}
//i++;
//}
i=1;
j+=2;
}
freopen("ciur.out","w",stdout);
printf("%d",15);
fclose(stdout);
return 0;
}