Cod sursa(job #3132744)
| Utilizator | Data | 23 mai 2023 18:58:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, ciur[2000005],ct=0,nr=2;
int prim(int a) {
if (a<2) {
return false;
}
if (a==2) {
return true;
}
if (a%2==0) {
return false;
}
for (int d=3; d*d<=a; ++d) {
if (a%d==0) {
return false;
}
}
return true;
}
int main()
{
fin >> n;
while (nr<=n) {
if (prim(nr)) {
ct++;
}
nr++;
}
fout << ct;
return 0;
}
