This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ruthen71/rcpl
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A" #include <bits/stdc++.h> #include "math/prime_factor.hpp" int main() { long long n; std::cin >> n; auto pf = prime_factor(n); std::cout << n << ':'; for (auto &[p, e] : pf) for (int i = 0; i < e; i++) std::cout << ' ' << p; std::cout << '\n'; return 0; }
#line 1 "verify/aoj_ntl/aoj_ntl_1_a.test.cpp" #define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A" #include <bits/stdc++.h> #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 6 "verify/aoj_ntl/aoj_ntl_1_a.test.cpp" int main() { long long n; std::cin >> n; auto pf = prime_factor(n); std::cout << n << ':'; for (auto &[p, e] : pf) for (int i = 0; i < e; i++) std::cout << ' ' << p; std::cout << '\n'; return 0; }