結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2023-09-28 20:42:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 219 ms / 2,000 ms |
コード長 | 2,086 bytes |
コンパイル時間 | 1,906 ms |
コンパイル使用メモリ | 197,708 KB |
最終ジャッジ日時 | 2025-02-17 02:49:35 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using V = vector<ll>;using VV = vector<V>;using VVV = vector<VV>;using VVVV = vector<VVV>;using VVVVV = vector<VVVV>;using VVVVVV = vector<VVVVV>;using VS = vector<string>;using VB = vector<bool>;using P = pair<ll,ll>;using M = map<ll,ll>;using Q = queue<ll>;using PQ = priority_queue<ll>;using PQG = priority_queue<ll,V,greater<ll>>;using S = set<ll>;using VP = vector<P>;const ll MOD = 1000000007;const ll mod = 998244353;const ll INF = 1LL << 60;#define rep(i,n) for(ll i = 0; i < n; i++)#define rep2(i,s,n) for(ll i = s; i < n; i++)#define per(i,n) for(ll i = n-1; i >= 0; i--)#define per2(i,s,n) for(ll i = n-1; i >= s; i--)#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define fi first#define se second#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define lb lower_bound#define ub upper_bound#define cfix(x) cout<<fixed<<setprecision(x)template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;}template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return true;}return false;}template<class T>void Vin(vector<T>&a){rep(i,(ll)a.size())cin>>a[i];}template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}template<class T>void Vout(const vector<T>&a){rep(i,(ll)a.size()-1)cout<<a[i]<<" ";cout<<a.back()<<'\n';}template<class T>void Voutl(const vector<T>&a){rep(i,(ll)a.size())cout<<a[i]<<'\n';}ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n;cin >> n;VV dp(n + 1, V(10));dp[0][0] = 1;rep(i, n) {rep(last, 10) {rep2(x, last, 10) {(dp[i + 1][x] += dp[i][last]) %= MOD;}}}ll ans = 0;rep(i, 10) ans += dp[n][i];cout << ans % MOD << endl;}