Contests

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>

#define MOD 1000000007
#define ll long long
#define N (1<<50)
#define float double
#define str string

using namespace std;

int m[1001][101];

ll lask(int sum, int n){
    if(sum<0||n<0)
        return 0;
    if(m[sum][n]!=-1)
        return m[sum][n];

    ll ret=0;
    for(int i=1; i<=10; i++)
        if(sum-i>=0)
            ret+=lask(sum-i,n-1), ret%=MOD;
    ret%=MOD;
    m[sum][n]=ret;
    return ret;
}

int main(){
    for(int i=0; i<=1000; i++)
        for(int e=0; e<=100; e++)
            m[i][e]=-1;

    m[0][0]=1;

    int n,s;
    cin>>n>>s;
    int kys=0;

    for(int i=0; i<n; i++){
        string a;
        cin>>a;
        if(a=="?")
            kys++;
        else{
            if(a!="10")
                s-=a[0]-'0';
            else
                s-=10;
        }
    }

    cout<<lask(s,kys)<<endl;

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER