Cod sursa(job #2291850)
Utilizator | Data | 28 noiembrie 2018 18:23:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
vector<bool> a;
int main()
{
int n;
fin >> n;
for(int i = 2; i * i <= n; i++)
for(int j = i; j < n / i; j++)
a[i * j] = true;
int c = 0;
for(int i = 2; i <= n; i++)
c++;
fout << c;
return 0;
}