Find the nth number in the Fibonacci sequence

Title Description Description

To find the nth number in Fibonacci sequence by recursive method

input/output format input/output Input Format:
A row, a positive integer n
output Format:A line, a number, that represents the nth number in the Fibonacci sequence. input and Output sample sample Input/output sample Test point # # Input Sample:15 Sample output: 610 idea: After discussion, the recursive formula of Fibonacci sequence: F (n-1) +f (n-2), and then direct recursion is obtained. The code is as follows (here is a long long type, too small to kneel ...) ):

1#include <stdio.h>2 Long LongFunLong LongN)3 {4     if(n==0)return 0;5     Else if(n==1)return 1;6     Else return(Fun (n1) +fun (n2));7 }8 intMain ()9 {Ten     Long LongN; Onescanf"%d",&n); Aprintf"%i64d\n", Fun (n));  -     return 0; -}

Find the nth number in the Fibonacci sequence