摘要: 1013: Polynomial MultiplicationResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K4660807StandardA polynomial is a sum of terms, where each term is a coefficient multiplied by the variable x raised to some nonnegative integer power. The largest such power is referred to as the degree of the po 阅读全文
posted @ 2012-04-17 21:51 漂木 阅读(347) 评论(0) 推荐(0) 编辑
摘要: 2608: 石子ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s65536K791210StandardXiao Tang和Xiao Jiang非常喜欢玩一种有趣的小游戏: 有N个石子,两人轮流从中取出1个, 3个或4个石子,当石子被取空时,游戏结束。 最后一个取石子的人获胜, 第一次总是Xiao Tang取. 当然,他们俩都足够聪明,总会采取最优的策略。Input每行会有一个正整数N(N<=100000), 代表石子的个数, N=0 代表输入结束Output输出获胜人的名字。Sample Input120Sample Output 阅读全文
posted @ 2012-04-17 20:04 漂木 阅读(184) 评论(0) 推荐(0) 编辑
摘要: 2535: Train TicketResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K394136Standard每次出外比赛,火车票的问题就出现了。太多的火车路线使acm的教练Coach Li很迷惘,当然,他总是努力使得总起来的火车票价最少。你能帮助他一下吗?输入给出n和m,表示有n个城市。之后的m次查询。之后会跟随(n*n)的数字矩阵,a[i][j] 表示i车站到j车站需要a[i][j]的钱。注意a[i][j]与a[j][i]无必然联系。然后是m对整数。如果一对整数i,j。表示求城市i到城市j的最小花费n<=100; 阅读全文
posted @ 2012-04-17 19:32 漂木 阅读(251) 评论(0) 推荐(0) 编辑
摘要: 1474: Soundex IndexingResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K246119StandardThe Soundex Index System was developed so that similar sounding names, or names with similar spelling could be encoded for easy retrieval. It has been used by the U.S. Bureau of the Census, and some States u 阅读全文
posted @ 2012-04-17 17:11 漂木 阅读(366) 评论(0) 推荐(0) 编辑