- 博客(9)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 组合数
描述找出从自然数1、2、... 、n（0<n<10）中任取r(0<r<=n)个数的所有组合。输入输入n、r。输出按特定顺序输出所有组合。特定顺序：每一个组合中的值从大到小排列，组合之间按逆字典序排列。样例输入5 3样例输出543542541532531521432431421321//这是关于dfs的，刚开始的是觉得
2015-04-27 20:47:07
548
原创 Encoding
Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same characters should be encoded to "kX" where "X" i
2015-04-24 20:46:00
1069
原创 Least Common Multiple
Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 1
2015-04-24 20:43:39
397
原创 Digital Roots
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin
2015-04-24 19:15:08
405
原创 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-04-24 11:23:30
622
原创 Quoit Design
Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the po
2015-04-24 10:52:03
542
原创 Number Sequence
Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n). I
2015-04-22 11:51:34
424
原创 Let the Balloon Rise
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest i
2015-04-22 11:21:29
557
原创 Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +
2015-04-22 10:54:59
468
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人