Cod sursa(job #1779434)
| Utilizator | Data | 15 octombrie 2016 12:26:24 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
const string fis = "ciur";
ifstream is(fis + ".in");
ofstream os(fis + ".out");
using VI = vector<int>;
using VS = vector<short>;
using VVI = vector<VI>;
int n, answ = 1;
bitset<2000001> c;
int main()
{
is >> n;
for ( int i = 3; i <= n; i += 2 )
if ( !c[i])
{
++answ;
for ( int j = i; j <= n; j += i )
c[j] = 1;
}
os << answ;
is.close();
os.close();
return 0;
}
