Cod sursa(job #1363297)
Utilizator | Data | 26 februarie 2015 21:05:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
bool a[2000010];
int main()
{
FILE *fin,*fout;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
int n,c=1;
fscanf(fin,"%d",&n);
for(int i=2;i<=n;i++)
{
if(a[i]==0)
{
c++;
for(int j=2;j*i<=n;j++)
{
a[i*j]=1;
}
}
}
fprintf(fout,"%d",c);
}