Cod sursa(job #3219279)
Utilizator | Data | 30 martie 2024 16:42:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
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 y=2; (float)y<=sqrt(i); y++) {
if (i%y == 0) m[i] = false;
}
}
for (int i=2; i<=n; i++) {
if (m[i] == true) p++;
}
out<<p;
}