結果
問題 | No.741 AscNumber(Easy) |
ユーザー | playroller |
提出日時 | 2020-02-11 23:17:38 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 478 ms / 2,000 ms |
コード長 | 3,028 bytes |
コンパイル時間 | 2,557 ms |
コンパイル使用メモリ | 174,816 KB |
実行使用メモリ | 276,652 KB |
最終ジャッジ日時 | 2024-04-08 17:27:24 |
合計ジャッジ時間 | 11,179 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 2 ms
6,676 KB |
testcase_07 | AC | 2 ms
6,676 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 2 ms
6,676 KB |
testcase_10 | AC | 2 ms
6,676 KB |
testcase_11 | AC | 2 ms
6,676 KB |
testcase_12 | AC | 2 ms
6,676 KB |
testcase_13 | AC | 2 ms
6,676 KB |
testcase_14 | AC | 2 ms
6,676 KB |
testcase_15 | AC | 2 ms
6,676 KB |
testcase_16 | AC | 2 ms
6,676 KB |
testcase_17 | AC | 2 ms
6,676 KB |
testcase_18 | AC | 2 ms
6,676 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 2 ms
6,676 KB |
testcase_21 | AC | 2 ms
6,676 KB |
testcase_22 | AC | 2 ms
6,676 KB |
testcase_23 | AC | 2 ms
6,676 KB |
testcase_24 | AC | 2 ms
6,676 KB |
testcase_25 | AC | 2 ms
6,676 KB |
testcase_26 | AC | 2 ms
6,676 KB |
testcase_27 | AC | 2 ms
6,676 KB |
testcase_28 | AC | 2 ms
6,676 KB |
testcase_29 | AC | 2 ms
6,676 KB |
testcase_30 | AC | 2 ms
6,676 KB |
testcase_31 | AC | 2 ms
6,676 KB |
testcase_32 | AC | 2 ms
6,676 KB |
testcase_33 | AC | 2 ms
6,676 KB |
testcase_34 | AC | 2 ms
6,676 KB |
testcase_35 | AC | 466 ms
263,864 KB |
testcase_36 | AC | 201 ms
116,724 KB |
testcase_37 | AC | 236 ms
136,932 KB |
testcase_38 | AC | 236 ms
134,972 KB |
testcase_39 | AC | 200 ms
114,532 KB |
testcase_40 | AC | 269 ms
154,524 KB |
testcase_41 | AC | 420 ms
241,000 KB |
testcase_42 | AC | 225 ms
129,092 KB |
testcase_43 | AC | 163 ms
94,184 KB |
testcase_44 | AC | 330 ms
189,384 KB |
testcase_45 | AC | 350 ms
203,992 KB |
testcase_46 | AC | 436 ms
251,124 KB |
testcase_47 | AC | 74 ms
45,140 KB |
testcase_48 | AC | 433 ms
251,172 KB |
testcase_49 | AC | 369 ms
210,340 KB |
testcase_50 | AC | 51 ms
31,232 KB |
testcase_51 | AC | 169 ms
98,804 KB |
testcase_52 | AC | 478 ms
276,652 KB |
testcase_53 | AC | 476 ms
276,652 KB |
testcase_54 | AC | 477 ms
273,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i,j,n) for(int i=j;i<n;++i) #define all(i) i.begin(),i.end() #define rall(i) i.rbegin(), i.rend() #define INF 1e9 #define LINF 1e18 const int mod = 1e9 + 7; typedef long long i64; typedef pair<int, int> pi; template <class T> using vt = vector<T>; template <class T> using vvt = vector<vector<T>>; i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));} i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);} int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; template <std::int_fast64_t MOD> class ModInt { private: std::int_fast64_t value; public: ModInt() : value(0) {} ModInt(std::int_fast64_t x) : value(x % MOD) { if(value < 0) value += MOD; } ModInt &operator+=(const ModInt &x) { value += x.value; if(value >= MOD) value -= MOD; return *this; } ModInt &operator-=(const ModInt &x) { if(value < x.value) value += MOD; value -= x.value; return *this; } ModInt &operator*=(const ModInt &x) { value = value * x.value % MOD; return *this; } ModInt &operator/=(const ModInt &x) { *this *= x.inverse(); return *this; } ModInt operator-() const { return ModInt(-value); } ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; } bool operator==(const ModInt *x) const { return value == x.value; } bool operator!=(const ModInt *x) const { return value != x.value; } ModInt inverse() const { std::int_fast64_t a = value, b = MOD, u = 1, v = 0, t; while(b > 0) { t = a / b; std::swap(a -= t * b, b); std::swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(value); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { return os << x.value; } friend std::istream &operator>>(std::istream &is, ModInt &x) { std::int_fast64_t t; is >> t; x = ModInt<MOD>(t); return is; } static std::int_fast64_t get_mod() { return MOD; } }; using modint = ModInt<mod>; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; int l = n + 1; vvt<vt<modint>> dp(l + 1, vvt<modint>(2, vt<modint>(10, modint(0)))); dp[0][0][0] = 1; rep(i, 0, l) { int d = 0; if(i == 0) d = 1; rep(smaller, 0, 2) { rep(j, 0, (smaller ? 9 : d) + 1) { rep(k, 0, 10) { if(j >= k) dp[i + 1][smaller || j < d][j] += dp[i][smaller][k]; } } } } modint ans(0); rep(i, 0, 10) ans += dp[l][0][i] + dp[l][1][i]; cout << ans << endl; }