"Garlic Guest Series" Challenge 4: Simple Fibonacci _ Count Garlic

Source: Internet
Author: User

Source of the topic: garlic


The Fibonacci sequence is a very interesting sequence, starting with 0 and 1, after which the Fibonacci coefficients are added by the previous two numbers. Ponachi The definition of Fibonacci sequence by mathematical formula can be regarded as the following form: f0=0
F1=1
Fn=fn-1+fn-2
We agreed that FN would represent the nth item in the Fibonacci sequence, and you know any of the Fibonacci sequences.
The input includes one row, including a number N (0≤N≤50).
The output includes a row, including a number, which is the value of the nth item in the Fibonacci sequence.
Sample 1
Input:
7
Output:

13


#include <stdio.h>
int Fibonacci (int n)
{
	if (n==0) return
		0;
	else if (n==1) return
		1;
	else return
		Fibonacci (n-1) +fibonacci (n-2);
}
int main ()
{
	int n,r;
	scanf ("%d", &n);
	r = Fibonacci (n);
	printf ("%d", r);
}


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.