Cod sursa(job #650562)
Utilizator | Data | 18 decembrie 2011 14:03:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
char a[2000000];
long int i,j,n;
int main(int c){
FILE *fin,*fout;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf("%ld",&n);
for(i=2;i<=n;i++)a[i]=1;
for(i=2;i<=n;i++)
if(a[i]==1){
c++;
for(j=i+i;j<=n;j+=i)
a[j]=0;
}
fprintf("%d",c);
fclose(fin);fclose(fout);
return 0;
}