Cod sursa(job #1304603)
Utilizator | Data | 29 decembrie 2014 00:16:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
bool b[2000001];
int n;
int main()
{
FILE *fin,*fout;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%d",&n);
for(int i=2;i<=n;i++)
{
if(b[i]==0) for(int j=i;j<=n/i;j++) b[i*j]=1;
}
int ct=0;
for(int i=2;i<=n;i++)
{
if(b[i]==0) ct++;
}
fprintf(fout,"%d\n",ct);
}