|
||||||||||
RankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1324 Accepted Submission(s): 709 Problem Description Recently in Teddy's hometown there is a competition named "Cow Year Blow Cow".N competitors had took part in this competition.The competition was so intense that the rank was changing and changing. Now the question is: How many different ways that n competitors can rank in a competition, allowing for the possibility of ties. as the answer will be very large,you can just output the answer MOD 20090126. Here are the ways when N = 2: P1 < P2 P2 < P1 P1 = P2 Input The first line will contain a T,then T cases followed. each case only contain one integer N (N <= 100),indicating the number of people. Output One integer pey line represent the answer MOD 20090126. Sample Input
Sample Output
Author teddy Source | ||||||||||
|