Enigma Gym - 101889E

https://cn.vjudge.net/problem/Gym-101889E 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

const int maxn=1e3+9;
const int mod=1e9+7;

int dp[maxn][maxn];
bool f=0;
int n;
string s;
vector<int>ans;
void dfs(int pos,int yu)
{
    if(f) return ;
    if(pos==s.length())
    {
        if(yu==0)
        {
            f=1;
            for(int i=0;i<ans.size();i++)
            {
                cout<<ans[i];
            }
            cout<<endl;
        }
        return ;
    }
    if(dp[pos][yu]!=-1) return ;

    if(s[pos]=='?')
    {
        for(int i=0;i<=9;i++)
        {
            if(f) return ;
            if(i==0&&pos==0) continue;
            ans.pb(i);
            dfs(pos+1,(yu*10+i)%n);
            ans.pop_back();
        }
    }
    else
    {
        if(f) return ;
        int id=s[pos]-'0';
        ans.pb(id);
        dfs(pos+1,(yu*10+id)%n);
        ans.pop_back();
    }
    dp[pos][yu]=1;
}

int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    mem(dp,-1);
    cin>>s>>n;

    dfs(0,0);

    if(!f) cout<<"*"<<endl;

    return 0;
}