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

提出ソース

結果

問題	No.741 AscNumber(Easy)
ユーザー	xoke0114
提出日時	2018-10-06 02:11:32
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,489 bytes
コンパイル時間	1,622 ms
コンパイル使用メモリ	171,756 KB
実行使用メモリ	26,624 KB
最終ジャッジ日時	2024-10-12 13:41:20
合計ジャッジ時間	7,747 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	86 ms 26,624 KB
testcase_01	AC	83 ms 26,496 KB
testcase_02	AC	88 ms 26,624 KB
testcase_03	AC	91 ms 26,624 KB
testcase_04	AC	84 ms 26,624 KB
testcase_05	AC	84 ms 26,624 KB
testcase_06	AC	88 ms 26,624 KB
testcase_07	AC	89 ms 26,496 KB
testcase_08	AC	89 ms 26,496 KB
testcase_09	AC	84 ms 26,624 KB
testcase_10	AC	83 ms 26,624 KB
testcase_11	AC	83 ms 26,496 KB
testcase_12	AC	91 ms 26,624 KB
testcase_13	AC	86 ms 26,496 KB
testcase_14	AC	87 ms 26,624 KB
testcase_15	AC	88 ms 26,504 KB
testcase_16	AC	84 ms 26,624 KB
testcase_17	AC	91 ms 26,496 KB
testcase_18	AC	83 ms 26,624 KB
testcase_19	AC	87 ms 26,496 KB
testcase_20	AC	92 ms 26,496 KB
testcase_21	AC	85 ms 26,496 KB
testcase_22	AC	84 ms 26,496 KB
testcase_23	AC	83 ms 26,624 KB
testcase_24	AC	87 ms 26,496 KB
testcase_25	AC	84 ms 26,624 KB
testcase_26	AC	85 ms 26,496 KB
testcase_27	AC	86 ms 26,496 KB
testcase_28	AC	89 ms 26,496 KB
testcase_29	AC	88 ms 26,624 KB
testcase_30	AC	85 ms 26,624 KB
testcase_31	AC	91 ms 26,624 KB
testcase_32	AC	86 ms 26,624 KB
testcase_33	AC	86 ms 26,624 KB
testcase_34	AC	87 ms 26,568 KB
testcase_35	AC	84 ms 26,496 KB
testcase_36	AC	84 ms 26,624 KB
testcase_37	AC	87 ms 26,624 KB
testcase_38	AC	89 ms 26,496 KB
testcase_39	AC	91 ms 26,572 KB
testcase_40	AC	87 ms 26,496 KB
testcase_41	AC	87 ms 26,624 KB
testcase_42	AC	82 ms 26,624 KB
testcase_43	AC	89 ms 26,496 KB
testcase_44	AC	86 ms 26,624 KB
testcase_45	AC	83 ms 26,496 KB
testcase_46	AC	87 ms 26,620 KB
testcase_47	AC	87 ms 26,496 KB
testcase_48	AC	85 ms 26,624 KB
testcase_49	AC	88 ms 26,624 KB
testcase_50	AC	101 ms 26,624 KB
testcase_51	AC	85 ms 26,496 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	85 ms 26,600 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

using ull = unsigned long long;
using ll = long long;

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) ll x; cin >> x;

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int) (lower_bound(s, t, x) - s)
#define UB(s, t, x) (int) (upper_bound(s, t, x) - s)

ll qp(ll a, ll b, int mo) { ll ans = 1; do { if (b & 1) ans = 1ll * ans * a % mo; a = 1ll * a * a % mo; } while (b >>= 1); return ans; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll temp = gcd(a, b); return temp ? (a / temp * b) : 0; }
int mDays[] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = { 1, -1, 0, 0, 1, 1, -1, -1 }, dy8[] = { 0, 0, -1, 1, -1, 1, -1, 1 };

template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) { return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...)); }
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v) { for (auto &e : t) fill_v(e, v); }
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);

const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);

template <typename T>
vector<T> pows(int b, int n) {
    vector<T> ret;
    T x = 1;
    while (ret.size() < n) {
        ret.push_back(x);
        x *= b;
    }
    return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string& str, const std::string& from, const std::string& to) {
	std::string::size_type pos = 0;
	while (pos = str.find(from, pos), pos != std::string::npos) {
		str.replace(pos, from.length(), to);
		pos += to.length();
	}
}
template <class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T>
bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }

inline tuple<ll, ll> rotate45(tuple<ll, ll> point) { ll x = get<0>(point), y = get<1>(point); return tuple<ll, ll>(x + y, x - y); }
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) { return nx >= 0 and nx < Width and ny >= 0 and ny < Height; }

template <typename T>
vector<T> INPA(ll n) {
	vector<T> x;
	REP(i, n) {
		T tmp; cin >> tmp;
		x.push_back(tmp);
	}
	return move(x);
}
template <typename T>
void out(T o) { cout << o << endl; }
template <typename T>
void out(vector<T> &out) { REP(i, (int)out.size()) { cout << out[i]; if (i == (int)out.size() - 1) cout << endl; else cout << " "; } }
template <typename T>
void out(vector<vector<T>> o) { REP(i, o.size()) out(o[i]); }
void YesNo(bool f) { cout << (f?"Yes":"No") << endl; }
void YESNO(bool f) { cout << (f?"YES":"NO") << endl; }

// 1≤k≤n≤10^7
class BinomLib {
private:
    int mMax, mMod;
    vector<ll> fac, finv, inv;
public:
    BinomLib(int modNum = 1000000007, int maxSize = 1000000) {
        mMax = maxSize, mMod = modNum;
        fac = vector<ll>(maxSize);
        finv = vector<ll>(maxSize);
        inv = vector<ll>(maxSize);
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i < mMax; i++){
            fac[i] = fac[i - 1] * i % mMod;
            inv[i] = mMod - inv[mMod%i] * (mMod / i) % mMod;
            finv[i] = finv[i - 1] * inv[i] % mMod;
        }
    }

    ll nCr(int n, int k){
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n - k] % mMod) % mMod;
    }
    // number of cases to divide n objects into k groups
    ll nHr(int n, int k) {
        if (n == 0 and k == 0) return 1;
        return nCr(n + k - 1, n);
    }
};

int main(void)
{
    cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20);

    IN1(N);
    BinomLib bl;
    ll ans = bl.nCr(9 + N, 9);

    out(ans);    
  
    return 0;
}

yukicoder

結果

テストケース

ソースコード