搞么子小子

汉诺塔II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4881    Accepted Submission(s): 2390 Problem Description 经典的汉诺塔问题经常作为一个递归的经典例

三角形 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4766    Accepted Submission(s): 3251 Problem Description 用N个三角形最多可以把平面分成几个区域?

Tri Tiling Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2112    Accepted Submission(s): 1206 Problem Description In how many ways ca

下沙的沙子有几粒？ Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2718    Accepted Submission(s): 1425 Problem Description 2005年11月份，我们学校参加了ACM

折线分割平面 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16414    Accepted Submission(s): 11310 Problem Description 我们看到过很多直线分割平面的题

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 48348    Accepted Submission(s): 15029 Problem Description The digita

Tiling Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7454   Accepted: 3640 Description In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? 

献给杭电五十周年校庆的礼物 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7236    Accepted Submission(s): 3936 Problem Description 或许你曾经牢骚满腹 或

#includeint dp[2002][2002];int c[2002];int main (){   int i,j,n,b;   for(i=1;i2000;i++)     dp[i][i]=dp[i][1]=1;   for(i=2;i2000;i++)       for(j=2;j2000;j++)           dp[i][j]=(dp[i-1][j-1]+dp[i-1

Children’s Queue Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10540    Accepted Submission(s): 3390 Problem Description There ar