查找
滑头鬼之亨
Frankiller
展开
-
uva 113 - Power of Cryptography
Power of Cryptography Background Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Wor原创 2012-06-14 14:26:29 · 1206 阅读 · 0 评论 -
uva 10125 - Sumsets
Problem C - Sumsets Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S. Input Several S, each consisting of a line containing an原创 2012-08-06 15:03:11 · 1449 阅读 · 0 评论 -
uva 10282 - Babelfish
Problem C: Babelfish You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understan原创 2012-08-06 16:09:55 · 869 阅读 · 0 评论 -
uva 10391 - Compound Words
Problem E: Compound Words You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the concatenation of exactly two other words in原创 2012-08-06 20:00:30 · 1342 阅读 · 0 评论 -
uva 10341 - Solve It
Problem F Solve It Input: standard input Output: standard output Time Limit: 1 second Memory Limit: 32 MB Solve the equation: p*e-x + q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0原创 2012-08-22 17:17:33 · 1071 阅读 · 0 评论 -
uva 10487 - Closest Sums
Problem D Closest Sums Input: standard input Output: standard output Time Limit: 3 seconds Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find原创 2012-09-06 19:31:57 · 2061 阅读 · 0 评论 -
uva 714 - Copying Books
Copying Books Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so called scribers. The scriber had been gi原创 2012-10-08 20:51:42 · 2905 阅读 · 0 评论