HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Recursion > problem:


50376 - Sequences

Guest
• Discussion of problem (1)

Section problems

• 50723 - Tribonacci
• 50370 - Number of rectangles in a ...
• 50475 - Voice advertising
• 50909 - Gold Coins
• 50376 - Sequences
• 50725 - Fibonacci Series
• 50385 - The 3n + 1 problem
• 50911 - Symmetric Array
• 50381 - Sum of the numbers
• 50389 - Reverse an Array
• 50727 - Fibonacci Numbers
• 50415 - The Scientist
• 50421 - Repairing road segments

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Ilir Capuni. Difficulty Beta

Finding the n-th element of a sequence

Question:
A sequence of integers is defined using the following equations
  A2n = An
  A2n+1 = An + An+1
Find the nth element of the sequence without the need to generate all previous elements.

Input specification
You will be given two positive integers n and A1 where 1 ≤ n ≤ 10000 and 1 ≤ A1 ≤ 1000.

Output specification
Show just one integer number:the nth element of the sequence.

Sample Input I   
  11 1
Sample Input II   
  9 3
Sample Output I   
  5
Sample Output II   
  12



Для отправки решений необходимо выполнить вход.

www.contester.ru