結果

問題 No.2699 Simple Math (Returned)
ユーザー Today03
提出日時 2024-03-29 22:03:48
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 467 ms / 2,000 ms
コード長 3,364 bytes
コンパイル時間 1,562 ms
コンパイル使用メモリ 194,240 KB
最終ジャッジ日時 2025-02-20 15:03:11
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#ifdef LOCAL
#include "./debug.cpp"
#else
#define debug(...)
#define print_line
#endif
using namespace std;
using ll = long long;
template <ll MOD>
struct modint {
    ll value;
    modint(ll x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(ll x) const {
        modint ret(1), mul(value);
        while (x) {
            if (x & 1) {
                ret *= mul;
            }
            mul *= mul;
            x >>= 1;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend ostream &operator<<(ostream &os, const modint &x) {
        return os << x.value;
    }
    friend istream &operator>>(istream &is, modint &x) {
        ll v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;
using mint = mod998;
bool check(ll n, ll m) {
    while (n < m) {
        n *= 2;
    }
    return n == m;
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        ll N, M;
        cin >> N >> M;
        if (M < N && check(M, N)) {
            cout << 0 << '\n';
            continue;
        }
        if (N <= M) {
            mint ans = mint(10).pow(N);
            ans -= 1;
            cout << ans << '\n';
        }
        else {
            ll L = N - M;
            L %= 2 * M;
            if (L < M) {
                mint ans = mint(10).pow(M) - 1;
                if (L == 0) {
                    cout << ans << '\n';
                    continue;
                }
                mint sub = mint(9) * (mint(10).pow(L) - 1) * mint(9).inv();
                ans -= sub;
                cout << ans << '\n';
            }
            else {
                L -= M;
                if (L == 0) {
                    cout << 0 << '\n';
                    continue;
                }
                mint ans = mint(9) * (mint(10).pow(L) - 1) * mint(9).inv();
                cout << ans << '\n';
            }
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0