Cod sursa(job #1802212)
Utilizator | Data | 9 noiembrie 2016 23:03:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
int nr,n,v[2000005];
int main()
{
FILE *f=fopen("ciur.in","r");
int i,j;
fscanf(f,"%d",&n);
f=fopen("ciur.out","w");
for(i=2;i<=n;++i)
v[i]=1;
for(i=2;i<=n;++i)
{
if(v[i])
{
++nr;
for(j=2*i;j<=n;j+=i)
v[j]=0;
}
}
fprintf(f,"%d",nr);
return 0;
}