12. 50723 - Tribonacci

Guest

Volume problems

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

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.

Tribonacci

Montenegro Informatics Olympiads 2013

Question:
Tribonacci sequence is obtained by the following formula:


    T_n = T_n-1 + T_n-2 + T_n-3

for a given N and three first elements of the sequence, the formula computes the N-th element of the Tribonacci. Write a program that gets four integers T₁, T₂, T₃ and N. Then the program computes N-th element of the sequence.

Input specification
The input has only one line consisting of 4 integers T₁, T₂, T₃ and N separated by a space where 1 ≤ N ≤ 20 and -20000 ≤ (T₁, T₂, T₃) ≤ 20000.

Output specification
Print the N-th element of the sequence.

Sample Input I `2 3 4 5`	Sample Input II `1 1 1 6`
Sample Output I `16`	Sample Output II `9`

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

Volumes > Winner's Camp > problem:

12. 50723 - Tribonacci

Volume problems

Feedback

Tribonacci