码迷,mamicode.com
首页 > 其他好文 > 详细

Fibonacci

时间:2014-08-26 03:12:26      阅读:204      评论:0      收藏:0      [点我收藏+]

标签:fibonacii

#include<iostream>

using namespace std;

int main()
{
    int pound,p0,p1,days,result;
    char ans;
    
    do
    {
        cout<<"Please input the pound and the days:\n";
        cin>>pound>>days;
        
        int n = days/5;
        if(0 == n || 1 == n)
            {
                result = pound;
                cout<<"The result is "<<result<<endl;
            }
        else
            {
                result = 0;
                p0 = p1 = pound;
                for(int i = 1;i < n;i++)
                    {
                        result = p0 + p1;
                        p0 = p1;
                        p1 = result;
                    }
            cout<<"The result is "<<result<<endl;
            }
            
        cout<<"Do you want again?";
        cin>>ans;
    }while(‘y‘ == ans || ‘Y‘ == ans);
    
    
}

斐波那契计算绿锈。

Fibonacci

标签:fibonacii

原文地址:http://9320314.blog.51cto.com/9310314/1544843

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!