ACM,再见！

东北林业大学 OJ 题源description在小明曾经玩过的一种对号码的纸牌游戏(乐透)里,玩家必须从{1,2,……，49}中选择6个数。玩Lotto的一个流行策略是（虽然它并不增加你赢的机会）：就是从这49个数中，选出k（k>6）个数组成一个子集S，然后只从S里拿出牌来玩几局游戏。例如，k=8，s={1,2,3,5,8,13,21,34}，那么有28

http://acm.hdu.edu.cn/showproblem.php?pid=5143Problem DescriptionNPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of num

http://poj.org/problem?id=1018DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device,

http://poj.org/problem?id=1178DescriptionCenturies ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance o

http://acm.hdu.edu.cn/showproblem.php?pid=4403Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for pri

http://acm.hdu.edu.cn/showproblem.php?pid=4737Problem DescriptionThere are n numbers in a array, as a0, a1 ... , an-1, and another number m. We define a function f(i, j) = ai|ai+1|ai+2| ...

http://codeforces.com/problemset/problem/3/CC. Tic-tac-toetime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard

http://acm.hdu.edu.cn/showproblem.php?pid=5365Problem DescriptionAFA is a girl who like runing.Today,he download an app about runing .The app can record the trace of her runing.AFA will star

http://acm.hdu.edu.cn/showproblem.php?pid=5386Problem DescriptionYou have an n∗n matrix.Every grid has a color.Now there are two types of operating:L x y: for(int i=1;iH x y:for(int i=

http://acm.hdu.edu.cn/showproblem.php?pid=4770Problem DescriptionHarry: "But Hagrid. How am I going to pay for all of this? I haven't any money." Hagrid: "Well there's your money, Harr

http://acm.hdu.edu.cn/showproblem.php?pid=4346Problem DescriptionThere is a road from city A to city B.On the road,there are N positions(indexed from 0 to N-1).In order to celebrate the Mult

http://acm.hdu.edu.cn/showproblem.php?pid=4432

http://acm.hdu.edu.cn/showproblem.php?pid=4770

大东林 acm 题源description在测试超大规模集成电路时，对给定的一个设计，专家要检测元件是否相互遮盖。一个元件可视为一个矩形，假设每个矩形都是水平排列的（边与x轴或y轴平行），所以长方形由最小的和最大的x，y坐标表示。编程计算完全被覆盖的矩形个数。 input输入有多组长方形实例。对每

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43311#problem/BDescriptionYou've got two rectangular tables with sizes na × ma and nb × mb cells. The tables consist of zeroes and

OJ测试位置：http://acm.nefu.edu.cn/JudgeOnline/contestshow.php?contest_id=118&problem_id=574&num=8description只有质数2,3,5,7这几个作为因子的数叫做,丑数,比如前20个丑数是(从小到大来说) 1,2,3,4,6,7,8,9,10,12,14,15,16

http://codeforces.com/problemset/problem/7/A

http://wenku.baidu.com/link?url=ch5OM3LjZ9mH2FicoEW_f9QnXgDrWmSRXa1N_Tk-CZCAB7lrllWAvgtFNCBplfgbAdgWw8S77fSXPbpfyXfuhPfXoor6LZ8z_UtlAY6AwNi

http://vjudge.net/contest/view.action?cid=50643#problem/ASome brave warriors come to a lost village. They are very lucky and find a lot of treasures and a big treasure chest, but with angry zo

http://poj.org/problem?id=2718DescriptionGiven a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The

http://acm.hdu.edu.cn/showproblem.php?pid=4968

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=381&page=show_problem&problem=3007

http://codeforces.com/problemset/problem/405/EE. Graph Cuttingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outp