Basic knowledge of C + + (v) Fibonacci sequence, jumping step problem

#include <iostream>using namespacestd;intJumpfloor (intNumber ) {    //Recursive//if (number<0) return 0; //if (number==0) return 1; //if (number==1) return 1; //Else return (Jumpfloor (number-1) + Jumpfloor (number-2)); //Follow the bad    intway=1; intpre_way=1; if(number<0) way=0; if(number==0) way=1; if(number==1) way=1;  while(number>=2){        inttemp=The ; the+=Pre_way; Pre_way=temp; number--; }    returna ;intFibonacci (intN) {//Recursive//if (n==0 | | n==1) return 1; //Else return (Fibonacci (n-1) + Fibonacci (n-2)); //Follow the bad    intresult=1; intpre_result=0; if(n==0) {result=0;} if(n==1) {result=1;}  while(n>1){        inttemp=result; Result+=Pre_result; Pre_result=temp; N--; }    returnresult;}intMain () {cout<< Jumpfloor (3) <<Endl; cout<< Fibonacci (5) <<Endl; return 0;}

Basic knowledge of C + + (v) Fibonacci sequence, jumping step problem