#471945 (C++14) No.741 AscNumber(Easy)

• 問題: No.741 AscNumber(Easy)
• ユーザー: ningenMe
• 提出日時: 2020-04-28 06:20:49
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 80 ms / 2,000 ms
• コード長: 6,079 bytes
• コンパイル時間: 1,531 ms
• コンパイル使用メモリ: 169,080 KB
• 実行使用メモリ: 26,584 KB
• 最終ジャッジ日時: 2023-08-15 11:00:41
• 合計ジャッジ時間: 4,160 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	1 ms; 4,376 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	2 ms; 4,376 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	1 ms; 4,376 KB
testcase_10	AC	2 ms; 4,380 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	1 ms; 4,380 KB
testcase_13	AC	1 ms; 4,376 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	2 ms; 4,376 KB
testcase_16	AC	2 ms; 4,376 KB
testcase_17	AC	1 ms; 4,376 KB
testcase_18	AC	2 ms; 4,376 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	1 ms; 4,380 KB
testcase_21	AC	1 ms; 4,376 KB
testcase_22	AC	2 ms; 4,380 KB
testcase_23	AC	1 ms; 4,376 KB
testcase_24	AC	1 ms; 4,380 KB
testcase_25	AC	1 ms; 4,380 KB
testcase_26	AC	2 ms; 4,380 KB
testcase_27	AC	1 ms; 4,376 KB
testcase_28	AC	1 ms; 4,380 KB
testcase_29	AC	2 ms; 4,380 KB
testcase_30	AC	1 ms; 4,380 KB
testcase_31	AC	1 ms; 4,376 KB
testcase_32	AC	1 ms; 4,380 KB
testcase_33	AC	1 ms; 4,380 KB
testcase_34	AC	1 ms; 4,376 KB
testcase_35	AC	72 ms; 25,436 KB
testcase_36	AC	30 ms; 12,648 KB
testcase_37	AC	36 ms; 14,564 KB
testcase_38	AC	34 ms; 14,304 KB
testcase_39	AC	28 ms; 12,716 KB
testcase_40	AC	39 ms; 15,952 KB
testcase_41	AC	66 ms; 23,548 KB
testcase_42	AC	36 ms; 13,796 KB
testcase_43	AC	24 ms; 10,932 KB
testcase_44	AC	48 ms; 19,080 KB
testcase_45	AC	52 ms; 20,332 KB
testcase_46	AC	68 ms; 24,084 KB
testcase_47	AC	12 ms; 6,656 KB
testcase_48	AC	68 ms; 24,164 KB
testcase_49	AC	57 ms; 20,848 KB
testcase_50	AC	8 ms; 5,388 KB
testcase_51	AC	26 ms; 11,080 KB
testcase_52	AC	80 ms; 26,584 KB
testcase_53	AC	76 ms; 26,512 KB
testcase_54	AC	69 ms; 26,212 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


template<long long mod> class ModInt {
public:
	long long x;
	ModInt():x(0) {
		// do nothing
	}
	ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {
		// do nothing
	}
	ModInt &operator+=(const ModInt &p) {
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator+=(const long long y) {
        ModInt p(y);
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator+=(const int y) {
        ModInt p(y);
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const ModInt &p) {
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const long long y) {
        ModInt p(y);
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const int y) {
        ModInt p(y);
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator*=(const ModInt &p) {
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator*=(const long long y) {
        ModInt p(y);
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator*=(const int y) {
        ModInt p(y);
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator/=(const ModInt &p) {
		*this *= p.inv();
		return *this;
	}
	ModInt &operator/=(const long long y) {
        ModInt p(y);
		*this *= p.inv();
		return *this;
	}
	ModInt &operator/=(const int y) {
        ModInt p(y);
		*this *= p.inv();
		return *this;
	}
	ModInt operator=(const int y) {
        ModInt p(y);
        *this = p;
        return *this;
    }
    ModInt operator=(const long long y) {
        ModInt p(y);
		*this = p;
        return *this;
    }
	ModInt operator-() const { return ModInt(-x); }
	ModInt operator++() { 
        x++;
        if(x>=mod) x-=mod;
        return *this; 
    }
	ModInt operator--() { 
        x--;
        if(x<0) x+=mod;
        return *this; 
    }
	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
	bool operator==(const ModInt &p) const { return x == p.x; }
	bool operator!=(const ModInt &p) const { return x != p.x; }
	ModInt inv() const {
		int a = x, b = mod, u = 1, v = 0, t;
		while(b > 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}
	ModInt pow(long long n) const {
		ModInt ret(1), mul(x);
		while(n > 0) {
			if(n & 1) ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}
	friend ostream &operator<<(ostream &os, const ModInt &p) {
		return os << p.x;
	}
	friend istream &operator>>(istream &is, ModInt &a) {
		long long t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}
};
using modint = ModInt<MOD>;


//Combination Mod
class CombinationMod {
	vector<long long> fac,finv,inv;
	const long long mod;
public:
	CombinationMod(int N,long long mod) : fac(N + 1), finv(N + 1), inv(N + 1), mod(mod) {
		fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
		for (int i = 2; i <= N; ++i) {
			fac[i] = fac[i - 1] * i % mod;
			inv[i] = mod - inv[mod%i] * (mod / i) % mod;
			finv[i] = finv[i - 1] * inv[i] % mod;
		}
	}
	inline long long binom(int n, int k) {
		return ((n < 0 || k < 0 || n < k) ? 0 : fac[n] * (finv[k] * finv[n - k] % mod) % mod);
	}
    inline long long factorial(int n) {
        return fac[n];
    }
};

//verify https://atcoder.jp/contests/abc021/tasks/abc021_d


int main() {
    int N; cin >> N;
    CombinationMod CM(N+10,MOD);
    cout << CM.binom(N+9,9) << endl;
    return 0;
}