Cod sursa(job #1473708)
Utilizator | Data | 20 august 2015 00:13:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool [2000000];
int n, i, j, nr;
int main ()
{
f >> n;
for (i=2; i<=n; i++)
{
if (c[i] == 0)
{
nr++;
for (j=i*2; j<=n; j=j+i)
c[j] = 1;
}
}
g << nr;
return 0;
}