hdoj 1002 A + B Problem II 大数
A + B Problem II Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 302658????Accepted Submission(s): 58410 Problem Description I have a very simple problem for you. Given two integer
HDOJ 1023 Train Problem II(卡特兰数+大数乘除法)
Train Problem II Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7690????Accepted Submission(s): 4140 Problem Description As we all know the Train Problem I,the boss of the Ignatiu
HDOJ 1130 How Many Trees?(卡特兰数+大数乘除法)
How Many Trees? Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3380????Accepted Submission(s): 1958 Problem Description A binary search tree is a binary tree with root k such that
