HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Winner's Camp > problem:


02. 50376 - Sequences

Guest
• Discussion of problem (1)

Volume problems

• 51004 - Word Search Game
• 01. 50722 - Scientist's problem
• 02. 50376 - Sequences
• 03. 50673 - DNA Testing
• 04. 50649 - Puzzle
• 05. 50713 - Castle and the girls
• 06. 50714 - The knight
• 07. 50715 - Zero Sum
• 08. 50370 - Number of rectangles in ...
• 09. 50716 - All Palindromes
• 10. 50475 - Voice advertising

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