命运只负责洗牌，但玩牌的是我们自己。

Binomial Showdown Time Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic DiscussProblem Description In how many ways can you choose k elements out of n elements, not taking order into accou...

B. Canvas FramesNicholas, a painter is going to paint several new canvases. Nicholas is sure that the canvases will turn out so great that each one will need framing and being hung on the wall. Fram...

A. Insomnia cure«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.However, just counting dr...

A. Perfect PermutationA permutation is a sequence of integers p1, p2, …, pn, consisting of n distinct positive integers, each of them doesn’t exceed n. Let’s denote the i-th element of permutation p...

The 3n + 1 problem Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property o...

几何递推? Time Limit: 1000 ms Memory Limit: 65536 KiBProblem Description 在 N * N 的正方形中，最多能放下多少个直径为1的圆？Input 第一行输入一个整数N。1 <= N <= 10Output 输出圆的数量Sample Input 2Sample Output 4Hint s...

B. Non-square EquationLet’s consider equation : x^2 + s(x)·x - n = 0,  where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system...

Eddy的洗牌问题Eddy是个ACMer,他不仅喜欢做ACM题,而且对于纸牌也有一定的研究,他在无聊时研究发现,如果他有2N张牌，编号为1,2,3..n,n+1,..2n。这也是最初的牌的顺序。通过一次洗牌可以把牌的序列变为n+1,1,n+2,2,n+3,3,n+4,4..2n,n。那么可以证明，对于任意自然数N，都可以在经过M次洗牌后第一次重新得到初始的顺序。编程对于小于100000的自然数...

D - MaratonIME in the golden moment time limit per test0.5 s memory limit per test256 MB inputstandard input outputstandard outputStatements It is a common knowledge the importance in practici...

Packets Time Limit: 1000 ms Memory Limit: 10000 KiBProblem Description A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. Thes...

Sum Problem Time Limit: 500 ms Memory Limit: 32768 KiBProblem Description Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge). In this problem, your task is to calculate SUM(n) = 1 + 2...

P1047 校门外的树题目描述 某校大门外长度为L的马路上有一排树，每两棵相邻的树之间的间隔都是 11 米。我们可以把马路看成一个数轴，马路的一端在数轴 00 的位置，另一端在 LL 的位置；数轴上的每个整数点，即 0,1,2,…,L0,1,2,…,L ，都种有一棵树。由于马路上有一些区域要用来建地铁。这些区域用它们在数轴上的起始点和终止点表示。已知任一区域的起始点和终止点的坐标都是整数...

Elevator Time Limit: 1000 ms Memory Limit: 32768 KiBProblem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denot...

Find Integer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1391 Accepted Submission(s): 443 Special JudgeProblem Description people ...

骨牌铺方格 Time Limit: 1000 ms Memory Limit: 32768 KiBProblem Description 在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数. 例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图： Input 输入数据由多行组成，每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n...

阿牛的EOF牛肉串 Time Limit: 1000 ms Memory Limit: 32768 KiBProblem Description 今年的ACM暑期集训队一共有18人，分为6支队伍。其中有一个叫做EOF的队伍，由04级的阿牛、XC以及05级的COY组成。在共同的集训生活中，大家建立了深厚的友谊，阿牛准备做点什么来纪念这段激情燃烧的岁月，想了一想，阿牛从家里拿来了一块上等的牛肉...

A - MaratonIME helps Pablito https://cn.vjudge.net/problem/488485/origin♬ Caloventor tiene miedo… ♬ Benedetto, Nathan As is well known by any cultured person, rats are the smartest beings on ea...