Cod sursa(job #1463314)
Utilizator | Data | 20 iulie 2015 17:51:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 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;
}