Card Selection Combinatorics

Problem Statement

Card Selection Combinatorics Problem Description You possess a deck consisting of 10 different card categories. Each category features a distinct digit ranging from 0 through 9. For every digit, you have exactly K identical cards available. Your complete deck contains 10×K cards in total. Your task is to pick exactly N cards from this 10×K card collection and calculate how many distinct combinations of N cards are achievable. Each combination must comprise precisely N cards. Two combinations are deemed identical if they contain the same cards, regardless of the sequence in which the cards appear. Note: Given that the result may be extremely large, output the answer modulo (10 9 +7). Implement the solve function. This function accepts the following 2 parameters and outputs the total number of ways: N: Denotes the quantity of cards that must be chosen K: Indicates the number of cards available for each digit type int solve (int N, int K) { // Write your code here } Input form