free斩

题目：http://poj.org/problem?id=1113http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/FWallTime Limit:1000MSMemory Limit:10000KTotal Submissions:26219Accepted:8738DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's Read More

题目：http://poj.org/problem?id=1113http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/FWallTime Limit:1000MSMemory Limit:10000KTotal Submissions:26219Accepted:8738DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's Read More

链接：http://poj.org/problem?id=2187http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/EBeauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:24254Accepted:7403DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the Read More

链接：http://poj.org/problem?id=2031http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/ABuilding a Space StationTime Limit:1000MSMemory Limit:30000KTotal Submissions:3578Accepted:1830DescriptionYou are a member of the space station engineering team, and are assigned a task in the const Read More

题目：http://acm.timus.ru/problem.aspx?space=1&num=1181http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/A1181. Cutting a Painted PolygonTime limit: 1.0 secondMemory limit: 64 MBThere is a convex polygon with vertices painted in three colors: Red (R), Green (G) and Blue (B). It is Read More

图文链接地址：http://blog.chinaunix.net/uid-191945-id-3383080.htmlchorme导入SwitchySharp配置地址：chrome-extension://dpplabbmogkhghncfbfdeeokoefdjegm/options.html?firstTime Read More

转载请注明出处：http://blog.csdn.net/lyy289065406/article/details/6648539優YoUhttp://user.qzone.qq.com/289065406/blog/1309237394大致题意：求A^B的所有约数（即因子）之和，并对其取模 9901再输出。解题思路：要求有较强 数学思维 的题应用定理主要有三个：要求有较强 数学思维 的题应用定理主要有三个：（1） 整数的唯一分解定理： 任意正整数都有且只有一种方式写出其素因子的乘积表达式。 A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 其中pi均为素数（2） Read More

博弈知识汇总有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿走 Read More

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4608http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/G2013暑期多校联合训练——80+高校，300+队伍，10000元奖金，敬请期待~I-numberTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1006Accepted Submission(s): 398P Read More

题目：http://poj.org/problem?id=3714http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/DRaidTime Limit:5000MSMemory Limit:65536KTotal Submissions:7355Accepted:2185DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last stronghold. Dependi Read More