Cod sursa(job #3322701)
| Utilizator | Data | 15 noiembrie 2025 11:41:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define cin fin
#define cout fout
bool prim(int n)
{
if(n<=1) return false;
if (n<=3) return true;
if (n%2==0 || n%3==0) return false;
for (int d=5; d*d<=n; d+=6)
if (n%d==0 || n%(d+2)==0)
return false;
return true;
}
int main()
{
int n, x, nr=0;
cin>>n;
while (n)
{
nr+=prim(n);
n--
}
cout<<nr;
return 0;
}
