Cod sursa(job #360797)
| Utilizator | Data | 1 noiembrie 2009 22:51:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | CNRV #4 | Marime | 0.48 kb |
#include<stdio.h>
#define M 2000004
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
char ciur[M];
void ciurr(long n)
{
long i,j;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
if(ciur[i]) for(j=2;j<=n/i;j++)
ciur[i*j]=0;
}
int main()
{
long i,n,k=0;
fscanf(f,"%ld",&n);
ciurr(n);
for(i=2;i<=n;i++)
if(ciur[i]) k++;
fprintf(g,"%ld\n",k);
fclose(f);
fclose(g);
return 0;
}
