Monday, October 18, 2010

11000 - Bee - UVA

Fibonacci numbers

If you write the sequence resulted from the description, you'll see that you have to find sum of the first n Fibonacci numbers + sum of the first (n-1) Fibonacci numbers.
Sum Fib( i ) = Fib(n+2)-1
----- i = 0...n

Use long long int and you just need to calculate the first 46 sentences of the Fibonacci numbers.
For more information about Fibonacci numbers read this :
http://en.wikipedia.org/wiki/Fibonacci_number
at
Labels:

1 comment:

  1. Amirhossein RajabiDecember 8, 2011 at 11:53 AM

    Tnx, your weblog was frouth item when i searched "11000 bee".

    ReplyDelete

Subscribe to: Post Comments (Atom)

USACO - Prime Palindromes

I just skimmed the problem statement and panicked of the high boundary of the input, but something inside told me don't worry everyth...

  • 11388 - GCD LCM - UVA
    Mathematics As you can see in the problem description, you have to find numbers a & b such that (a, b) = G and [a, b] = L and also it ...
  • USACO - Prime Cryptarithm
    Prime Cryptarithm The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set ...
  • USACO - Arithmetic Progressions
    Let's think about it, Have you noticed the small boundary of N & M, What can we do with this small boundary? Isn't producing al...