摘要:
There arencoins in a line. (Assumenis even). Two players take turns to take a coin from one of the ends of the line until there are no more coins left. The player with the larger amount of money wins.Solution:typedef pair i_pair;int path[100];//define pair here int max(int m, int n, int p, int q){ v 阅读全文
posted @ 2013-08-14 02:38
pgu2
阅读(262)
评论(0)
推荐(0)