Cod sursa(job #898679)
Utilizator | Data | 28 februarie 2013 11:21:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<stdio.h>
FILE *in,*out;
int i,n,j,kontor;
bool ciur[2000001];
int main()
{
in=fopen("ciur.in","rt");
out=fopen("ciur.out","wt");
fscanf(in,"%d",&n);
for(i=2;i<=n;i++)
ciur[i]=true;
for(i=2;i*i<=n;i++)
{
if(ciur[i])
{
for(j=i*i;j<=n;j+=i)
{
ciur[j]=false;
}
}
}
for(i=2;i<=n;i++)
{
if(ciur[i])
kontor++;
}
fprintf(out,"%d",kontor);
fclose(in);
fclose(out);
return 0;
}