結果
| 問題 | No.189 SUPER HAPPY DAY |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-04-22 00:43:38 |
| 言語 | C++11 (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 81 ms / 5,000 ms |
| コード長 | 5,862 bytes |
| コンパイル時間 | 1,027 ms |
| コンパイル使用メモリ | 119,824 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-04 22:01:34 |
| 合計ジャッジ時間 | 3,560 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 23 |
ソースコード
#include <cassert>// c#include <iostream>// io#include <iomanip>#include <fstream>#include <sstream>#include <vector>// container#include <map>#include <set>#include <queue>#include <bitset>#include <stack>#include <algorithm>// other#include <complex>#include <numeric>#include <functional>#include <random>#include <regex>using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;#define ALL(c) c.begin(),c.end()template<class T> bool IN(T l,T v,T r){return l<=v && v <r;}template<class T> void UNIQUE(T v){v.erase(unique(ALL(v)),v.end());}//debug#define DUMP(x) cerr << #x <<" = " << (x)#define LINE() cerr<< " (L" << __LINE__ << ")"struct range{struct Iter{int v,step;Iter& operator++(){v+=step;return *this;}bool operator!=(Iter& itr){return v<itr.v;}int& operator*(){return v;}};Iter i, n;range(int i, int n,int step):i({i,step}), n({n,step}){}range(int i, int n):range(i,n,1){}range(int n):range(0,n){}Iter& begin(){return i;}Iter& end(){return n;}};struct rrange{struct Iter{int v,step;Iter& operator++(){v-=step;return *this;}bool operator!=(Iter& itr){return v>itr.v;}int& operator*(){return v;}};Iter i, n;rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}rrange(int i, int n):rrange(i,n,1){}rrange(int n) :rrange(0,n){}Iter& begin(){return n;}Iter& end(){return i;}};//inputtemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}//outputtemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<""<<get<2>(t);}template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}returnos;}// valuestemplate<typename T> inline T INF(){assert(false);};template<> inline int INF<int>(){return 1<<28;};template<> inline ll INF<ll>(){return 1LL<<58;};template<> inline double INF<double>(){return 1e16;};template<> inline long double INF<long double>(){return 1e16;};template<class T> inline T EPS(){assert(false);};template<> inline int EPS<int>(){return 1;};template<> inline ll EPS<ll>(){return 1LL;};template<> inline double EPS<double>(){return 1e-8;};template<> inline long double EPS<long double>(){return 1e-8;};// min{2^r | n < 2^r}template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}// max{d | 2^d <= n}template<typename T> T msb(T n){ int d=63;while((1LL<<d)>n)d--;return d;}template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }ll lcm(ll a,ll b){return a/gcd(a,b)*b;}ll MOD = 1000000009;class Main{public:void run(){string M,D;cin >> M >> D;// 200 * 9vector<vector<ll>> pre(200+1,vector<ll>(200*9+10));// d桁任意の時の和pre[0][0]=1;for(int p = 1;p<=200;p++){for(int val=0;val<200*9+10;val++){for(int v = 0;v<=9;v++)if(val-v>=0){pre[p][val]+=pre[p-1][val-v];pre[p][val]%=MOD;}}}vector<ll> dpM(200 * 9 + 10);{int vs = 0;for(int d=0;d<M.size();d++){vector<ll> ndpM(200*9+10);//確定組for(int v=0;v<M[d]-'0';v++){for(int val = 0;val<200*9+10;val++)if(val-v-vs>=0){dpM[val]+=pre[M.size()-(d+1)][val-v-vs];dpM[val]%=MOD;}}vs+=M[d]-'0';}dpM[vs]++;dpM[vs]%=MOD;}dpM[0]=pmod(dpM[0]-1,MOD);vector<ll> dpD(200 * 9 + 10);{int vs = 0;for(int d=0;d<D.size();d++){//確定組for(int v=0;v<D[d]-'0';v++){for(int val = 0;val<200*9+10;val++)if(val-v-vs>=0){dpD[val]+=pre[D.size()-(d+1)][val-v-vs];dpD[val]%=MOD;}}vs+=D[d]-'0';}dpD[vs]++;dpD[vs]%=MOD;}dpD[0]=pmod(dpD[0]-1,MOD);ll res =0;for(int val=0;val<200*9+10;val++){res += dpM[val]*dpD[val];res%=MOD;}cout << res <<endl;}};int main(){cout <<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);Main().run();return 0;}