Contests

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;


int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	int n, s; cin >> n >> s;
	int a[110];
	for(int i = 0; i < n; i++){
		string lol; cin >> lol;
		if(lol[0] == '?')
			a[i] = -1;
		else if(lol.size() == 1)
			a[i] = lol[0]-'0';
		else 
			a[i] = 10;
		
	}
	unordered_map<int, int> lol[101];
	if(a[0] == -1){
		for(int i = 0; i <= 10; i++)
			lol[0][i]++;
	}
	else
		lol[0][a[0]]++;
	for(int i = 1; i < n; i++){
		if(a[i] == -1){
			for(auto f: lol[i-1]){
				for(int j = 0; j < 11; j++){
					if(f.first+j > s)
						break;
					lol[i][f.first+j]+=f.second;
					lol[i][f.first+j]%=defmod;
				}
			}
		}
		else{
			for(auto f: lol[i-1]){
				lol[i][f.first+a[i]]+=f.second;
				lol[i][f.first]%=defmod;
			}
		}
	}
	cout << lol[n-1][s] << endl;
	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