#1177143 (C++17) No.3628 Sum of Superfibonacci Numbers

• 問題: No.3628 Sum of Superfibonacci Numbers
• ユーザー: GOTKAKO
• 提出日時: 2026-08-15 00:47:37
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: TLE
• 実行時間: -
• コード長: 4,465 bytes
• コンパイル時間: 1,378 ms
• コンパイル使用メモリ: 223,116 KB
• 実行使用メモリ: 12,428 KB
• 最終ジャッジ日時: 2026-08-15 00:47:48
• 合計ジャッジ時間: 10,669 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 5 TLE * 1 -- * 9

ソースコード

#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);

    const int n = 100000;
    vector<bool> ok(n);
    vector<int> add(n);
    ok.at(0) = true;
    for(int i=0; i<n; i++){
        string s = to_string(i);
        for(int k=0; k+2<s.size(); k++){
            int v1 = s.at(k)-'0';
            int v2 = s.at(k+1)-'0';
            int v3 = s.at(k+2)-'0';
            if(v1 > v2+v3){ok.at(i) = true; break;}
        }
    }
    for(int i=0; i<n; i++){
        int now = 0;
        for(int k=i; ; k=(k+1)%n,now++) if(ok.at(k)){add.at(i) = now; break;}            
    }
    vector<vector<int>> To(n,vector<int>(10));
    for(int i=0; i<n; i++) for(int k=0; k<10; k++){
        int v1 = i%100/10,v2 = i%10,v3 = k;
        if(v1 > v2+v3) To.at(i).at(k) = -1;
        else To.at(i).at(k) = (i*10+k)%n;
    }

    int T; cin >> T;
    while(T--){
        long long N; cin >> N;
        mint answer = mint(N%mod)*((N+1)%mod)/2;
        string s = to_string(N);
        vector<mint> dp(n);
        bool first = true;
        int now = 0;
        for(auto c : s){
            int v = c-'0';
            vector<mint> next(n);
            if(first){
                for(int i=1; i<v; i++) next.at(i)++;
                first = false;
            }
            else{
                for(int i=0; i<n; i++) for(int k=0; k<10; k++){
                    int to = To.at(i).at(k);
                    if(to != -1) next.at(to) += dp.at(i);
                }
                for(int i=1; i<10; i++) next.at(i)++;
                if(now != -1) for(int i=0; i<v; i++){
                    int to = To.at(now).at(i);
                    if(to != -1) next.at(to)++;
                }
            }
            if(now != -1) now = To.at(now).at(v);
            swap(dp,next);
        }
        if(now != -1) dp.at(now)++;
        for(int i=0; i<n; i++) answer += dp.at(i)*add.at(i);
        cout << answer << "\n";
    }
}