Cod sursa(job #238567)
Utilizator | Data | 2 ianuarie 2009 16:24:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
long int k=0,i,j,n;
char v[200001];
int main()
{
FILE *f=fopen("ciur.in","r"), *g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
for (i=1;i<=n;i++)
v[i]='0';
for (i=2;i<=sqrt(n);++i)
if (v[i]=='0')
{
k++;
for(j=i;j<=n;j+=i)
v[j]='1';
}
fprintf(g,"%ld",k);
return 0;
}