ACM
文章平均质量分 82
hentaidesu
keep coding
展开
-
UVA227-Puzzle
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163DescriptionA children's puzzle that was popular 30 years ago consisted of a 5x5 frame w原创 2015-07-26 13:08:25 · 1839 阅读 · 0 评论 -
Uva514-Rails(基本栈)
There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to e原创 2015-11-30 19:55:17 · 3463 阅读 · 0 评论 -
Uva11300 - Spreading the Wealth
题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2275题目大意:n个人围成一个圆,每个人有一定的金币数量,然后每个人与左右两边的人交换硬币,这里注意,每个人只能和左右两边的人交换硬币,然后经过一些交换,最终使得每个人的金币数量相同。原创 2015-11-19 21:36:40 · 706 阅读 · 0 评论 -
Uva11292 The Dragon of Loowater
Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the原创 2015-11-18 20:43:59 · 297 阅读 · 0 评论 -
HDU1877-又一版 A+B
Problem Description输入两个不超过整型定义的非负10进制整数A和B(31-1),输出A+B的m (1 Input输入格式:测试输入包含若干测试用例。每个测试用例占一行,给出m和A,B的值。当m为0时输入结束。 Output输出格式:每个测试用例的输出占一行,输出A+B的m进制数。 Sample Input8 1300 482原创 2015-11-22 16:33:36 · 286 阅读 · 0 评论 -
HDU 1008-Elevator
Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified原创 2015-11-22 16:31:16 · 256 阅读 · 0 评论 -
HDU1032&Uva100 The 3n + 1 problem
Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property o原创 2015-11-22 16:44:03 · 319 阅读 · 0 评论 -
HDU1219-AC Me
Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.It's really easy, isn't it? So come on and AC M原创 2015-11-22 16:41:54 · 253 阅读 · 0 评论 -
HDU1029-Ignatius and the Princess IV
Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. There will be a special integer amo原创 2015-11-22 16:36:25 · 338 阅读 · 0 评论 -
HDU1210 Eddy's 洗牌问题
Problem DescriptionEddy是个ACMer,他不仅喜欢做ACM题,而且对于纸牌也有一定的研究,他在无聊时研究发现,如果他有2N张牌,编号为1,2,3..n,n+1,..2n。这也是最初的牌的顺序。通过一次洗牌可以把牌的序列变为n+1,1,n+2,2,n+3,3,n+4,4..2n,n。那么可以证明,对于任意自然数N,都可以在经过M次洗牌后第一次重新得到初始的顺序。编程对于小于原创 2015-10-30 21:44:33 · 551 阅读 · 0 评论 -
HDU 1113-Word Amalgamation
Problem DescriptionIn millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear i原创 2015-08-01 20:57:17 · 543 阅读 · 0 评论 -
HDU 1412-{A} + {B}
Problem Description给你两个集合,要求{A} + {B}.注:同一个集合中不会有两个相同的元素. Input每组输入数据分为三行,第一行有两个数字n,m(0<n,m<=10000),分别表示集合A和集合B的元素个数.后两行分别表示集合A和集合B.每个元素为不超出int范围的整数,每个元素之间有一个空格隔开.Output针对每组数据输出一行数据,表示合并原创 2015-08-01 21:07:09 · 745 阅读 · 0 评论 -
HDU 2017-字符串统计
Problem Description对于给定的一个字符串,统计其中数字字符出现的次数。 Input输入数据有多行,第一行是一个整数n,表示测试实例的个数,后面跟着n行,每行包括一个由字母和数字组成的字符串。 Output对于每个测试实例,输出该串中数值的个数,每个输出占一行。 Sample Input2asdfasdf123123asdfasdfasdf111原创 2015-08-01 21:14:46 · 287 阅读 · 0 评论 -
UVA133-The Dole Queue
DescriptionIn a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applicants will be p原创 2015-07-28 22:58:48 · 186 阅读 · 0 评论 -
UVA1339-Ancient Cipher
DescriptionAncient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in原创 2015-07-28 23:04:25 · 328 阅读 · 0 评论 -
UVA489-Hangman Judge
DescriptionIn ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as原创 2015-07-28 23:02:17 · 273 阅读 · 0 评论 -
UVA10340-All in all
DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we wil原创 2015-07-26 13:10:37 · 246 阅读 · 0 评论 -
Uva 442-Matrix Chain Multiplication (基本栈)
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. H原创 2015-12-01 18:17:56 · 397 阅读 · 0 评论