Cod sursa(job #445478)
| Utilizator | Data | 23 aprilie 2010 21:50:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int n;
FILE * in;
void citire()
{
in=fopen("ciur.in","r");
fscanf(in,"%d",&n);
}
int main()
{
int nr=0;
citire();
int *a=(int *)calloc(n,sizeof(int));
int i,j;
for (i=2;i<=n;i++)
{
if (a[i]==0)
{
nr++;
for(j=2*i;j<=n;j+=i)
a[j]=1;
}
}
FILE *out=fopen("ciur.out","w");
fprintf(out,"%d",nr);
fclose(in);
fclose(out);
return 0;
}
