Cod sursa(job #884030)
Utilizator | Data | 20 februarie 2013 16:51:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<Stdio.h>
FILE *f,*g;
int n,i,k;
int prim(int i)
{
int j;
for(j=2;j*j<=i;j++)
{
if(i%j==0)
{
return 1;
}
}
return 0;
}
int main()
{
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
{
if(prim(i)==0)
{
k++;
}
}
fprintf(g,"%d",k);
fclose(f);
fclose(g);
return 0;
}