Cod sursa(job #2418083)
Utilizator | Data | 3 mai 2019 15:38:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n;
in >> n;
int cnt = 0;
vector<bool> prim(n+1,1);
for(int i = 2; i <= n; i++)
if(prim[i])
{
cnt++;
for(long long j = 1LL*i*i; j <= 1LL*n; j+=i) prim[j] = 0;
}
out << cnt;
return 0;
}