https://blog.youkuaiyun.com/bestcoder_judgezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/bestcoder_judge/article/details/49134929https://blog.youkuaiyun.com/bestcoder_judge/article/details/49134929bestcoder_judgeThu, 15 Oct 2015 00:15:57 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47833479https://blog.youkuaiyun.com/bestcoder_judge/article/details/47833479bestcoder_judgeFri, 21 Aug 2015 13:55:33 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47724585https://blog.youkuaiyun.com/bestcoder_judge/article/details/47724585bestcoder_judgeMon, 17 Aug 2015 14:21:52 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47450865https://blog.youkuaiyun.com/bestcoder_judge/article/details/47450865bestcoder_judgeWed, 12 Aug 2015 20:43:13 +0800 #include #include]]>https://blog.youkuaiyun.com/bestcoder_judge/article/details/47425577https://blog.youkuaiyun.com/bestcoder_judge/article/details/47425577bestcoder_judgeTue, 11 Aug 2015 19:40:50 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47404821https://blog.youkuaiyun.com/bestcoder_judge/article/details/47404821bestcoder_judgeMon, 10 Aug 2015 20:56:44 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47404655https://blog.youkuaiyun.com/bestcoder_judge/article/details/47404655bestcoder_judgeMon, 10 Aug 2015 20:50:17 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47397187https://blog.youkuaiyun.com/bestcoder_judge/article/details/47397187bestcoder_judgeMon, 10 Aug 2015 13:03:57 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47377469https://blog.youkuaiyun.com/bestcoder_judge/article/details/47377469bestcoder_judgeSun, 09 Aug 2015 16:53:27 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47360207https://blog.youkuaiyun.com/bestcoder_judge/article/details/47360207bestcoder_judgeSat, 08 Aug 2015 17:10:34 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47323421https://blog.youkuaiyun.com/bestcoder_judge/article/details/47323421bestcoder_judgeThu, 06 Aug 2015 21:27:35 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47316145https://blog.youkuaiyun.com/bestcoder_judge/article/details/47316145bestcoder_judgeThu, 06 Aug 2015 14:19:59 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47303333https://blog.youkuaiyun.com/bestcoder_judge/article/details/47303333bestcoder_judgeWed, 05 Aug 2015 20:54:17 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47293887https://blog.youkuaiyun.com/bestcoder_judge/article/details/47293887bestcoder_judgeWed, 05 Aug 2015 11:02:12 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47283173https://blog.youkuaiyun.com/bestcoder_judge/article/details/47283173bestcoder_judgeTue, 04 Aug 2015 21:39:43 +0800 #include using namespace std; #define SIGN(A) ((A > 0) ? 1 : -1) int IntegerMultiply(int X, int Y, int N) { int sign = SIG]]>https://blog.youkuaiyun.com/bestcoder_judge/article/details/47283061https://blog.youkuaiyun.com/bestcoder_judge/article/details/47283061bestcoder_judgeTue, 04 Aug 2015 21:33:16 +0800 #include #include #include #includehttps://blog.youkuaiyun.com/bestcoder_judge/article/details/47274137https://blog.youkuaiyun.com/bestcoder_judge/article/details/47274137bestcoder_judgeTue, 04 Aug 2015 11:18:05 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47263447https://blog.youkuaiyun.com/bestcoder_judge/article/details/47263447bestcoder_judgeMon, 03 Aug 2015 21:54:18 +0800 using namespace std; int n; int a[10000]; void dfs(int w,int k,int m) { if(k>n) return ; if(k==n) { for(int i=0;ihttps://blog.youkuaiyun.com/bestcoder_judge/article/details/47263227https://blog.youkuaiyun.com/bestcoder_judge/article/details/47263227bestcoder_judgeMon, 03 Aug 2015 21:42:07 +0800https://blog.youkuaiyun.com/bestcoder_judge/article/details/47263003https://blog.youkuaiyun.com/bestcoder_judge/article/details/47263003bestcoder_judgeMon, 03 Aug 2015 21:27:44 +0800