Teilwall

摘要： //只用一行核心代码就可以过的天坑题目............= =题目：DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of results from number theory and other branches of mathematics once 阅读全文

摘要： 题目：DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.All what they remember is that MS Inc. posted a surplus or a deficit each month of 1999 and each month when MS Inc. posted surplus, the amount of surp 阅读全文

摘要： 题目："The problem is, given an positive integer N, we define an equation like this:N=a[1]+a[2]+a[3]+...+a[m];a[i]>0,1m时，f(n,m)=f(n,m-1)+f(n-m,m)。//难点，也是整个递归法的重点 此时还可分为两种情况讨论：a.当划分中不包含m时：因不包含m，故剩下的划分数都比m要小，其中最大的为m-1,因此，这种情况下的划分个数为f(n,m-1)；b.当划分数包含m时：即{m,(a1,a2,a3，...,ai)},其中（a1,a2,a3,...,ai）的和为 阅读全文