結果

問題 No.2752 文字列の数え上げ mod 998244353
コンテスト
ユーザー Today03
提出日時 2024-05-20 10:13:13
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,538 ms / 2,000 ms
コード長 3,262 bytes
コンパイル時間 2,210 ms
コンパイル使用メモリ 203,436 KB
最終ジャッジ日時 2025-02-21 16:16:07
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

template <typename T>
using matrix = vector<vector<T>>;
template <typename T>
matrix<T> make_matrix(int n) {
    vector<vector<T>> ret(n, vector<T>(n));
    return ret;
}
template <typename T>
matrix<T> operator*(const matrix<T> &a, const matrix<T> &b) {
    int n = a.size();
    matrix<T> ret(n, vector<T>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < n; k++) {
                ret[i][j] += a[i][k] * b[k][j];
            }
        }
    }
    return ret;
}
template <typename T>
matrix<T> operator^(matrix<T> a, ll b) {
    int n = a.size();
    matrix<T> ret(n, vector<T>(n));
    for (int i = 0; i < n; i++) {
        ret[i][i] = 1;
    }
    while (b) {
        if (b & 1) {
            ret = ret * a;
        }
        a = a * a;
        b >>= 1;
    }
    return ret;
}

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;

int main() {
    int T;
    cin >> T;

    while (T--) {
        ll N;
        cin >> N;

        vector<vector<mint>> A = {{1, 26}, {0, 26}};
        A = A ^ N;

        mint ans = A[0][1];
        cout << ans << '\n';
    }
}
0