結果

問題 No.741 AscNumber(Easy)
ユーザー はまやんはまやんはまやんはまやん
提出日時 2018-10-05 21:29:27
言語 C++14
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 3,247 Byte
コンパイル時間 1,307 ms
使用メモリ 43,028 KB
最終ジャッジ日時 2022-06-20 06:00:03
合計ジャッジ時間 5,751 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 39 ms
42,944 KB
testcase_01 AC 39 ms
43,024 KB
testcase_02 AC 42 ms
42,848 KB
testcase_03 AC 40 ms
42,956 KB
testcase_04 AC 40 ms
42,940 KB
testcase_05 AC 40 ms
42,852 KB
testcase_06 AC 39 ms
42,948 KB
testcase_07 AC 40 ms
42,844 KB
testcase_08 AC 39 ms
42,848 KB
testcase_09 AC 40 ms
42,916 KB
testcase_10 AC 39 ms
42,912 KB
testcase_11 AC 41 ms
42,852 KB
testcase_12 AC 39 ms
42,984 KB
testcase_13 AC 38 ms
42,976 KB
testcase_14 AC 38 ms
42,944 KB
testcase_15 AC 38 ms
42,928 KB
testcase_16 AC 39 ms
42,844 KB
testcase_17 AC 39 ms
42,956 KB
testcase_18 AC 38 ms
42,944 KB
testcase_19 AC 39 ms
42,904 KB
testcase_20 AC 38 ms
42,912 KB
testcase_21 AC 39 ms
42,916 KB
testcase_22 AC 39 ms
42,900 KB
testcase_23 AC 38 ms
42,912 KB
testcase_24 AC 38 ms
42,916 KB
testcase_25 AC 41 ms
42,956 KB
testcase_26 AC 39 ms
42,852 KB
testcase_27 AC 38 ms
42,856 KB
testcase_28 AC 39 ms
42,972 KB
testcase_29 AC 39 ms
42,948 KB
testcase_30 AC 39 ms
42,856 KB
testcase_31 AC 39 ms
42,944 KB
testcase_32 AC 38 ms
42,952 KB
testcase_33 AC 38 ms
42,848 KB
testcase_34 AC 39 ms
42,916 KB
testcase_35 AC 101 ms
42,944 KB
testcase_36 AC 66 ms
42,852 KB
testcase_37 AC 71 ms
42,896 KB
testcase_38 AC 71 ms
42,900 KB
testcase_39 AC 66 ms
42,960 KB
testcase_40 AC 75 ms
42,856 KB
testcase_41 AC 97 ms
42,984 KB
testcase_42 AC 70 ms
42,852 KB
testcase_43 AC 62 ms
42,852 KB
testcase_44 AC 84 ms
42,848 KB
testcase_45 AC 87 ms
42,956 KB
testcase_46 AC 98 ms
42,944 KB
testcase_47 AC 48 ms
42,848 KB
testcase_48 AC 98 ms
42,852 KB
testcase_49 AC 89 ms
42,912 KB
testcase_50 AC 46 ms
42,948 KB
testcase_51 AC 61 ms
42,852 KB
testcase_52 AC 114 ms
42,952 KB
testcase_53 AC 109 ms
43,028 KB
testcase_54 AC 108 ms
42,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/




int N;
mint dp[1010101][10];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;

    rep(i, 0, 10) dp[1][i] = 1;
    rep(i, 1, N) rep(lst, 0, 10) {
        rep(nxt, lst, 10) dp[i + 1][nxt] += dp[i][lst];
    }
    
    mint ans = 0;
    rep(lst, 0, 10) ans += dp[N][lst];
    cout << ans << endl;
}
0