posted @ 2019-03-21 20:24
烈焰蔷薇
阅读(717)
评论(0)
推荐(0)
摘要：
Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). Input Input consists of a sequenc 阅读全文
posted @ 2019-03-20 19:06
烈焰蔷薇
阅读(186)
评论(0)
推荐(0)
摘要：
Problem Description Given a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k same char 阅读全文
posted @ 2019-03-18 20:43
烈焰蔷薇
阅读(293)
评论(0)
推荐(0)
摘要：
导数的几何解释： 定义： F在x0的导数是y=f(x)在P(x0,y0)处的斜率，记为f’(x)。 切线其实是一种极限，是Q趋近于P时，割线PQ的极限。 斜率： 斜率${\rm{m}} = \mathop {\lim }\limits_{\Delta {\rm{x}} \to 0} \frac{{\ 阅读全文
posted @ 2019-03-17 13:04
烈焰蔷薇
阅读(676)
评论(0)
推荐(0)
摘要：
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbe 阅读全文
posted @ 2019-03-16 13:02
烈焰蔷薇
阅读(214)
评论(0)
推荐(0)
摘要：
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit the 阅读全文
posted @ 2019-03-15 20:52
烈焰蔷薇
阅读(189)
评论(0)
推荐(0)
摘要：
Problem Description A simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations o 阅读全文
posted @ 2019-03-14 19:05
烈焰蔷薇
阅读(139)
评论(0)
推荐(0)
摘要：
Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean 阅读全文
posted @ 2019-03-13 19:41
烈焰蔷薇
阅读(250)
评论(0)
推荐(0)
摘要：
Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at w 阅读全文
posted @ 2019-03-13 19:31
烈焰蔷薇
阅读(186)
评论(0)
推荐(0)
摘要：
Problem Description A 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 阅读全文
posted @ 2019-03-12 23:06
烈焰蔷薇
阅读(151)
评论(0)
推荐(0)
摘要：
Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gues 阅读全文
posted @ 2019-03-11 19:25
烈焰蔷薇
阅读(158)
评论(0)
推荐(0)
摘要：
Problem Description Given 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 阅读全文
posted @ 2019-03-11 19:18
烈焰蔷薇
阅读(143)
评论(0)
推荐(0)
摘要：
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line 阅读全文
posted @ 2019-03-10 22:04
烈焰蔷薇
阅读(246)
评论(0)
推荐(0)
摘要：
Problem Description In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. Input The input will consist of a series of integers n, o 阅读全文
posted @ 2019-03-10 21:48
烈焰蔷薇
阅读(221)
评论(0)
推荐(0)
摘要：
Problem Description Calculate A + B. Input Each line will contain two integers A and B. Process to end of file. Output For each case, output A + B in 阅读全文
posted @ 2019-03-10 18:12
烈焰蔷薇
阅读(164)
评论(0)
推荐(0)
浙公网安备 33010602011771号