Cod sursa(job #649749)
Utilizator | Data | 16 decembrie 2011 17:39:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
#define Nmax 200000
int main()
{
long n,k=0,i,j;
int a[Nmax];
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for (i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=n;i++)
if (a[i]==1)
{
k++;
for (j=2*i;j<=n;j+=i)
a[j]=0;
}
fprintf(g,"%d %d",k,n);
fclose(f);fclose(g);
return 0;
}