Codeforces Round #220 (Div. 2) C. Inna and Dima （记忆化搜索）(二)
1; return dp[x][y]; } int main() { int i,j,t; next['D']='I',next['I']='M'; next['M']='A',next['A']='D'; while(~scanf("%d%d",&n,&m)) { for(i=0;i
=INF/4) printf("Poor Inna!\n"); else printf("%d\n",ans); } return 0; } /* 5 5 DIMAD DIIDI DIMAM DDMMA AAMID */