Contests

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

#define ll long long
#define ld long double
#define ii pair<int,int>
#define si pair<string,int>
#define iii pair<int,ii>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define msvs map<string,vs>
#define msi map<string,int>
#define mss map<string,int>
#define us unordered_set
#define um unordered_map
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define forall(i,a,b) for (int i=a;i<b;i++)
#define foreach(v,c) for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define N (1<<17)
#define M 1000000007
#define I 500000004

ll d[2000][2000];

ll f(int a, int b) {
	if (a/b > 10) return 0;
	if (a <= 10) return d[a+b-1][b-1]%M;
	ll sum = 0;
	for (int i = 0; i <= 10; i++) {
		sum = (sum%M+f(a-i,b-1)%M)%M;
		sum %= M;
	}
	return sum%M;
}

int main()
{
	for (int i = 0; i < 2000; i++) {
		d[i][0] = 1;
		for (int j = 1; j <= i; j++) {
			d[i][j] = (d[i-1][j-1]+d[i-1][j-1])%M;
			d[i][j] %= M;
		}
	}
	int n,s;
	cin >> n >> s;
	int x = 0;
	int y = 0;
	for (int i = 0; i < n; i++) {
		char a; cin >> a;
		if (a == '?') x++;
		else y += a - '0';
	}
	int z = s - y;
	cout << f(z,x) << "\n";
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: TIME LIMIT EXCEEDED