优化的fibonacci函数

/*
    Optimize algorithm of Fibonacci
    Author: Arthur Bryant
    Date: 2010-03-06

*/
#include <iostream>

using namespace std;

/*
   fibonacc function
   num is the sequence of fibonacci number
 */
int f(int num)
{
 int i = 2;
 int m = 1, n = 1;
 int result;

 if(num == 0 || num == 1)
  return 1;
 else if(num > 1)
 {
  /*add from f(0)+f(1) to f(num)*/
  while(i <= num)
  {
   result = m + n;
   n = m;
   m = result;
   ++i;
  }
  return result;
 }
 else
  return -1;
  
}
int main()
{
 int a;
 while(1)
 {
  cin >> a;
  cout << f(a) << endl;
 }

 return 0;
}