#500427 (C++17) No.1085 桁和の桁和

• 問題: No.1085 桁和の桁和
• ユーザー: chocopuu
• 提出日時: 2020-06-20 16:00:46
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 3,716 bytes
• コンパイル時間: 2,229 ms
• コンパイル使用メモリ: 204,016 KB
• 実行使用メモリ: 11,520 KB
• 最終ジャッジ日時: 2024-11-06 17:42:16
• 合計ジャッジ時間: 3,836 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	33 ms; 11,264 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	5 ms; 5,248 KB
testcase_14	AC	11 ms; 6,528 KB
testcase_15	AC	22 ms; 10,496 KB
testcase_16	AC	22 ms; 10,368 KB
testcase_17	AC	11 ms; 6,784 KB
testcase_18	AC	8 ms; 5,248 KB
testcase_19	AC	20 ms; 9,600 KB
testcase_20	AC	21 ms; 9,728 KB
testcase_21	AC	14 ms; 7,296 KB
testcase_22	AC	19 ms; 8,960 KB
testcase_23	AC	4 ms; 5,248 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	12 ms; 6,912 KB
testcase_26	AC	23 ms; 10,624 KB
testcase_27	AC	18 ms; 9,088 KB
testcase_28	AC	26 ms; 11,520 KB
testcase_29	AC	15 ms; 7,680 KB
testcase_30	AC	14 ms; 7,296 KB
testcase_31	AC	22 ms; 10,368 KB
testcase_32	AC	16 ms; 8,064 KB
testcase_33	AC	34 ms; 11,520 KB
testcase_34	AC	33 ms; 11,520 KB
testcase_35	AC	34 ms; 11,520 KB
testcase_36	AC	34 ms; 11,392 KB
testcase_37	AC	34 ms; 11,520 KB
testcase_38	AC	34 ms; 11,520 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};
 
// 二項係数ライブラリ
template<class T> struct BiCoef {
	vector<T> fact_, inv_, finv_;
	constexpr BiCoef() {}
	constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
		init(n);
	}
	constexpr void init(int n) noexcept {
		fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
		int MOD = fact_[0].getmod();
		for(int i = 2; i < n; i++){
			fact_[i] = fact_[i-1] * i;
			inv_[i] = -inv_[MOD%i] * (MOD/i);
			finv_[i] = finv_[i-1] * inv_[i];
		}
	}
	constexpr T com(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[k] * finv_[n-k];
	}
	constexpr T fact(int n) const noexcept {
		if (n < 0) return 0;
		return fact_[n];
	}
	constexpr T inv(int n) const noexcept {
		if (n < 0) return 0;
		return inv_[n];
	}
	constexpr T finv(int n) const noexcept {
		if (n < 0) return 0;
		return finv_[n];
	}
};
 
const int MOD = 1000000007;
// const int MOD = 
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);

mint dp[100010][10];

signed main(){
	string s;
	cin >> s;
	int D;
	cin >> D;
	dp[0][0] = 1;
	auto digitSum = [](int n) -> int{
		return n / 10 + n % 10;
	};
	REP(i,s.size()){
		REP(j,10){
			if(s[i] != '?'){
				dp[i + 1][digitSum(j + (s[i] - '0'))] += dp[i][j];
				continue;
			}
			REP(k,10){
				dp[i + 1][digitSum(j + k)] += dp[i][j];
			}
		}
	}
	out(dp[s.size()][D]);
}