結果
問題 | No.1085 桁和の桁和 |
ユーザー | suta28407928 |
提出日時 | 2020-06-19 22:06:52 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 49 ms / 2,000 ms |
コード長 | 3,282 bytes |
コンパイル時間 | 797 ms |
コンパイル使用メモリ | 96,400 KB |
実行使用メモリ | 11,360 KB |
最終ジャッジ日時 | 2023-08-06 14:29:10 |
合計ジャッジ時間 | 3,023 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 46 ms
11,048 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 6 ms
4,376 KB |
testcase_14 | AC | 14 ms
6,388 KB |
testcase_15 | AC | 28 ms
10,152 KB |
testcase_16 | AC | 28 ms
10,056 KB |
testcase_17 | AC | 14 ms
6,508 KB |
testcase_18 | AC | 8 ms
5,052 KB |
testcase_19 | AC | 25 ms
9,396 KB |
testcase_20 | AC | 25 ms
9,424 KB |
testcase_21 | AC | 17 ms
7,292 KB |
testcase_22 | AC | 23 ms
8,892 KB |
testcase_23 | AC | 3 ms
4,380 KB |
testcase_24 | AC | 2 ms
4,376 KB |
testcase_25 | AC | 15 ms
6,844 KB |
testcase_26 | AC | 29 ms
10,332 KB |
testcase_27 | AC | 24 ms
9,008 KB |
testcase_28 | AC | 32 ms
11,268 KB |
testcase_29 | AC | 18 ms
7,824 KB |
testcase_30 | AC | 16 ms
7,192 KB |
testcase_31 | AC | 28 ms
10,112 KB |
testcase_32 | AC | 19 ms
8,020 KB |
testcase_33 | AC | 47 ms
11,360 KB |
testcase_34 | AC | 48 ms
11,284 KB |
testcase_35 | AC | 48 ms
11,292 KB |
testcase_36 | AC | 48 ms
11,292 KB |
testcase_37 | AC | 49 ms
11,300 KB |
testcase_38 | AC | 48 ms
11,344 KB |
ソースコード
#include <iostream> #include <string> #include <cstdlib> #include <cmath> #include <vector> #include <unordered_map> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> #include <functional> #include <bitset> #include <assert.h> #include <unordered_map> #include <fstream> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 510000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } const int mod = 1e9 + 7; //const int mod = 998244353; template <std::uint_fast64_t Modulus> class modint { using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; int digsum(int x){ int res = 0; while(x > 0) res += x % 10, x /= 10; return res; } mint dp[100005][10]; int main(){ string s; cin >> s; int d; cin >> d; int n = s.size(); dp[0][0] = 1; rep(i,n){ if(s[i] == '?'){ rep(j,10){ rep(k,10){ dp[i+1][digsum(j+k)] += dp[i][j]; } } }else{ int c = s[i] - '0'; rep(j,10){ dp[i+1][digsum(j+c)] += dp[i][j]; } } } cout << dp[n][d].value() << "\n"; }