結果
問題 | No.1964 sum = length |
ユーザー | ___Johniel |
提出日時 | 2022-06-12 22:11:20 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,451 ms / 2,000 ms |
コード長 | 2,415 bytes |
コンパイル時間 | 1,432 ms |
コンパイル使用メモリ | 167,800 KB |
実行使用メモリ | 4,544 KB |
最終ジャッジ日時 | 2023-10-24 16:46:43 |
合計ジャッジ時間 | 32,517 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 17 ms
4,544 KB |
testcase_01 | AC | 10 ms
4,544 KB |
testcase_02 | AC | 130 ms
4,544 KB |
testcase_03 | AC | 10 ms
4,544 KB |
testcase_04 | AC | 17 ms
4,544 KB |
testcase_05 | AC | 24 ms
4,544 KB |
testcase_06 | AC | 32 ms
4,544 KB |
testcase_07 | AC | 40 ms
4,544 KB |
testcase_08 | AC | 47 ms
4,544 KB |
testcase_09 | AC | 54 ms
4,544 KB |
testcase_10 | AC | 61 ms
4,544 KB |
testcase_11 | AC | 68 ms
4,544 KB |
testcase_12 | AC | 312 ms
4,544 KB |
testcase_13 | AC | 446 ms
4,544 KB |
testcase_14 | AC | 595 ms
4,544 KB |
testcase_15 | AC | 681 ms
4,544 KB |
testcase_16 | AC | 118 ms
4,544 KB |
testcase_17 | AC | 355 ms
4,544 KB |
testcase_18 | AC | 392 ms
4,544 KB |
testcase_19 | AC | 254 ms
4,544 KB |
testcase_20 | AC | 280 ms
4,544 KB |
testcase_21 | AC | 111 ms
4,544 KB |
testcase_22 | AC | 1,345 ms
4,544 KB |
testcase_23 | AC | 1,310 ms
4,544 KB |
testcase_24 | AC | 954 ms
4,544 KB |
testcase_25 | AC | 1,028 ms
4,544 KB |
testcase_26 | AC | 1,363 ms
4,544 KB |
testcase_27 | AC | 1,128 ms
4,544 KB |
testcase_28 | AC | 1,015 ms
4,544 KB |
testcase_29 | AC | 1,236 ms
4,544 KB |
testcase_30 | AC | 1,065 ms
4,544 KB |
testcase_31 | AC | 1,381 ms
4,544 KB |
testcase_32 | AC | 762 ms
4,544 KB |
testcase_33 | AC | 731 ms
4,544 KB |
testcase_34 | AC | 1,304 ms
4,544 KB |
testcase_35 | AC | 885 ms
4,544 KB |
testcase_36 | AC | 1,090 ms
4,544 KB |
testcase_37 | AC | 1,216 ms
4,544 KB |
testcase_38 | AC | 1,449 ms
4,544 KB |
testcase_39 | AC | 1,026 ms
4,544 KB |
testcase_40 | AC | 1,057 ms
4,544 KB |
testcase_41 | AC | 1,407 ms
4,544 KB |
testcase_42 | AC | 1,451 ms
4,544 KB |
ソースコード
// yukicoder/1964/main.cpp // author: @___Johniel // github: https://github.com/johniel/ #include <bits/stdc++.h> #define each(i, c) for (auto& i : c) #define unless(cond) if (!(cond)) // #define endl "\n" using namespace std; template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; } template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; } template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; } template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; } template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; } template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; } template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[]{"; for (auto& i: a) os << i << ","; os << "}"; return os; } template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); } template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); } using lli = long long int; using ull = unsigned long long; using point = complex<double>; using str = string; template<typename T> using vec = vector<T>; constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1}); constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1}); constexpr lli mod = 998244353; int main(int argc, char *argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios_base::fixed); cout.precision(15); int n; while (cin >> n) { const int N = 300 + 3; static lli dp[N][N]; fill(&dp[0][0], &dp[N - 1][N - 1] + 1, 0); dp[0][0] = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < N; ++j) { for (int k = 1; k < N; ++k) { static char buff[100]; sprintf(buff, "%d", k); int x = j + k - strlen(buff); if (0 <= x && x < N) (dp[i + 1][x] += dp[i][j]) %= mod; } } } cout << dp[n][n-1] << endl; } return 0; }