#768870 (C++14) No.1964 sum = length

• 問題: No.1964 sum = length
• ユーザー: woodywoody
• 提出日時: 2022-06-07 21:50:33
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 3,355 bytes
• コンパイル時間: 4,154 ms
• コンパイル使用メモリ: 231,484 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-21 04:56:29
• 合計ジャッジ時間: 5,966 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	5 ms; 5,376 KB
testcase_15	AC	6 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	27 ms; 5,376 KB
testcase_23	AC	26 ms; 5,376 KB
testcase_24	AC	12 ms; 5,376 KB
testcase_25	AC	14 ms; 5,376 KB
testcase_26	AC	31 ms; 5,376 KB
testcase_27	AC	19 ms; 5,376 KB
testcase_28	AC	14 ms; 5,376 KB
testcase_29	AC	23 ms; 5,376 KB
testcase_30	AC	15 ms; 5,376 KB
testcase_31	AC	31 ms; 5,376 KB
testcase_32	AC	7 ms; 5,376 KB
testcase_33	AC	7 ms; 5,376 KB
testcase_34	AC	26 ms; 5,376 KB
testcase_35	AC	9 ms; 5,376 KB
testcase_36	AC	17 ms; 5,376 KB
testcase_37	AC	22 ms; 5,376 KB
testcase_38	AC	33 ms; 5,376 KB
testcase_39	AC	14 ms; 5,376 KB
testcase_40	AC	15 ms; 5,376 KB
testcase_41	AC	29 ms; 5,376 KB
testcase_42	AC	35 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

int main(){
    int n; cin>>n;

    vm dp(2*n+1);

    rep1(i,2*n+1){
        string s = to_string(i);
        int k = i - (sz(s));

        int nj = k + n;
        if (nj < 0) continue;
        if (nj >= 2*n+1) continue;
        dp[nj] += 1;
    }

    // rep(i,2*n+1){
    //     show(i);
    //     cout << dp[i].val() << endl;
    // }

    rep(i,n-1){
        vm tmp(2*n+1);
        swap(tmp , dp);

        rep1(ii,2*n+1){
            string s = to_string(ii);
            int k = ii - (sz(s)+1);

            rep(j,2*n+1){
                int nj = k + j;
                if (nj < 0) continue;
                if (nj >= 2*n+1) continue;

                dp[nj] += tmp[j];
            }  
        }

        // show(i);

        // rep(j,2*n+1){
        //     show(j);
        //     cout << dp[j].val() << endl;
        // }
    }

    cout << dp[n].val() << endl;

    return 0;
}