1-5-13: The Fibonacci series

Source: Internet
Author: User

Describe

The Fibonacci sequence refers to the series: the first and second numbers of the series are 1, followed by each number equal to the sum of the preceding 2 numbers.
Give a positive integer k, which asks what is the number of K in the Philippine-Fibonacci sequence.

Enter an input line containing a positive integer k. (1 <= k <= 46) Output output line containing a positive integer representing the size of the number of K in the Fibonacci sequence

Sample input

19

Sample output

4181

SOURCE 1755

#include <stdio.h>intMain () {intk,i,a1=1, a2=1, a=1; scanf ("%d",&k);  for(i=1; i<=k-2; i++) {a=a1+A2; A1=A2; A2=A; } printf ("%d", a); return 0;}

1-5-13: Fibonacci series

Related Article

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.