Cod sursa(job #3236449)
Utilizator | Data | 28 iunie 2024 18:13:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
inline int phi(int n) {
int rez = n, d = 2;
while(n > 1) {
if(n % d == 0) {
rez = rez / d * (d - 1);
while(n % d == 0) n /= d;
}
d++;
if(d * d > n) d = n;
}
return rez;
}
int main()
{
fin >> n;
fout << phi(n);
return 0;
}