count number of stairs to reach nth.txt

#include<bits/stdio.h>
using namespace std;
int fib(int n)
{
	if(n<=1)
	return n;
	rreturn fib(n-1) + fib(n-2);
}

//return number of ways to reach s'th stair

itn countWays(int s)
{
return fib(s+1);
}

//driver

int main()
{
int s=4;
cout<<"number of ways = "<<countWays(s);
return 0;
}