|
||||||||||
BellTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1010 Accepted Submission(s): 460 Problem Description What? MMM is learning Combinatorics!? Looks like she is playing with the bell sequence now: bell[n] = number of ways to partition of the set {1, 2, 3, ..., n} e.g. n = 3: {1, 2, 3} {1} {2 3} {1, 2} {3} {1, 3} {2} {1} {2} {3} so, bell[3] = 5 MMM wonders how to compute the bell sequence efficiently. Input T -- number of cases for each case: ĦĦĦĦn (1 <= n < 2^31) Output for each case: ĦĦĦĦbell[n] % 95041567 Sample Input
Sample Output
Source | ||||||||||
|