Cod sursa(job #2200820)
Utilizator | Data | 2 mai 2018 18:34:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
int n,v[2000001];
int main()
{
int i,j,nr;
FILE *f,*g;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
{
v[i]=i;
}
nr=0;
for(i=2;i<=n;i++)
{
if(v[i]!=0)
{
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
}
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
}