[Login|Register]
Problems

Status

Rank

Problem 1223
More than Fibonacci
Time Limit: 1000ms
Memory Limit: 65536kb
Description
The New Fibonacci numbers (0, 1, 2, 3, 6, 11, 20, 37, 68, ...) are defined by the recurrence:
           F(0) = 0; F(1) = 1; F(2) = 2; 
           F(n) = F(n-1) + F(n-2) + F(n-3)   for all n>2
Write a program to calculate the New Fibonacci numbers.
Input
The input is a sequence of integers not more than 36, each on a separate line, specifying which New Fibonacci number to calculate.
Output
Print the New Fibonacci numbers in the format shown in Sample Output.
Sample Input
5
7
11
Sample Output
The New Fibonacci number for 5 is 11
The New Fibonacci number for 7 is 37
The New Fibonacci number for 11 is 423
University of Science and Technology of China
Online Judge for ACM/ICPC
Processed in 2.4ms with 1 query(s).