2012年01月_Rest

原创 1395. Rounders

Time Limit: 1sec Memory Limit:32MBDescriptionFor a given number, if greater than ten, round it to the nearest ten, then (if that result is greater than 100)take the result and round it to

2012-01-27 00:12:37 825

原创 1394. Root of the Problem

Time Limit: 1sec Memory Limit:32MBDescriptionGiven positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root

2012-01-26 23:29:35 834

原创 1390. Surprising Strings

Time Limit: 1sec Memory Limit:32MBDescriptionThe D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pa

2012-01-26 22:59:00 833

原创 1137. 河床

1137. 河床Total:4093Accepted:1225Rating:2.9/5.0(23 votes)012345 Time Limit: 10sec Memory Limit:32

2012-01-25 22:29:32 1120

原创 1443. Printer Queue

1443. Printer QueueDescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue

2012-01-18 09:25:33 1609

转载 sicily 题目分类【转】

【数据结构/图论】1310 Right-Heavy Tree 笛卡尔树相关，复杂度O(N)或O(NlogN)。1426 Phone List 电话号码前缀检索，trie树相关。1443 Printer Queue 基本队列操作。1149 等价表达式判断表达式是否等价（递归求解）1136 山海经 n长序列

2012-01-17 23:37:25 1260

3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271

2012-01-16 22:30:20 3165

原创 2000. Toy Shopping

2000. Toy ShoppingDescriptionBessie wants some toys. She's been saving her allowance for years, and has an incredibly huge stash. However, she is quite frugal and wants to get the best value

2012-01-16 16:46:19 728

原创 1793. Numbers

Time Limit: 1sec Memory Limit:32MBDescriptionGiven the greatest common divisor(GCD) and the least common multiple(LCM) of two integers a and b (a InputInput may consist of several t

2012-01-15 18:42:34 593

原创 1790. Single Round Match

1790. Single Round Match Total:1543Accepted:433Rating:2.2/5.0(13 votes)012345

2012-01-15 11:32:17 976

原创 1753. 解码

Time Limit: 1sec Memory Limit:32MBDescriptionZX是另一头04级的牛，他现在在UPen。他跟LLK经常通信，但他不喜欢直接把信息发给LLK，而是把信息通过一个规则转换后再发给LLK，这让LLK很郁闷。他的规则如下：如果字符x出现的n次，则将这几个连在一起的字符表示为xn，例如aaa->a3。为了能读取ZX的信息，亲爱的师弟师妹们，你

2012-01-15 10:57:17 1087

原创 1566. 4SUM

1566. 4SUMDescriptionIn this task, you are provided with four sets of integers. Your task consists of selecting one integer from each set, such that their sum is 0. You can assume that suc

2012-01-15 09:50:00 752

原创 1486. 统计数字

1486. 统计数字Description某次科研调查时得到了n个自然数，每个数均不超过1500000000（1.5*10^9）。已知不相同的数不超过10000个，现在需要统计这些自然数各自出现的次数，并按照自然数从小到大的顺序输出统计结果。Input 包含多个测试数据，每个包含n+1行：第1行是整数n，表示自然数的

2012-01-15 01:00:35 1839

原创 1298. 数制转换

1298. 数制转换Description有一种数制的基数是3，权值可以取-1,0,1，并分别用符号-,0,1表示，如这种数制的101表示十进制数的10，即1*(3^2)+0*(3^1)+1*(3^0)=10，又如这种数制的-0 表示十进制数的-3，即-1*(3^1)+0*(3^0)=-3。编程要求把给定的有符号整数转换为新数制的数，该数的前面不能有多余的0，如10的新数制表示是1

2012-01-15 00:07:50 1743

原创 1259. Sum of Consecutive Primes

1259. Sum of Consecutive PrimesDescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive i

2012-01-14 18:30:59 2237

原创 1209. Sequence Sum Possibi

1209. Sequence Sum PossibiDescriptionMost positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,6 = 1 + 2 + 3 9 = 5 + 4 =

2012-01-06 18:14:54 919

原创 1035. DNA matching

1035. DNA matchingDescriptionDNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium for genetic information. It is comprised of subunits called nucleotides that

2012-01-06 13:24:08 1221

[Q]4EchoNStef