2012年4月25日
hdu 2082 找单词(母函数)
摘要： Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2000 Accepted Submission(s): 1423Problem Description假设有x1个字母A， x2个字母B,..... x26个字母Z，同时假设字母A的价值为1，字母B的价值为2,..... 字母Z的价值为26。那么，对于给定的字母，可以找到多少价值 #include using namespace std; int f[55],word[27],cun[55]. 阅读全文
posted @ 2012-04-25 20:17 剑不飞 阅读(181) 评论(0) 推荐(0) 编辑
hdu 1372 Knight Moves(广搜)
摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3001 Accepted Submission(s): 1868Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits 阅读全文
posted @ 2012-04-25 17:32 剑不飞 阅读(147) 评论(0) 推荐(0) 编辑
hdu 1035 Robot Motion
摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3266 Accepted Submission(s): 1519Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a gri 阅读全文
posted @ 2012-04-25 16:21 剑不飞 阅读(150) 评论(0) 推荐(0) 编辑