Cod sursa(job #596861)
Utilizator | Data | 20 iunie 2011 07:22:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <math.h>
int main()
{//148933
int v[140],m=2,j=5,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)
{
//m++;
//v[m-1]=j;
//rm = (int) sqrt(m);
break;
}
i++;
}
i=1;
j+=2;
}
freopen("ciur.out","w",stdout);
printf("%d",m);
fclose(stdout);
return 0;
}