这次在湖大oj上做的,开始wa了几次,后来想到空串的情况,加了特判才A。真叫人蛋疼。。
#include <stdio.h>
#include <string.h>int dp[35][5][5][5][5][5][5];
int visit[35][5][5][5][5][5][5];
int a[7];
int max(int x,int y)
{
return x>y?x:y;
}
int dfs(int sum,int a1,int a2,int a3,int a4,int a5,int a6)
{
if(sum==31) return 0;
if(sum>31) return 1;
if(visit[sum][a1][a2][a3][a4][a5][a6]==1)
return dp[sum][a1][a2][a3][a4][a5][a6];
if(a1>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+1,a1-1,a2,a3,a4,a5,a6),
dp[sum][a1][a2][a3][a4][a5][a6]);
if(a2>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+2,a1,a2-1,a3,a4,a5,a6),
dp[sum][a1][a2][a3][a4][a5][a6]);
if(a3>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+3,a1,a2,a3-1,a4,a5,a6),
dp[sum][a1][a2][a3][a4][a5][a6]);
if(a4>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+4,a1,a2,a3,a4-1,a5,a6),
dp[sum][a1][a2][a3][a4][a5][a6]);
if(a5>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+5,a1,a2,a3,a4,a5-1,a6),
dp[sum][a1][a2][a3][a4][a5][a6]);
if(a6>0)
dp[sum][a1][a2][a3][a4][a5][a6]=max(1-dfs(sum+6,a1,a2,a3,a4,a5,a6-1),
dp[sum][a1][a2][a3][a4][a5][a6]);
visit[sum][a1][a2][a3][a4][a5][a6]=1;
return dp[sum][a1][a2][a3][a4][a5][a6];
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int i,j,n,sum,t;
char s[1000];
memset(visit,0,sizeof(visit));
memset(dp,-1,sizeof(a));
while(gets(s)!=NULL)
{
sum=0;
for(i=1;i<=6;i++)
a[i]=4;
int len=strlen(s);
if(len==0){
printf("B\n");
continue;
}
for(i=0;i<len;i++){
t=s[i]-'0';
a[t]--;
sum+=t;
}
if(sum>=31)
{
if(len%2==0)
printf("%s B\n",s);
else
printf("%s A\n",s);
continue;
}
if(dfs(sum,a[1],a[2],a[3],a[4],a[5],a[6])==1)
{
if(len%2==0)
printf("%s A\n",s);
else printf("%s B\n",s);
}
else
{
if(len%2==0)
printf("%s B\n",s);
else
printf("%s A\n",s);
}
}
}