Cod sursa(job #1475546)
Utilizator | Data | 24 august 2015 10:55:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int k, i, j, nr;
int main ()
{
f >> k;
for (i=2; i<=k; i++)
{
if (a[i] == 0)
{
nr++;
for (j=i*2; j<=k; j=j+i)
a[j] = 1;
}
}
return 0;
}