#868913 (C++17) No.2302 Carry X Times

• 問題: No.2302 Carry X Times
• ユーザー: noya2
• 提出日時: 2023-05-12 22:39:12
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 85 ms / 2,000 ms
• コード長: 4,193 bytes
• コンパイル時間: 4,893 ms
• コンパイル使用メモリ: 274,644 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-28 19:12:38
• 合計ジャッジ時間: 6,349 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 5,248 KB
testcase_01	AC	12 ms; 5,248 KB
testcase_02	AC	28 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	82 ms; 5,248 KB
testcase_11	AC	79 ms; 5,248 KB
testcase_12	AC	83 ms; 5,248 KB
testcase_13	AC	69 ms; 5,248 KB
testcase_14	AC	85 ms; 5,248 KB
testcase_15	AC	42 ms; 5,248 KB
testcase_16	AC	40 ms; 5,248 KB
testcase_17	AC	78 ms; 5,248 KB
testcase_18	AC	57 ms; 5,248 KB
testcase_19	AC	60 ms; 5,248 KB
testcase_20	AC	60 ms; 5,248 KB
testcase_21	AC	60 ms; 5,248 KB
testcase_22	AC	54 ms; 5,248 KB
testcase_23	AC	59 ms; 5,248 KB
testcase_24	AC	52 ms; 5,248 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,m,n) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}

using dat = array<ll,4>;
map<dat,mint> mp;

mint calc(ll n, ll m, ll x, ll p){
    if (x < 0) return mint(0);
    if (n == 0 && m == 0){
        if (x == 0) return mint(1);
        return mint(0);
    }
    if (mp.find({n,m,x,p}) != mp.end()) return mp[{n,m,x,p}];
    mint ans = 0;
    rep(a,10) rep(b,10){
        if (a > n || b > m) continue;
        ll tn = (n-a)/10, tm = (m-b)/10, tx = x, tp = 0;
        if (a + b + p >= 10){
            tx--;
            tp = 1;
        }
        ans += calc(tn,tm,tx,tp);
    }
    return mp[{n,m,x,p}] = ans;
}

void solve(){
    mp.clear();
    ll n, x; cin >> n >> x;
    out(calc(n,n,x,0));
}

int main(){
    fast_io();
    int t = 1; cin >> t;
    while(t--) solve();
}