Cod sursa(job #2386898)
Utilizator | Data | 23 martie 2019 21:07:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
bool v[2000001];
int main()
{
FILE *f = fopen("ciur.in","r");
FILE *g = fopen("ciur.out","w");
int n,rez=0;
fscanf(f,"%d",&n);
for(int i=2;i<=n;i++)
{
if(v[i] == false)
{
rez++;
for(int j=i*2;j<=n;j=j+i)
v[j] = true;
}
}
fprintf(g,"%d",rez);
return 0;
}