結果
問題 | No.1085 桁和の桁和 |
ユーザー |
![]() |
提出日時 | 2020-06-19 22:10:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 39 ms / 2,000 ms |
コード長 | 3,553 bytes |
コンパイル時間 | 1,857 ms |
コンパイル使用メモリ | 172,720 KB |
実行使用メモリ | 15,360 KB |
最終ジャッジ日時 | 2024-11-06 17:34:52 |
合計ジャッジ時間 | 3,516 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>#include <unistd.h>#include <sys/time.h>#include <stdlib.h>using namespace std;typedef long long ll;typedef pair<ll, ll> P;typedef pair<P, ll> T;typedef pair<long double , ll> Ps;typedef pair<ll, bool> Pb;const ll INF = 1e18;const ll fact_table = 3200008;long double Pi = 3.1415926535897932384626;priority_queue <ll> pql;priority_queue <P> pqp;priority_queue <P> bag;//big priority queuepriority_queue <ll, vector<ll>, greater<ll> > pqls;priority_queue <P, vector<P>, greater<P> > pqps;//small priority queue//top popll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};char dir[] = "DRUL";//↓,→,↑,←/*#define endl "\n"#ifdef ENJAPMA#undef endl#endif*/#define p(x) cout<<x<<endl;#define el cout<<endl;#define pe(x) cout<<x<<" ";#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;#define pu(x) cout<<(x);#define pb push_back#define lb lower_bound#define ub upper_bound#define CLEAR(a) a = decltype(a)();#define pc(x) cout << x << ",";#define rep(i, n) for (ll i = 0; i < (n); i ++)// const ll mod = 998244353ll;const ll mod = 1000000007ll;ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}void line() { p("--------------------"); return;}/*ll fact[fact_table + 5],rfact[fact_table + 5];void c3_init(){fact[0] = rfact[0] = 1;for(ll i=1; i<=fact_table; i++){fact[i] = (fact[i-1]*i) % mod;}rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);for(ll i=fact_table; i>=1; i--){rfact[i-1] = rfact[i] * i;rfact[i-1] %= mod;}return;}ll c3(ll n,ll r){return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}*/bool multicase = false;ll n, m, k, num, a, b, c, d, e, h, q, ans, sum;typedef vector<ll> vec;typedef vector<vector<ll>> mat;vector<ll> v, u;string s;ll x[200005];ll dp[100005][15];void solve() {cin >> s;cin >> k;ll n = s.size();if (k == 0) {// 別処理bool dame = false;for (ll i = 0; i < n; i++) {if (s[i] != '0' && s[i] != '?') dame = true;}if (dame) {p(0);} else {p(1);}return;}ll sum = 0;ll cnt = 0;for (ll i = 0; i < n; i++) {if (s[i] == '?') {cnt ++;continue;}sum += s[i] - '0';sum %= 9;}dp[0][sum] = 1ll;for (ll i = 0; i < cnt; i++) {for (ll j = 0; j < 9; j ++) {for (ll k = 0; k <= 9; k ++) {dp[i + 1][(j + k) % 9] += dp[i][j];dp[i + 1][(j + k) % 9] %= mod;}}}ll ans = 0;ll idx = k;if (idx == 9) idx = 0;ans = dp[cnt][idx];if (k == 9) {bool dame = false;for (ll i = 0; i < n; i++) {if (s[i] != '0' && s[i] != '?') dame = true;}if (!dame) ans += mod - 1;ans %= mod;}p(ans);return;}int main() {// init();ios::sync_with_stdio(false);cin.tie(nullptr);ll q, testcase = 1;if (multicase) {cin >> q;} else {q = 1;}while (q--) {// pu("Case ");pu("#");pu(testcase);pu(": ");solve();testcase++;}// solve();return 0;}