摘要:Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13853 Accepted Submission(s): 5045
阅读全文
摘要:不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 30114 Accepted Submission(s): 10603 Problem
阅读全文
摘要:So Easy! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3459 Accepted Submission(s): 1113 Proble
阅读全文
摘要:在遇到一些递推式时,如果我们直接按公式一步步进行运算,效率较低。构造矩阵进行快速运算,可以高效地解决这个问题。 以int型方阵为例: 矩阵结构: struct Mat{ int mat[n][n]; }; 矩阵乘法: Mat mul(Mat A,Mat B) { Mat ret; memset(re
阅读全文
摘要:Digital Square Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1882 Accepted Submission(s): 741 P
阅读全文
摘要:Throw nails Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1729 Accepted Submission(s): 538 Prob
阅读全文