結果
問題 | No.1611 Minimum Multiple with Double Divisors |
ユーザー | scol_kp |
提出日時 | 2021-07-21 22:18:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 248 ms / 2,000 ms |
コード長 | 4,039 bytes |
コンパイル時間 | 1,708 ms |
コンパイル使用メモリ | 200,848 KB |
最終ジャッジ日時 | 2025-01-23 04:30:07 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 37 |
ソースコード
#include <bits/stdc++.h> #define FASTIO using namespace std; using ll = long long; using Vi = std::vector<int>; using Vl = std::vector<ll>; using Pii = std::pair<int, int>; using Pll = std::pair<ll, ll>; constexpr int I_INF = std::numeric_limits<int>::max(); constexpr ll L_INF = std::numeric_limits<ll>::max(); template <typename T1, typename T2> inline bool chmin(T1& a, const T2& b) { if (a > b) { a = b; return true; } return false; } template <typename T1, typename T2> inline bool chmax(T1& a, const T2& b) { if (a < b) { a = b; return true; } return false; } template <std::ostream& os = std::cout> class Prints { private: class __Prints { public: __Prints(const char* sep, const char* term) : sep(sep), term(term) {} template <class... Args> #if __cplusplus >= 201703L auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) { #else void operator()(const Args&... args) const { #endif print(args...); } template <typename T> #if __cplusplus >= 201703L auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) { #else void pvec(const T& vec, size_t sz) const { #endif for (size_t i = 0; i < sz; i++) os << vec[i] << (i == sz - 1 ? term : sep); } template <typename T> #if __cplusplus >= 201703L auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) { #else void pmat(const T& mat, size_t h, size_t w) const { #endif for (size_t i = 0; i < h; i++) for (size_t j = 0; j < w; j++) os << mat[i][j] << (j == w - 1 ? term : sep); } private: const char *sep, *term; void print() const { os << term; } void print_rest() const { os << term; } template <class T, class... Tail> void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); } template <class T, class... Tail> void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); } }; public: Prints() {} __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); } }; Prints<> prints; Prints<std::cerr> prints_err; //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% vector<vector<Pll>> factors; inline void solve_one() { ll N; cin >> N; for (ll i = 2; i <= 37; i++) { ll q1 = 1, q2 = 1; for (auto [p, q] : factors[i]) { ll x = N; ll cnt = 0; while (x % p == 0) { ++cnt; x /= p; } q1 *= (cnt + 1); q2 *= (cnt + q + 1); } if (q2 == q1 * 2) { prints()(N * i); return; } } } void solve() { constexpr ll LIM = 37; factors.resize(LIM + 1); for (ll i = 2; i <= LIM; i++) { ll x = i; for (ll j = 2; j * j <= x; j++) { ll cnt = 0; while (x % j == 0) { ++cnt; x /= j; } if (cnt > 0) factors[i].emplace_back(j, cnt); } if (x > 1) factors[i].emplace_back(x, 1); } int Q; cin >> Q; while (Q--) solve_one(); } //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% int main() { #ifdef FASTIO std::cin.tie(nullptr), std::cout.tie(nullptr); std::ios::sync_with_stdio(false); #endif #ifdef FILEINPUT std::ifstream ifs("./in_out/input.txt"); std::cin.rdbuf(ifs.rdbuf()); #endif #ifdef FILEOUTPUT std::ofstream ofs("./in_out/output.txt"); std::cout.rdbuf(ofs.rdbuf()); #endif std::cout << std::setprecision(18) << std::fixed; solve(); std::cout << std::flush; return 0; }