what is wrong in this code
/Given a brick wall of 4n and tiles of 41, find
the total number of ways of arranging the tiles on wall/
#include
using namespace std;
int ways(int n){
if(n==0)
return 0;
else if(n==1)
return 1;
else
return ways(n-4) + ways(n-1);
}
int main()
{
int n;
cin>>n;
int c = ways(n);
cout<<c;
return 0;
}
@ayu2321 hi,apke base case me dikkt hai ,some cases are lefy ,here are correct base cases:
if(n==1)
return 1;
if(n<m)
return 1;
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.