Submission #1161669

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[500][500];
ll A[500];
ll B[500];

int main() {
	ll N, C;
	cin >> N >> C;
	for (ll i = 0; i < N; ++i) cin >> A[i];
	for (ll i = 0; i < N; ++i) cin >> B[i];
	
	memset(dp, 0, sizeof(dp));
	dp[0][0] =  1;
	for (ll a = 0; a <= N; ++a) {
		for (ll b = 0; b <= C; ++b) {
			ll sum = 0;
			for (ll c = 0; c < b; ++c) sum += dp[a][c] * pow(A[a], (b - c));
			dp[a+1][b] = dp[a][b] + sum;
		}
	}
	cout << dp[N][C] << endl;
}

Submission Info

Judge Result