結果
問題 | No.129 お年玉(2) |
ユーザー | kei |
提出日時 | 2018-08-16 01:11:31 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
MLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,795 bytes |
コンパイル時間 | 1,654 ms |
コンパイル使用メモリ | 165,508 KB |
実行使用メモリ | 777,076 KB |
最終ジャッジ日時 | 2023-08-18 18:09:30 |
合計ジャッジ時間 | 10,251 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
40,664 KB |
testcase_01 | MLE | - |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 118 ms
320,956 KB |
testcase_06 | AC | 189 ms
508,628 KB |
testcase_07 | MLE | - |
testcase_08 | AC | 156 ms
424,004 KB |
testcase_09 | MLE | - |
testcase_10 | MLE | - |
testcase_11 | AC | 153 ms
407,304 KB |
testcase_12 | MLE | - |
testcase_13 | MLE | - |
testcase_14 | MLE | - |
testcase_15 | AC | 164 ms
441,448 KB |
testcase_16 | AC | 189 ms
503,812 KB |
testcase_17 | MLE | - |
testcase_18 | MLE | - |
testcase_19 | MLE | - |
testcase_20 | MLE | - |
testcase_21 | MLE | - |
testcase_22 | AC | 159 ms
429,616 KB |
testcase_23 | MLE | - |
testcase_24 | MLE | - |
testcase_25 | AC | 153 ms
410,108 KB |
testcase_26 | AC | 156 ms
420,068 KB |
testcase_27 | AC | 152 ms
406,616 KB |
testcase_28 | MLE | - |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 1 ms
4,376 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 2 ms
4,376 KB |
testcase_33 | AC | 5 ms
7,648 KB |
testcase_34 | AC | 3 ms
4,784 KB |
testcase_35 | AC | 4 ms
7,184 KB |
testcase_36 | AC | 4 ms
7,808 KB |
testcase_37 | AC | 5 ms
8,980 KB |
testcase_38 | AC | 34 ms
85,384 KB |
testcase_39 | AC | 50 ms
130,920 KB |
testcase_40 | AC | 144 ms
379,736 KB |
testcase_41 | AC | 85 ms
229,304 KB |
testcase_42 | AC | 38 ms
96,600 KB |
testcase_43 | AC | 37 ms
96,012 KB |
testcase_44 | MLE | - |
testcase_45 | AC | 20 ms
53,296 KB |
testcase_46 | AC | 56 ms
148,048 KB |
testcase_47 | MLE | - |
testcase_48 | AC | 167 ms
448,292 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/129> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ const ll MOD = 1e9; ll solve(){ ll res = 0; ll N,M; cin >> N >> M; ll x = N-N/(1000*M)*(1000*M); x /= 1000; ll comb[M+1][M+1]; for (int i = 0; i <= M; i++) { for (int j = 0; j <= i; j++) { if (j == 0 || j == i) comb[i][j] = 1; else comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j])%MOD; } } res = comb[M][x]; return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }