#1150965 (C++17) No.3462 Buttons

• 問題: No.3462 Buttons
• ユーザー: GOTKAKO
• 提出日時: 2026-03-02 00:17:39
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 74 ms / 2,000 ms
• コード長: 3,716 bytes
• コンパイル時間: 1,816 ms
• コンパイル使用メモリ: 214,912 KB
• 実行使用メモリ: 7,972 KB
• 最終ジャッジ日時: 2026-03-02 00:17:46
• 合計ジャッジ時間: 5,506 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 15

ソースコード

#include <bits/stdc++.h>
using namespace std;

//入力が必ず-mod<=a<modの時.
template<const int mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint():v(0){}
    template<typename T>
    modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint &operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint &operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint &operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint &operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint &operator/=(modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return pow(mod-2);} //素数mod必須.
 
    modint &operator++(){*this += 1; return *this;}
    modint &operator--(){*this -= 1; return *this;}
    modint operator++(int){modint ret = *this; *this += 1; return ret;}
    modint operator--(int){modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const modint a,const modint b){return a.v==b.v;}
    friend bool operator!=(const modint a,const modint b){return a.v!=b.v;}
    friend bool operator<(const modint a,const modint b){return a.v<b.v;}
    friend bool operator<=(const modint a,const modint b){return a.v<=b.v;}
    friend bool operator>=(const modint a,const modint b){return a.v>=b.v;}
    friend bool operator>(const modint a,const modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = modint(x); return is;
    }
};
using mint = modint<998244353>; const long long mod = 998244353;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        long long A,B,K; cin >> A >> B >> K;
        if(A == 0){cout << "0\n"; continue;}
        if(B == 0){
            if(A > 0) cout << A*K%mod << "\n";
            else cout << "0\n";
            continue;
        }
        if(B > 0){
            if(A < 0) cout << "0\n";
            else if(B == 1) cout << A*K%mod << "\n";
            else cout << mint(B%mod).pow(K-1)*A << "\n";
        }
        else{
            if(B == -1){
                if(A > 0) cout << A*K%mod << "\n";
                else cout << A*(K-1)*B%mod << "\n";
            }
            else{
                if(A > 0){
                    if(K%2 == 0) cout << mint(B*B%mod).pow((K-2)/2)*A*2 << "\n";
                    else cout << mint(B*B%mod).pow((K-1)/2)*A << "\n";
                }
                else{
                    A = -A;
                    if(K == 1) cout << "0\n";
                    else if(K%2) cout << mint((-B)%mod).pow(K-2)*A*2 << "\n"; 
                    else cout << mint((-B)%mod).pow(K-1)*A << "\n";
                }
            }
        }
    }
}