Cod sursa(job #3219288)
| Utilizator | Data | 30 martie 2024 17:08:04 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main() {
int n, p=0;
bool m[2000000];
in>>n;
for (int i=2; i<=n; i++) m[i] = true;
for (int i=2; i<=n; i++) {
if (m[i] == true) {
for (int j=2*i; j<=n; j+=i) m[j] = false;
//p++;
}
}
for (int i=2; i<=n; i++) if (m[i] == true) p++;
out<<p;
}