Paint Disk 那道题非常简单。
给 m 种color, N个sectors，有多少种paint的方法

paint 第一个sector有 m 种可能性，paint 第二个sector有 m-1 种可能性，一直到 第 n 个sector. 这时会有重复的可能，即第一个和最后一个sector是同一种颜色，把这些情况减去即可。

第一个和最后一个sector重复的情况有多少种呢？如果把第一个sector和最后一个sector看成是一个sector，那么每种重复的情况，恰好是 m 种color, N-1 个 sector的情况。所以recursion 就是

PD(m, n) = m*(m-1)^(n-1) - PD(m, n-1)

基本情况有若干种，请自己去分析好了，不再多说。

最后一道题目非常难，题目的意思是，24=2*12=3*8=4*6=2*2*6=...
{2, 12}是24的一个set，{3,8}也是24的一个set，{2,12}和{12, 2}算同一个set，{24}也是{24}的一个set。24有7个这样的set。要你算出若干数的set的个数，并且把最大的那个数以及它的set数找出来。
这道题很难。必须用Dynamic Programming才能做出来并且不超时。我用recursion做出来，3个accept，7个超时。想想给的数可能是1000,000，如果recursion做，它的用时该多少啊？
就算用Dynamic Programming 也很难想出algorithm。请参考以下一段code

int results[] = new int [max+1];
results[1] = 1;
for (int i=2; i<=max; i++) {
for (int j=1; j<=max/i; j++) {
results[i*j] += results[j];
}
//建议这里加一段code把results print出来看看比较直观
}

你怎么可以这样？
让他们来这里看好了，可别以labTA的身份发给他们啊，不然别的组的人会complain的啊。

浆糊上又将掀起一番腥风血雨的争斗……

"最后一道题目非常难，题目的意思是，24=2*12=3*8=4*6=2*2*6=...
{2, 12}是24的一个set，{3,8}也是24的一个set，{2,12}和{12, 2}算同一个set，{24}也是{24}的一个set。24有7个这样的set。要你算出若干数的set的个数，并且把最大的那个数以及它的set数找出来。"

really?

Here is a possible way:

Firstly, use recursion to get the factoriazation of the number, say 24 = 2^3*3
N=p1^e1*p2^e2*p3^e3...*(pn^en)
p1^e1 means p1 tp the power of e1.

Then, use this formula:
number of different set=(e1+1)*(e2+1)*...(en+1)-1, here minus 1 is to remove {1, N} and {N, 1} duplication.

So surprise, a TA says such question is "very difficult". Do you think you are disappointing the students?

Shamed, shamed, shamed......

:D Kidding.

I use only 30 sec to think about this question. If anything wrong, i won't take any responsibility. Haha!

it seems i misunderstood the question, the formula is corrent if only 2 elements in a set is required.

是一团乱七八糟的浆糊。。。。

Even if to compute all set with only two elements, your algorithm is not able to get it.
24 = 2^3*3, by your formula, the number of sets are 4*2-1 = 7. In fact, it is {24}, {2, 12}, {3, 8}, {4, 6}, which is only 4.
:)

I am not going to pointing your mistake here. Anyway, read the question carefully.

I do not think this question is able to be solved by permutation and combination formula. Indeed, it is hard to solve it. In programming, we also consider complexity of an algorithm. Another bottleneck to this problem is that there may be about 1000,000 number to compute. Then how?
Think about it...

Don't teach me like you are my TA. You are a TA, so am I. 没什么了不起，受不了你说话的态度，我闪了。

duck and climbing 都是吧？好厉害呀？

你们是不是都拿的A+才可以当的？CAP有没有要求？两位高人想必都是过4.9的吧？崇拜ing~~

我的code虽然通过了online jugdge,但我是直接针对online judge来设计的。但是不够efficient. 请老兄提示一下。多谢！^_^

等这个lab结束以后。我可以考虑把我的program贴出来。:D