Contests

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <sstream>
#include <queue>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>
#include <stack>

using namespace std;

#define all(x) (x).begin(),x.end()
#define ii pair<int, int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long

#define MAXN 101
#define MAXS 1001
const int INF = 1000000007;

int a[MAXN];
int dp[MAXN][MAXS];
int n, s;

int main() {
	cin >> n >> s;

	string tmp;

	for (int i = 0; i < n; i++) {
		cin >> tmp;
		if (tmp.compare("?") == 0) {
			a[i] = -1;
		} else {
			a[i] = stoi(tmp);
		}
	}

	memset(dp, 0, sizeof(dp));
	if (a[0] == -1) {
		for (int i = 0; i <= 10; i++) {
			dp[0][i] = 1;
		}
	} else {
		dp[0][a[0]] = 1;
	}

	for (int i = 1; i < n; i++) {
		for (int j = 0; j <= s; j++) {
			if (a[i] != -1) {
				if (j >= a[i]) {
					dp[i][j] = dp[i-1][j-a[i]];	
				}
			} else {
				int tmp = min(j, 10);
				for (int k = 0; k <= tmp; k++) {
					dp[i][j] = (dp[i][j] + dp[i-1][j-k]) % INF;
				}
			}
		}
	}

	cout << dp[n-1][s];
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED