結果

問題 No.42 貯金箱の溜息
ユーザー kei
提出日時 2018-04-18 00:32:53
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 68 ms / 5,000 ms
コード長 3,661 bytes
コンパイル時間 1,505 ms
コンパイル使用メモリ 169,248 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-27 04:19:53
合計ジャッジ時間 2,316 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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/42>
============================================================
1 5 10 50 100 500 6 使
1 5 10 50 100 500 10^20
M
M
M
1 M
M 10^9+9
=================================================================
=============================================================
================================================================
*/
const ll MOD = 1e9+9;
ll powmod(ll a,ll b) {ll res=1;a%=MOD;for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
ll mod_inverse(ll a,ll b){ return powmod(a,b-2);}
#define MAX_N 3010
ll dp[MAX_N];
ll C[6] = {1,5,10,50,100,500};
void solve(){
for(int i = 0; i < MAX_N;i++) dp[i] = 1;
for(int i = 1; i < 6;i++){
for(ll j = C[i]; j < MAX_N;j++){
(dp[j] += dp[j-C[i]])%=MOD;
}
}
ll T; cin >> T;
while(T--){
ll M; cin >> M;
if(M < MAX_N){
cout << dp[M] << endl;
continue;
}
ll ans = 0;
ll q = M%500;
ll m = (M/500)%MOD;
for(int i = 0; i < 6;i++){
ll tmp = 1;
for(int j = 0; j < 6;j++){
if(i==j) continue;
(tmp *= m-j)%=MOD;
(tmp *= mod_inverse(i-j,MOD))%=MOD;
}
(tmp *= dp[i*500+q]) %= MOD;
(ans += tmp) %= MOD;
}
ans = (ans+MOD)%MOD;
cout << ans << endl;
}
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0