数论
conquerheaven
这个作者很懒,什么都没留下…
展开
-
uva 763 - Fibinary Numbers(Fibonacci)
Fibinary Numbers The standard interpretation of the binary number 1010 is 8 + 2 = 10. An alternate way to view the sequence ``1010'' is to use Fibonacci numbers as bases instead of power原创 2014-03-18 14:57:39 · 647 阅读 · 0 评论 -
uva 11780 - Miles 2 Km(dp+Fibonacci)
Miles 2 Km It is a well known fact that you can use Fibonacci numbers to convert distances from miles 2 kilometers. Well, it's actually not a well known fact. It is, however, a well known原创 2014-03-18 16:36:19 · 747 阅读 · 0 评论 -
uva 10183 - How Many Fibs?(Fibonacci)
Problem B: How many Fibs? Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in原创 2014-03-18 15:25:33 · 484 阅读 · 0 评论 -
uva 11161 - Help My Brother (II)(Fibonacci)
H Next Generation Contest 3 Time Limit: 3 seconds Help My Brother (II) A Fibonacci sequence is calculated by adding the previous two members of the sequence, with原创 2014-03-19 22:04:12 · 614 阅读 · 0 评论 -
uva 10689 - Yet another Number Sequence(缓存,类Fibonacci)
Problem B Yet another Number Sequence Input: standard input Output: standard output Time Limit: 3 seconds Let's define another number sequence, given by the following function: f(0) = a f(1原创 2014-03-19 22:29:22 · 557 阅读 · 0 评论 -
uva 374 - Big Mod(整数快速幂)
Big Mod Calculate for large values of B, P, and M using an efficient algorithm. (That's right, this problem has a time dependency !!!.) Input Three integer values (in the order原创 2014-03-21 13:06:22 · 689 阅读 · 0 评论 -
uva 11582 - Colossal Fibonacci Numbers!(整数快速幂)
Problem F: Colossal Fibonacci Numbers! The i'th Fibonacci number f (i) is recursively defined in the following way: f (0) = 0 and f (1) = 1 f (i+2) = f (i+1) + f (i) for every i ≥ 0 Your tas原创 2014-03-20 18:27:07 · 696 阅读 · 0 评论 -
uva 10518 - How Many Calls?(Fibonacci+1)
Problem J How Many Calls? Input: standard input Output: standard output Time Limit: 5 seconds The fibonacci number is defined by the following recurrence: fib(0) = 0fib(1) = 1fib(n) = fib(n-1)原创 2014-03-20 23:58:55 · 610 阅读 · 0 评论 -
uva 11174 - Stand in a Line(求乘法逆元)
Problem J Stand in a Line Input: Standard Input Output: Standard Output All the people in the byteland want to stand in a line in such a way that no person stands closer to the front of the li原创 2014-03-23 20:40:28 · 647 阅读 · 0 评论