#1155751 (C++17) No.8133 ‮Reversed‪

• 問題: No.8133 ‮Reversed‪
• ユーザー: GOTKAKO
• 提出日時: 2026-04-01 22:45:36
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,031 bytes
• コンパイル時間: 1,733 ms
• コンパイル使用メモリ: 218,356 KB
• 実行使用メモリ: 224,628 KB
• 最終ジャッジ日時: 2026-04-01 22:45:47
• 合計ジャッジ時間: 4,599 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge4_0

ファイルパターン	結果
sample	WA * 1
other	WA * 6

ソースコード

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

//入力が必ず-mod<=a<modの時.
template<const long long mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(long long 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 = (__int128_t)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<7'000'000'001LL>; const long long mod = 7'000'000'001LL;

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

    vector<bool> already(20);
    vector<mint> memo(20);
    auto all = [&](long long d) -> mint {
        if(already.at(d)) return memo.at(d);
        already.at(d) = true;
        long long p10 = 1;
        for(int i=0; i<d; i++) p10 *= 10;
        memo.at(d) = mint(p10/2%mod)*mint((p10-1)%mod);
        return memo.at(d);
    };

    auto f = [&](long long x) -> mint {
        auto dfs = [&](auto dfs,int digit,long long p10,long long left,bool zero = false) -> mint {
            mint ret = 0;
            int d = 1;
            if(zero) d = 0;
            while(left >= p10 && d < 10){
                ret += (p10%mod*d)%mod;
                ret += all(digit)*10;
                left -= p10,d++;
            }
            if(d == 10) ret += dfs(dfs,digit+1,p10*10,left);
            else if(left){
                ret += (left%mod*d)%mod;
                ret += dfs(dfs,digit-1,p10/10,left,true)*10;
            }
            return ret;
        };
        return dfs(dfs,0,1,x);
    }; 

    long long N; cin >> N;
    while(N--){
        string s,t; cin >> s >> t;
        reverse(s.begin(),s.end());
        reverse(t.begin(),t.end());
        
        long long L = stoll(t),R = stoll(s);

        mint small = f(L-1),big = f(R);
        long long v = (big-small).v;
        s = to_string(v);
        reverse(s.begin(),s.end());
        cout << s << "\n";
    }
}