# Review the problem solved by me releated to java, dynamic programming

Arya Stark and Sansa Stark are sisters but often fight with each other for one or the other reason. Recently, Sansa beat Arya by cheating in the hunt game and made fun of her. Arya is full of anger and wants to take her revenge. Arya has called her elder sister Sansa for battle and Sansa has accepted it.

The battle consists of R rounds where in each round a different skill will be put to test. The skill may be Archery, Sword fighting or anything else. After each round, the winner of the round will be awarded a point. After all the R rounds are conducted, the one with maximum points is considered as the overall Winner.

Arya is angry and wants not just to win the battle but beat Sansa in such a way that after each round her points are atleast P times the points of Sansa. She is busy preparing for the battle and has heard about your skills. She wants you to find the number of ways in which she can beat Sansa with the provided condition and take her revenge.
The order of winning differentiates the different ways.

Example: Let’s consider, there are 3 rounds.

Case 1: Arya won the first round, Sansa the second round and Arya the third round
Arya , Sansa , Arya

Case 2: Arya won the first round, Arya also won the second round and Sansa won the third round
Arya , Arya , Sansa

Both the cases above are different from each other and are considered two different ways.
Note: Since the answer can be large, take modulo by 10^9 + 7.
Input Format
The first line of input consists of number of test cases, T
The only line of each test case consists of two space separated integers R and P.

Constraints
1<= T <=10
1<= R <=1000
1<= P <=R

Output Format
For each test case, print the number of ways possible in a separate line.

Sample TestCase 1
Input
2
4 2
2 2
Output
3
1

Explanation
Test Case 1:

There are three ways in which Arya can win with the given condition

WAY 1: First three rounds are won by Arya and Last round is won by Sansa

Arya , Arya , Arya , Sansa

WAY 2: First two rounds are won by Arya. Third Round is won by Sansa and last Round is won by Arya.

Arya , Arya , Sansa , Arya

WAY 3: All the four rounds are won by Arya.

Arya , Arya , Arya , Arya

Test Case 2: There is only one way of winning in this case i.e if Arya wins both the rounds.

Arya , Arya

can someone please review this solution of code, it is failing 4/10 test cases
the code is:
/*

• Your class should be named CandidateCode.
*/

import java.io.;
import java.util.
;
public class CandidateCode {
public static void main(String[] args) {
int testCases=0;
Scanner scan = new Scanner(System.in);
testCases=scan.nextInt();

``````while(testCases-->0) {
int rounds = scan.nextInt();
long[][] dpArray = new long[rounds+1][rounds+1];
int ptimes=scan.nextInt();
for(int i=0;i<=rounds;i++) {
for(int j=0;j<=rounds;j++) {
dpArray[i][j]=-1;
}
}
System.out.println(winsPossibilitiesCounterForArya(ptimes,rounds,dpArray ));
}
scan.close();
``````

}
public static long winsPossibilitiesCounterForArya(int p, int r,long[][]dpArray) {
dpArray[p][0]=war(p, 0, 0, p, r,dpArray) ;
long res= dpArray[p][0];
res%=1000000007;
return res ;
}
public static long war(int aryaStarkWins, int sansaStarkWins, long chances, final int p, final int r,long[][]dpArray) {

``````if(dpArray[aryaStarkWins][sansaStarkWins]!=-1) {
return dpArray[aryaStarkWins][sansaStarkWins];
}
if (aryaStarkWins < sansaStarkWins * p) {
return 0;
}

if (aryaStarkWins + sansaStarkWins == r) {
return 1;
}
dpArray[aryaStarkWins][sansaStarkWins]=(war(aryaStarkWins + 1, sansaStarkWins, chances, p, r,dpArray)%1000000007 + war(aryaStarkWins, sansaStarkWins + 1, chances, p, r,dpArray)%1000000007)%1000000007;

return dpArray[aryaStarkWins][sansaStarkWins];
``````

}
}

``````#define mxn 1003
#define mod 1000000007
int p,r;
int dp[mxn][mxn];

int f(int match,int arya) {
int sansa = match - arya;

if(arya < p * sansa) return 0;

if(match == r) return 1;

if(dp[match][arya] != -1)
return dp[match][arya];

int ans = f(match+1,arya + 1) + f(match+1,arya);
ans %= mod;

return dp[match][arya] = ans;
}

int main()
{
int t;
cin >> t;
while(t--) {
cin >> r >> p;
memset(dp,-1,sizeof dp);
cout << f(0,0) << endl;
}
return 0;
}
``````

Here’s the solution but it is still not working for 4 hidden test cases. I guess type conversion might do the work