Cod sursa(job #2406632)
| Utilizator | Data | 15 aprilie 2019 22:51:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int main()
{
int n;
ifstream in("ciur.in");
in>>n;
vector< bool > ciur(n, false);
for(int i = 2 ; i * i <= n ; i++)
if(!ciur[i])
for(int j = 2 ; i * j <= n ; j ++)
ciur[i* j] = true;
int nrp = 0;
for(int i = 2 ; i <=n ; i++ )
if(!ciur[i]) {nrp++;
}
ofstream out("ciur.out");
out<<nrp;
return 0;
}
