結果
問題 | No.1085 桁和の桁和 |
ユーザー |
|
提出日時 | 2020-06-19 21:57:51 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,606 bytes |
コンパイル時間 | 1,692 ms |
コンパイル使用メモリ | 172,468 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 00:03:28 |
合計ジャッジ時間 | 3,098 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 33 WA * 2 |
ソースコード
#include<bits/stdc++.h>using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;usingPL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;#define pqueue priority_queuetemplate<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;#define _ol3(_1,_2,_3,name,...)name#define _rep(i,n)_repi(i,0,n)#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)#define REPR(i,n)for(int i=n-1;i>=0;--i)#define REPA(i,v)REP(i,(v).size())#define all(v)(v).begin(),(v).end()#define rall(v)(v).rbegin(),(v).rend()#define bit(n)(1ll<<(n))#define F first#define S second#define endl '\n'void _print(ostream&){}template<class T,class...U>void _print(ostream&s,const T&t,const U&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}template<class...T>void print(const T&...t){_print(cout,t...);}template<class...T>void dprint(const T&...t){_print(cerr,t...);}#ifndef LOCALstruct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;#define dprint(...)#define cerr cer_#endif#define dbg(x) dprint("@l",__LINE__,':',#x,'=',x)#define cho(n,a,b)print((n)?a:b)void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}template<class T, class U>bool chmax(T&a,const U&b){bool x=a<b;x?a=b:b;return x;}template<class T, class U>bool chmin(T&a,const U&b){bool x=a>b;x?a=b:b;return x;}template<class T, class U>auto max(const T&a,const U&b){return a<b?b:a;}template<class T, class U>auto min(const T&a,const U&b){return a<b?a:b;}template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}template<class T>class iterable{static false_type c(string v);template<class U>static auto c(U v)->decltype(all(v),true_type());static false_type c(...);public:const static bool value=decltype(c(declval<T>()))::value;};template<class T,enable_if_t<iterable<T>::value,int> =0>ostream&operator<<(ostream&o,const T&v){for(auto&&i:v)o<<i<<' ';return o;}template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}template<class T,class U>queue<T,U>&operator<<(queue<T,U>&v, const T&t){v.push(t);return v;}template<class T,class U>queue<T,U>&operator>>(queue<T,U>&v, T&t){t=v.front();v.pop();return v;}template<class T,class U,class V>pqueue<T,U,V>&operator<<(pqueue<T,U,V>&v, const T&t){v.push(t);return v;}template<class T,class U,class V>pqueue<T,U,V>&operator>>(pqueue<T,U,V>&v, T&t){t=v.front();v.pop();return v;}template<class T,class U>stack<T,U>&operator<<(stack<T,U>&v, const T&t){v.push(t);return v;}template<class T,class U>stack<T,U>&operator>>(stack<T,U>&v, T&t){t=v.front();v.pop();return v;}template<class T,class U,class V>set<T,U,V>&operator<<(set<T,U,V>&v,const T&t){v.insert(t);return v;}template<class T,class U,class V>multiset<T,U,V>&operator<<(multiset<T,U,V>&v,const T&t){v.insert(t);return v;}template<class T,enable_if_t<is_integral<T>::value,int> =0>T mod(T a, T b){if(a>0)return a%b;return b-(-a%b);}template<class T,enable_if_t<is_floating_point<T>::value,int> =0>T mod(T a, T b){if(a>0)return fmod(a,b);return b-fmod(-a,b);}template<class T,class U>pair<T,U>&operator+=(pair<T,U>&a, const pair<T,U>&b){a.F+=b.F;a.S+=b.S;return a;}template<class T,class U>pair<T,U> operator+(const pair<T,U>&a, const pair<T,U>&b){auto r=a;return r+=b;}template<class T,class U>pair<T,U>&operator-=(pair<T,U>&a, const pair<T,U>&b){a.F-=b.F;a.S-=b.S;return a;}template<class T,class U>pair<T,U> operator-(const pair<T,U>&a, const pair<T,U>&b){auto r=a;return r-=b;}template<class T,class U>pair<T,U> operator-(const pair<T,U>&a){return {-a.F, -a.S};}template<class T,class U>double norm(const pair<T,U>&p){return norm(p.F)+norm(p.S);}template<class T,class U>double abs(const pair<T,U>&p){returnsqrt(norm(p));}inline ll square(ll a){a%=MOD;return (a*a)%MOD;}ll lpow(ll a,ll b){a%=MOD;b%=MOD-1;if(b==0)return 1;if(b==1)return a;if(b%2){return (square(lpow(a,b/2)%MOD)*a)%MOD;}else{return square(lpow(a,b/2)%MOD);}}ll fact(ll n){ll ans=1;while(n){ans=(ans*n--)%MOD;}return ans;}ll factto(ll a,ll b){ll ans=1;for(ll i=a;i<=b;i++){ans=(ans*i)%MOD;}return ans;}ll perm(ll n,ll r){ // nPrreturn factto(n-r+1,n)%MOD;}ll comb(ll n,ll r){ // nCrreturn (perm(n,r)*lpow(fact(r),MOD-2))%MOD;}ll homo(ll n,ll r){ // nHrreturn comb(n+r-1,r);}int main(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(10);string t;int d;cin>>t>>d;int q = 0;int s = 0;bool f = 0;bool g = 1;REPA(i,t){if(t[i]=='?') ++q;else {(s += t[i] - '0') %= 9;g = 0;}if(t[i] != '?' && t[i] != '0') f=true;}if(d==0) {if(f) {print(0);} else {print(1);}} else {int targ = (d - s + 9) % 9;dbg(targ);vi dp(9);dp[0] = 1;REP(i,q) {vi dpb(9);REP(j,10)REP(k,9)(dpb[(k+j)%9] += dp[k])%=MOD;dp.swap(dpb);}int ans = dp[targ];if (g && d==9) --ans;print(ans);}}