結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2023-02-06 10:17:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 3,156 bytes |
コンパイル時間 | 2,001 ms |
コンパイル使用メモリ | 192,640 KB |
最終ジャッジ日時 | 2025-02-10 11:19:30 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define rep(i, N) for(int i=0;i<(N);i++)#define all(x) (x).begin(),(x).end()#define popcount(x) __builtin_popcount(x)using ll = long long;//using i128=__int128_t;using ld = long double;using graph = vector<vector<int>>;using P = pair<int, int>;const int inf = 1e9;const ll infl = 1e18;const ld eps = 1e-6;const long double pi = acos(-1);const ll MOD = 1e9 + 7;const ll MOD2 = 998244353;const int dx[4] = { 1,0,-1,0 };const int dy[4] = { 0,1,0,-1 };template<class T>inline void chmax(T&x,T y){if(x<y)x=y;}template<class T>inline void chmin(T&x,T y){if(x>y)x=y;}template<const ll mod>class modint {private:using mint = modint<mod>;ll value = 0;public:modint(ll v = 0) {v %= mod;if(v < 0)v += mod;value = v;}ll val() {return value % mod;}mint operator+(mint fp) {return mint(value + fp.val());}mint operator-(mint fp) {return mint(value - fp.val());}mint operator*(mint fp) {return mint(value * fp.val());}void operator=(mint fp) {value = fp.val();}void operator=(ll val) {value = val % mod;if(value < 0) {value += mod;}}void operator+=(mint fp) {(value += fp.val()) %= mod;if(value < 0) {value += mod;}}void operator-=(mint fp) {value = value - fp.val();value %= mod;if(value < 0) {value += mod;}}void operator*=(mint fp) {value = value * fp.val();value = value % mod;if(value < 0) {value += mod;}}bool operator==(mint fp) {return value == fp.val();}bool operator<(mint fp) {return value < fp.val();}bool operator>(mint fp) {return value > fp.val();}bool operator<=(mint fp) {return value <= fp.val();}bool operator>=(mint fp) {return value >= fp.val();}ll inv() {return mod_pow(mod - 2);}ll mod_pow(ll exp) {ll base = value;ll ans = 1;base %= mod;while (exp > 0) {if (exp & 1) {ans *= base;ans %= mod;}base *= base;base %= mod;exp >>= 1;}return ans;}mint operator/(mint a) {return mint(a.inv()*value);}void operator/=(mint a) {value = value * a.inv();value %= mod;}friend istream& operator>>(istream& is, mint& mt) {ll v;is >> v;mt = mint(v);return is;}friend ostream& operator << (ostream& os, mint& mt) {return os << mt.val();}};using mint=modint<MOD>;mint dp[1000001][10];int main() {int n;cin>>n;dp[0][0]=1;rep(i,n)rep(j,10){rep(nex,10){if(nex<j)continue;dp[i+1][nex]+=dp[i][j];}}mint ans=0;rep(i,10){ans+=dp[n][i];}cout<<ans<<endl;}