Wrong test case in tiling problem

#1

sir what can be the possible test cases for this problem
here is my code:
#include
using namespace std;
int ways(int n ,int m){
int count[n+1];
count[0]=0;
for(int i=1;i<=n;i++){
if(i>m){
count[i] = count[i-1] + count[i-4];
}
else if(i<m){
count[i]= 1;
}
else if(i=1){
return 0;

	}
	else{
     count[i]=2;
         }
}
return count[n];

}
int main(){
int n,m;
cin>>n>>m;
cout<<"no. of ways = "<<ways(n,m);
return 0;
}

#2

hi @pal_singh_sonu
there were many small mistakes in your code.
you didn’t account for MOD(1000000007 ) in your code
your code didn’t work for multiple test cases because you didn’t account for multiple cases


i have added comments. now it works fine