![]() |
||||||||||
|
||||||||||
A CTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7406 Accepted Submission(s): 4867 Problem Description Are you excited when you see the title "AC" ? If the answer is YES , AC it ; You must learn these two combination formulas in the school . If you have forgotten it , see the picture. ![]() Now I will give you n and m , and your task is to calculate the answer . Input In the first line , there is a integer T indicates the number of test cases. Then T cases follows in the T lines. Each case contains a character 'A' or 'C', two integers represent n and m. (1<=n,m<=10) Output For each case , if the character is 'A' , calculate A(m,n),and if the character is 'C' , calculate C(m,n). And print the answer in a single line. Sample Input
Sample Output
Author linle Source | ||||||||||
|