做了此题后明白原来这就是数位DP。。做法就是从最后一位向前推,DP[ i ][ j ](i代表位数,j代表进位0或者1)表示从后往前到第i位数字进位 j 的方案数,暴力枚举2个数,然后看能不能跟第3个数一起成立,成立了就要给dp[ i ][ j1 ]加dp[ i+1 ][ j2 ]。.j1和j2是进位跟枚举有关系。
AC代码:
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<ctime>
using namespace std;
#define NMAX 10000000
#define MOD 1000000007
#define ll long long
char a[4][100];
int dp[100][2];
int main()
{
// freopen("input.txt","r",stdin);
// freopen("o1.txt","w",stdout);
int i,j,k,l;
while(gets(a[0]) && a[0][0] != '0')
{
gets(a[1]);
gets(a[2]);
int len = strlen(a[0]);
int flag;
memset(dp,0,sizeof(dp));
dp[len][0] = 1;
for(i = len-1; i >= 0; i--)
{
if(i == 0) flag = 1;
else flag = 0;
for(l = 0; l < 2; l++) if(dp[i+1][l] > 0)
for(j = flag; j < 10; j++) if(a[0][i] == '?' || j == a[0][i]-'0')
for(k = flag; k < 10; k++) if(a[1][i] == '?' || k == a[1][i]-'0')
if(a[2][i] == '?' || a[2][i]-'0' == (j+k+l)%10)
{
int &t = dp[i][(j+k+l)/10];
t = ((ll)t+(ll)dp[i+1][l])%MOD;
}
}
printf("%d\n",dp[0][0]);
}
return 0;
}