結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2020-05-26 05:12:27 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 543 ms / 2,000 ms |
コード長 | 2,078 bytes |
コンパイル時間 | 1,575 ms |
コンパイル使用メモリ | 168,996 KB |
実行使用メモリ | 160,548 KB |
最終ジャッジ日時 | 2024-10-13 02:33:04 |
合計ジャッジ時間 | 9,822 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
#include <bits/stdc++.h>using namespace std;// #define int long long#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)#define SORT(v, n) sort(v, v + n);#define REVERSE(v, n) reverse(v, v+n);#define vsort(v) sort(v.begin(), v.end());#define all(v) v.begin(), v.end()#define mp(n, m) make_pair(n, m);#define cout(d) cout<<d<<endl;#define coutd(d) cout<<std::setprecision(10)<<d<<endl;#define cinline(n) getline(cin,n);#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);#define PI (acos(-1))#define FILL(v, n, x) fill(v, v + n, x);#define sz(x) long long(x.size())using ll = long long;using vi = vector<int>;using vvi = vector<vi>;using vll = vector<ll>;using vvll = vector<vll>;using pii = pair<int, int>;using pll = pair<ll, ll>;using vs = vector<string>;using vpll = vector<pair<ll, ll>>;using tll = tuple<ll,ll,ll>;using vtll = vector<tuple<ll,ll,ll>>;using vb = vector<bool>;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }const ll INF = 1e9;const ll MOD = 1e9+7;const ll LINF = 1e18;ll dp[1001000][2][10]; // pos, isLess, prevNumsigned main(){cin.tie( 0 ); ios::sync_with_stdio( false );ll n; cin>>n;string s="1";rep(i,n) s.push_back('0');dp[0][0][0]=1;rep(i,n+1) rep(j,2) rep(k,10){ll now=s[i]-'0';rep(nxt,10){if(nxt>now&&j==0) continue;if(nxt<k) continue;ll nj=j, nk=nxt;if(nxt<now) nj=1;(dp[i+1][nj][nk]+=dp[i][j][k])%=MOD;}}ll ans=0;rep(k,10) (ans+=dp[n+1][1][k])%=MOD;cout<<ans<<endl;}