Cod sursa(job #209473)
Utilizator | Data | 22 septembrie 2008 18:00:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
#define nmax 2000001
int a[nmax],x;
int main()
{
long n;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
for(long i=2;i<=n;++i)
if (a[i]==0)
{
for(long j=i;j<=n;j+=i) a[j]=1;
x++;
}
fprintf(g,"%d",x);
return 0;
}