結果

問題 No.3186 Big Order
ユーザー Yudai0606Nazo
提出日時 2025-07-30 04:12:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,263 bytes
コンパイル時間 11,210 ms
コンパイル使用メモリ 512,024 KB
実行使用メモリ 15,936 KB
最終ジャッジ日時 2025-07-30 04:12:32
合計ジャッジ時間 14,399 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other TLE * 1 -- * 34
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using Real = mp::number<mp::cpp_dec_float<1024>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


struct PQ {
    Bint p, q;
    PQ(const Bint p_=0, const Bint q_=1): p(p_), q(q_) { assert(q != 0); reduce(); };
    PQ(const PQ &f): p(f.p), q(f.q) {};
    void operator=(const PQ &other) { p = other.p; q = other.q; }
    bool operator==(const PQ &other) const { return p*other.q == other.p*q; }
    bool operator<(const PQ &other) const { return p*other.q < other.p*q; }
    bool operator<=(const PQ &other) const { return p*other.q <= other.p*q; }
    bool operator>(const PQ &other) const { return p*other.q > other.p*q; }
    bool operator>=(const PQ &other) const { return p*other.q >= other.p*q; }
    PQ &operator+=(const PQ &other) { Bint tp = p*other.q + q*other.p; q *= other.q; p = tp; reduce(); return *this; }
    PQ &operator-=(const PQ &other) { Bint tp = p*other.q - q*other.p; q *= other.q; p = tp; reduce(); return *this; }
    PQ &operator*=(const PQ &other) { p *= other.p, q *= other.q; reduce(); return *this; }
    PQ &operator/=(const PQ &other) { p *= other.q, q *= other.p; reduce(); return *this; }
    PQ operator+(const PQ &other) const { return PQ(*this) += other; }
    PQ operator-(const PQ &other) const { return PQ(*this) -= other; }
    PQ operator*(const PQ &other) const { return PQ(*this) *= other; }
    PQ operator/(const PQ &other) const { return PQ(*this) /= other; }
    PQ operator-() const { return PQ(*this) *= Bint(-1); }
    void reduce() { Bint tmp = gcd(abs(p), abs(q)); p/=tmp, q/=tmp; if(q < 0) p *= -1, q *= -1; }
};

const Bint M = 998244353;
Bint solve() {
    Bint a, b, c;
    cin >> a >> b >> c;
    PQ res(0, 1);
    Bint t = a;
    rep(i, 135) {
        Bint tmp = t, cnt = 0;
        while(tmp % c == 0) tmp /= c, cnt++;
        chmax(res, PQ(cnt, i+1));
        t *= a;
    }
    return (res.p * b / res.q) % M;
}

int main() {
    int t;
    cin >> t;
    rep(i, t) cout << solve() << '\n';
    return 0;
}
0