随笔分类 -  组合 --- 母函数

Hdu 1521 排列组合
摘要:a1 n1 a2 n2 ... ak nkn=n1+n2+...+nk从n个数中选r个排列(不是组合噢)// 指数型母函数// 模板#include #include #include#include #include #include #include #include using namespace std;#define LL __int64//long longstruct node{ LL u,d; // u/d node(){} node(LL a,LL b){ u=a; d=b; } LL gcd(LL a,... 阅读全文

posted @ 2014-03-17 12:47 江财小子 阅读(214) 评论(0) 推荐(0)

HDU 1709 The Balance
摘要:Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot be measured from the range [1,S]. S is the total quality of all the weights.InputThe input consists of multiple test cases, 阅读全文

posted @ 2012-04-02 16:55 江财小子 阅读(307) 评论(0) 推荐(0)

HDU 1171 Big Event in HDU
摘要:Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All fa 阅读全文

posted @ 2012-04-02 14:42 江财小子 阅读(154) 评论(0) 推荐(0)

Hdu 1398 Square Coins
摘要:People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland. There are four co 阅读全文

posted @ 2012-04-02 13:17 江财小子 阅读(179) 评论(0) 推荐(0)

HDU 1085 Holding Bin-Laden Captive!
摘要:We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China! “Oh, God! How terrible! ”Don’t be so afraid, guys. Although he hides in a cave of Hang Zhou, he dares not to go out. Laden is so bored recent 阅读全文

posted @ 2012-04-02 13:06 江财小子 阅读(132) 评论(0) 推荐(0)

HDU 1028 Ignatius and the Princess III
摘要:"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second 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,1#include using namespace std;int a[123],b[123];int mai 阅读全文

posted @ 2012-04-02 12:31 江财小子 阅读(173) 评论(0) 推荐(0)