Special Number
Submissions: 81   Accuracy:

46.92%

  Difficulty: Easy   Marks: 2

Given the number of digits and a base, give the count of all the special numbers present in the range from zero to maximum for that combination of number of digits and base.
Special number is defined as a number whose sum of digits in left half is equal to the sum of digits in its right half. For example, for base 10 and number of digits 4, total possible numbers will be 0000 to 9999, and in this range, 0642 is one special number as 0 + 6 = 4 + 2.
Assumption:There are no test cases with odd number of digits.

Input: First line contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an integer N, denoting the number of digits in the number. Second line of each test case contains an integer B, denoting the base.

Output: For each test case print in a new line the count of all special numbers.

Constraints:
1<=T<=70
1<=N<=6
1<=B<=10

Example:

Input:
2
4
2
2
10

Output:
6
10

** For More Input/Output Examples Use 'Expected Output' option **

Author: vaibhav2992


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.