#844416 (C++17) No.1964 sum = length

• 問題: No.1964 sum = length
• ユーザー: sten_san
• 提出日時: 2023-02-27 12:11:38
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 13 ms / 2,000 ms
• コード長: 3,047 bytes
• コンパイル時間: 2,514 ms
• コンパイル使用メモリ: 209,380 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-14 20:33:25
• 合計ジャッジ時間: 4,113 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 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	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 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	10 ms; 5,376 KB
testcase_23	AC	10 ms; 5,376 KB
testcase_24	AC	6 ms; 5,376 KB
testcase_25	AC	6 ms; 5,376 KB
testcase_26	AC	11 ms; 5,376 KB
testcase_27	AC	8 ms; 5,376 KB
testcase_28	AC	5 ms; 5,376 KB
testcase_29	AC	8 ms; 5,376 KB
testcase_30	AC	6 ms; 5,376 KB
testcase_31	AC	11 ms; 5,376 KB
testcase_32	AC	4 ms; 5,376 KB
testcase_33	AC	3 ms; 5,376 KB
testcase_34	AC	10 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	7 ms; 5,376 KB
testcase_37	AC	8 ms; 5,376 KB
testcase_38	AC	12 ms; 5,376 KB
testcase_39	AC	6 ms; 5,376 KB
testcase_40	AC	6 ms; 5,376 KB
testcase_41	AC	11 ms; 5,376 KB
testcase_42	AC	13 ms; 5,376 KB

ソースコード

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

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

    auto log10 = vec<int>(uns, 0);
    for (int i = 0; i - int(size(to_string(i))) <= n; ++i) {
        log10.push_back(int(size(to_string(i))));
    }

    auto dp = vec<mint>(0, n + 1, n);

    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < n; ++j) {
            for (int k = 1; k - log10[k] <= j; ++k) {
                dp[i][j] += dp[i - 1][j - k + log10[k]];
            }
        }
    }

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