chengouxuan的专栏

/*The game of Yahtzee involves 5 dice, which are thrown in 13 rounds. A score card contains 13 categories; each round may be scored in a ca

Problem BBishopsInput: standard inputOutput: standard outputTime Limit: 4 secondsMemory Limit: 32 MB A bishop is a

Polynomial coefficients The ProblemThe problem is to calculate the coefficients in expansion of polynomial (x1+x2+...+xk)n

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9282    Accepte

Commedia dell' arte So called commedia dell' arte is a theater genre first played at Italy in the beginning of the sixteenth c

Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1862

Trees Made to OrderTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 362    Accept

Rooted Trees ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 337    Accep

The number of divisors(约数) about Humble NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total

Magic BitstringsTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51    Accepted

StepsPC/UVa IDs: 110608/846, Popularity: A, Success rate: high Level: 2Consider the process of stepping from integer x to integer y alon

好多次都re，原来是栈不够用。。。把递归改成迭代就ac了。。。  Tree You are to determine the value of the leaf node in a given binary tree that is

#include #include #include #include #include #include #include using namespace std;#define MAX_CAND 30#define MAX_VOTER 2000vector

Problem D - Australian VotingAustralian ballots require that the voter rank the candidates in order of choice. Initially only the first ch

1002. Phone numbersTime Limit: 2.0 secondMemory Limit: 16 MBIn the present world you frequently meet a lot of call numbers andth

EightTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1852    Accepted Submission(s): 532Special JudgeProblem DescriptionThe15-puz

在每个三角形中间取一个点，并给他设置坐标(x, y)，并在有边界的三角形之间用线把两个三角形的中心点相连，我们的任务就是不断缩短出发点和目的点之间的距离，每个点有都有三条路可走（忽略边界情况）。  #include #include double pi = acos(0.0) * 2;bool direc[2][6] = { true, false, true, fals

今天又抽空ac了一题，用时15ms，内存244k，排行榜上的都是0ms，几百b，牛人就是牛人，肯定知道什么公式。 而我的方法是按递减是顺序排列加数，例如： 1 = 1; 2 = 2;2 = 1 + 1; 3 = 3;3 = 2 + 1;3 = 1 + 1 + 1; 4 = 4;4 = 3 + 1;4 = 2 + 2;4 = 2 +

今天第一次写博客 本来以为long double应该可以搞定了，但是结果有好几十位，只好自己写大数加法，为了尽量少修改原来的代码，我修改的stl里string的接口，从而直接当成大整数来用。 #include #include #include #include using namespace std;class big_int : protected string

排列组合Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 811    Accepted Submission(s): 325Problem Description有n种物品，并且知道每种物品的数量。要求从中选

排列2Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1853    Accepted Submission(s): 717Problem DescriptionRay又对数字的列产生了兴趣：现有四张卡片

循环多少次？Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1343    Accepted Submission(s): 485Problem Description  我们知道，在编程中，我们时常需要考虑

Problem C: Self­describing Sequence Solomon Golomb's self­describing sequence  is the only non­decreasing sequence of positive integers with the property that it contains exactly f(k)

Problem ASummation of Four PrimesInput: standard inputOutput: standard outputTime Limit: 4 seconds Euler proved in one of his classic theorems that prime numbers are infinite in number. Bu

Problem D: Smith Numbers Background While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University , noticed that the telephone number of his broth

Problem BComplete Tree Labeling!Input: standard inputOutput: standard outputTime Limit: 45 secondsMemory Limit: 32 MB A complete k-ary tree is a k-ary tree in which all leaves have same

Problem D: FactovisorsThe factorial function, n! is defined thus for n a non-negative integer: 0! = 1 n! = n * (n-1)! (n > 0)We say that a divides b if there exists an integer k such tha

Angry BirdsTime Limit: 4 Seconds      Memory Limit: 65536 KBIn the famous game Angry Birds, players can choose a direction to shoot a blue bird, which can be spilt into three birds to hit th

MatrixTime Limit: 10 Seconds      Memory Limit: 131072 KBA N*M coordinate plane ((0, 0)~(n, m)). Initially the value of all N*M grids are 0.An operation T(a, b, h, x, y) is defined as foll

-3+1Time Limit: 2 Seconds      Memory Limit: 65536 KBZOJ is 10 years old! For celebrating, we are offering the easiest problem in the world to you.Recently we received a long sequence. We ca

Problem IThe Priest MathematicianInput: standard inputOutput: standard outputTime Limit: 10 seconds The ancient folklore behind the "Towers of Hanoi" puzzle invented by E. Lucas in 1883 is

Problem A: EXPRESSIONS Let X be the set of correctly built parenthesis expressions. The elements of X are strings consisting only of the characters �(� and �)�. The set X is defined as follo

#include #include #include #define SZ_MAX 110#define max(x, y) ((x) > (y) ? (x) : (y))int left_whites[SZ_MAX][SZ_MAX]; // including the itselfchar board[SZ_MAX][SZ_MAX];int sz;int main ()

字串数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1430    Accepted Submission(s): 257Problem Description一个A和两个B一共可以组成三种字符串:"ABB

不容易系列之一Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7296    Accepted Submission(s): 2967Problem Description大家常常感慨，要做好一件事情真的不容

Ice-sugar GourdTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 568    Accepted Submission(s): 207Problem DescriptionIce-sugar go

Just the Facts The expression N!, read as ``N factorial," denotes the product of the first N positive integers, where N is nonnegative. So, for example,NN!01

Divisors Mathematicians love all sorts of odd properties of numbers. For instance, they consider 945 to be an interesting number, since it is the first odd number for which the sum of its

BFS Knight Moves A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each

The Cat in the Hat Background(An homage to Theodore Seuss Geisel)The Cat in the Hat is a nasty creature,But the striped hat he is wearing has a rather nifty feature.With one flic