Fiber nacci sequence (iteration)

/** Copyright and version declaration section of the Program * Copyright (c) 2012, student * All rightsreserved from computer College of Yantai University. * file name: maid. cpp * Prepared by: Liu Mingliang * completed on: July 15, November 19, 2012 * version: v1.0 * input Description: none * Problem description: output of 20th Number of fiber nacci sequences, such as 0, 1, 2, 3, 5, 8... * program output: the number of 20th entries in the finacci sequence * problem analysis: the iterative method ...... */# Include <iostream> using namespace std; int fib (int n); int main () {cout <fib (20) <endl; return 0 ;} int fib (int n) {int I, num1 = 0, num2 = 1, num; for (I = 3; I <= n; I ++) {num = num2; num2 = num1 + num2; num1 = num;} return num2 ;}