verify/aoj_ntl/aoj_ntl_1_d.test.cpp

View this file on GitHub
Last update: 2023-02-06 17:52:27+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_D

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_D"

#include <bits/stdc++.h>

#include "math/totient.hpp"

int main() {
    long long n;
    std::cin >> n;
    std::cout << totient(n) << '\n';
    return 0;
}

#line 1 "verify/aoj_ntl/aoj_ntl_1_d.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_D"

#include <bits/stdc++.h>

#line 2 "math/totient.hpp"

#line 2 "math/prime_factor.hpp"

std::map<long long, int> prime_factor(long long n) {
    std::map<long long, int> res;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            res[i]++;
            n /= i;
        }
    }
    if (n != 1) res[n]++;
    return res;
}
#line 4 "math/totient.hpp"

long long totient(long long n) {
    auto pf = prime_factor(n);
    for (auto &[p, e] : pf) {
        n /= p;
        n *= p - 1;
    }
    return n;
}
#line 6 "verify/aoj_ntl/aoj_ntl_1_d.test.cpp"

int main() {
    long long n;
    std::cin >> n;
    std::cout << totient(n) << '\n';
    return 0;
}