Restore Calculation
Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu
Description
Input
Output
Sample Input
3?4 12? 5?6 ?2?4 5?7? ?9?2 ????? ????? ????? 0
Sample Output
2 40 200039979
Hint
传说中的数位dp,第一次写dp的题,借鉴了大牛的代码,还好懂了一点点。。。(求第n位有多少种情况满足,则需求第n+1位有多少种情况满足,而每位上有两种情况,一是无进位,二是有进位,第n+1位的情况总数就等于该位的有进位时情况总数加上无进位时情况总数)
代码:
<span style="color:#333333;">#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MOD 1000000007
int main()
{
int len,dp[55][2];
char a[55],b[55],c[55];
while(scanf("%s%s%s",a,b,c)!=EOF)
{
if(a[0]=='0') break;
len=strlen(a);
memset(dp, 0, sizeof(dp));
dp[len][0]=1;
for(int i=len-1; i>=0; i--)
{
for(int p=0; p<2; p++)
{
for(int j=0; j<=9; j++)
{
if(a[i]=='?'||a[i]-'0'==j)
{
if(i==0&&j==0) continue;
for(int k=0; k<=9; k++)
{
if(b[i]=='?'||b[i]-'0'==k)
{
if(i==0&&k==0) continue;
if( c[i]=='?' || (j+k+p)%10==c[i]-'0' )
dp[i][(j+k+p)/10]=(dp[i][(j+k+p)/10]+</span><span style="color:#ff0000;">dp[i+1][p]</span><span style="color:#333333;">)%MOD;
}
}
}
}
}
}
printf("%d\n",dp[0][0]);
}
return 0;
}
</span>