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