Cod sursa(job #1462151)
Utilizator | Data | 17 iulie 2015 11:24:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
bool c[2000001];
long n, i, j, nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for(i=2; i<=n; i++)
{
if (c[i] == 0)
nr++;
for(j=i+i; j<=n; j=j+i)
c[j] = 1;
}
g << nr;
return 0;
}