#1166179 (C++17) No.3549 SigMax Digits (Judge ver.)

• 問題: No.3549 SigMax Digits (Judge ver.)
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-05-22 23:18:36
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 535 ms / 3,000 ms
• コード長: 3,872 bytes
• コンパイル時間: 2,813 ms
• コンパイル使用メモリ: 215,040 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-22 23:18:46
• 合計ジャッジ時間: 7,959 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_1

ファイルパターン	結果
sample	AC * 1
other	AC * 7

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

vector<ll> n_adic(ll i, ll n, ll N) {
    ll x = 1;
    rep(j, N) { x *= n; }
    vector<ll> vec(N);
    rep(j, N) {
        x /= n;
        vec[j] = i / x;
        i -= x * vec[j];
    }
    return vec;
}

ll solve(ll x){
    // 個数だけでよい
    vector<ll> bin = n_adic(x, 10, 18);
    vector<vector<ll>> dp(18, vector<ll>(10, 0));
    for (ll i = 0; i < bin[0]; i++) dp[0][i]++;
    ll max_val = bin[0];

    for (ll i = 1; i < 18; i++){
        for (ll j = 0; j < 10; j++){
            for (ll k = 0; k < 10; k++){
                dp[i][max(j, k)] += dp[i - 1][j];
            }
        }
        for (ll j = 0; j < bin[i]; j++){
            dp[i][max(j, max_val)]++;
        }
        max_val = max(max_val, bin[i]);
    }
    ll ans = 0;
    for (ll i = 0; i < 10; i++){
        ans += dp[17][i] * i;
    }
    ans += max_val;
    return ans;
}

int main() {
    ll T;
    cin >> T;
    while (T--){
        ll L, R;
        cin >> L >> R;
        cout << solve(R) - solve(L - 1) << endl;
    }
}