练习6
// Fibonaqii.cpp : Defines the entry point for the console application.
/*
data:2013/10/05
auth:ljz
func:
斐波那契数列的非递归实现
*/
#include "stdafx.h"
#include "iostream"
using namespace std;
int Fibonaqii(int n)
{
int a=1,b=1,c;
if (n == 1 || n ==2)
{
return 1;
}
else
{
for (int i =3;i<=n;i++)
{
c = a+b;
a = b;
b = c;
}
return c;
}
}
int main(int argc, char* argv[])
{
int n;
printf("输入n!
");
cin>>n;
cout<<Fibonaqii(n)<<endl;
return 0;
}