随笔分类 - 数学
摘要:Coin Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1020 Accepted Submission(s): 507 Problem Des
阅读全文
摘要:A Boring Question Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 487 Accepted Submission(s): 271
阅读全文
摘要:Acperience Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 484 Accepted Submission(s): 258 Acperi
阅读全文
摘要:Delta-wave Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7539 Accepted Submission(s): 2914 Prob
阅读全文
摘要:小兔的棋盘 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8690 Accepted Submission(s): 4548 Problem D
阅读全文
摘要:"红色病毒"问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5562 Accepted Submission(s): 2323 Proble
阅读全文
摘要:Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4267 Accepted Submission(s): 1974 Probl
阅读全文
摘要:Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15032Accepted Submission(s): 5813Pro...
阅读全文
摘要:Least Common MultipleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38998Accepted Submission(s): ...
阅读全文
摘要:Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31296Accepted Submission(s): 14539Proble...
阅读全文
摘要:Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59547Accepted Submission(s): 18621Pro...
阅读全文
摘要:ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52791Accepted Submission(s): 29174Problem ...
阅读全文
摘要:(1) n条直线最多分平面问题 题目大致如:n条直线,最多可以把平面分为多少个区域。 析:可能你以前就见过这题目,这充其量是一道初中的思考题。但一个类型的题目还是从简单的入手,才容易发现规律。当有n-1条直线时,平面最多被分成了f(n-1)个区域。则第n条直线要是切成的区域数最多,就必须...
阅读全文
摘要:有排成一行的n个方格,用红、粉、绿三色涂每个格子,每格涂一色,要求任何相邻的方格不能同色,且首尾两格也不同色.求全部的满足要求的涂法.f(n)=f(n-1)+2*f(n-2);错排思想:当n个编号元素放在n个编号位置,元素编号与位置编号各不对应的方法数用M(n)表示,那么M(n-1)就表示n-1个编...
阅读全文

浙公网安备 33010602011771号