Cod sursa(job #1922658)
Utilizator | Data | 10 martie 2017 18:17:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define Nmax 2000001
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n, nr;
bool v[ Nmax ];
int main()
{
f >> n;
for ( int i = 2; i <= n; ++ i )
{
if ( v[ i ] == 0 )
{
nr ++;
for ( int j = i + i; j <= n; j+=i )
{
v[ j ] = 1;
}
}
}
g << nr;
return 0;
}