嘻嘻哈哈

Little Chief loves math. Most of all, he loves equations. He can solve any equation in the whole world. Recently he found one interesting and easy equation x1d+x2d+x3d ≡ m (mod N) Where x1, x2 and x

题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=4651 题目大意就是整数拆分 数据特别大，不能用以前的递归 所以。。。  不能百度  只能谷歌 http://en.wikipedia.org/wiki/Partition_%28number_theory%29 然后在里面找一个公式 Leonhard Euler's pe

http://acm.hdu.edu.cn/showproblem.php?pid=4704 求解(a^b)%c #include #include #include #include #define LL long long #define nnum 1000005 #define nmax 31625 int flag[nmax], prime[nmax]; int plen; void