2013年9月21日

Rightmost Digit

摘要： Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25969Accepted Submission(s): 9982Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文

posted @ 2013-09-21 23:09 ~Love() 阅读(222) 评论(0) 推荐(0)

Text Reverse

摘要： Text ReverseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13524Accepted Submission(s): 5161Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words 阅读全文

posted @ 2013-09-21 22:19 ~Love() 阅读(299) 评论(0) 推荐(0)

A. Difference Row

摘要： A. Difference Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou want to arrangenintegersa1, a2, ..., anin some order in a row. Let's define the value of an arrangement as the sum of differences between all pairs of adjacent integers.More 阅读全文

posted @ 2013-09-21 14:20 ~Love() 阅读(210) 评论(0) 推荐(0)

B. Fixed Points

摘要： B. Fixed Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of lengthnis an integer sequence such that each integer from 0 to(n - 1)appears exactly once in it. For example, sequence[0, 2, 1]is a permutation of length 3 while both 阅读全文

posted @ 2013-09-21 13:53 ~Love() 阅读(245) 评论(0) 推荐(0)

导航