結果

問題 No.3277 Forever Monotonic Number
コンテスト
ユーザー GOTKAKO
提出日時 2025-09-20 01:59:28
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 289 ms / 4,000 ms
コード長 3,520 bytes
コンパイル時間 2,011 ms
コンパイル使用メモリ 207,676 KB
実行使用メモリ 29,056 KB
最終ジャッジ日時 2025-09-20 01:59:35
合計ジャッジ時間 5,515 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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){
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
        //b!=0 mod素数が必須.
    }
    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{assert(v); 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);

    set<long long> S = {1,2,3,4,5,6,7,8,9};
    long long inf = 1'000'000'000'000'000LL;
    queue<long long> Q;
    for(int i=1; i<10; i++) Q.push(i);
    while(Q.size()){
        long long s = Q.front(); Q.pop();
        if(s*10 >= inf) break;
        long long d = 0,s2 = s;
        while(s2) d += s2%10,s2 /= 10;

        for(int i=s%10; i<10; i++){
            long long ns = s*10+i,nd = d+i;
            if(S.count(nd)) S.insert(ns);
            Q.push(ns);
        }
    }
    //cout << S.size() << endl;
    int T; cin >> T;
    mint div9 = mint(9).inv();
    while(T--){
        long long N; cin >> N; N++;
        long long d = (*S.lower_bound(N))-N;
        long long nine = d/8; d %= 8;

        mint answer = (mint(10).pow(nine)-1)*div9*8;
        answer += mint(10).pow(nine)*d;
        answer += (mint(10).pow(N)-1)*div9;
        cout << answer.v << "\n";
    }
}
0