結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2018-10-29 07:47:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 1,905 bytes |
コンパイル時間 | 1,680 ms |
コンパイル使用メモリ | 192,240 KB |
最終ジャッジ日時 | 2025-01-06 14:59:14 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < (n); i++)#define repi(i, a, b) for (int i = (a); i < (b); i++)#define all(a) (a).begin(), (a).end()using namespace std;using i32 = int;using i64 = long long;using f64 = double;using vi32 = vector<i32>;using vvi32 = vector<vi32>;using vi64 = vector<i64>;using vvi64 = vector<vi64>;template<typename T> inline bool amin(T &x, T y) { if (y < x) { x = y; return true; } return false; }template<typename T> inline bool amax(T &x, T y) { if (x < y) { x = y; return true; } return false; }template<int mod> class modint {public:int x;modint(): x(0) {}modint(int a) { x = a % mod; if (x < 0) x += mod; }modint &operator+=(modint that) { x = (x + that.x) % mod; return *this; }modint &operator-=(modint that) { x = (x + mod - that.x) % mod; return *this; }modint &operator*=(modint that) { x = (long long) x * that.x % mod; return *this; }modint &operator/=(modint that) { return *this *= that.inverse(); }modint operator-() { return modint(-this->x); }friend ostream& operator<<(ostream &out, modint m) { return out << m.x; }modint inverse() {int a = x, b = mod, u = 1, v = 0;while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }return modint(u);}#define op(o, p) modint operator o(modint that) { return modint(*this) p that; }op(+, +=) op(-, -=) op(*, *=) op(/, /=)#undef op#define op(o) bool operator o(modint that) { return x o that.x; }op(==) op(!=) op(<) op(<=) op(>) op(>=)#undef op};using mint = modint<1000000007>;int main() {ios::sync_with_stdio(false);cin.tie(0);int n;cin >> n;mint w[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1};mint ans;while (n) {ans = 0;for (int i = 0; i < 10; i++) {ans += w[i];if (i > 0) {w[i] += w[i - 1];}}n--;}cout << ans << endl;return 0;}