Others

Question type: Mathematics Problem solving process: The question is very simple, but the disgusting precision problem is not considered, and the cup will eventually continue with history... Do not use integer output reason: the N of the question

Problem description: The cost of calculating an addition is the sum of two integers, and the total cost of calculating an addition formula is calculated. Type: HaffmanAlgorithm Solution: Do you only need to use two queues to simulate hafman or

Question type: Mathematics Solution: This question can be converted to: calculate n ^ I = num, (n + 1) ^ I = H; then calculate the sum of the proportional series. Note: when the equality factor q is equal to 1, we should discuss it separately ...

[Preface] On Saturday, I ran to the lab for review. Half of the review shows a contest. After reading a question, I thought I could do it, and then I got yy. And then it's out of control ...... I did not do ACM for a long time and have been busy

v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}--> Picture Time Limit: 6000/2000 MS(Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s)

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable{mso-style-name:普通表格;mso-tstyle-rowband-size:0;mso-tstyle-colband-size:0;mso-style-

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Gift hunting Time Limit: 6000/3000 MS(Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 349 accepted

Palindrome Time limit:3000 Ms   Memory limit:65536 K Total submissions:31491   Accepted:10509 Description A palindrome is a regular rical string, that is, a string read identically from left to right as well as

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Dividing Time Limit: 2000/1000 MS(Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3850 accepted

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1166 For details about the tree array, Baidu has a lot of related information.# Include Using namespace STD; Const int maxn = 50010;// Long data [maxn];Long result [maxn];Long N;Int lowbit (int t){//

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Advanced Fruits Time Limit: 2000/1000 MS (Java/others) memoryLimit: 65536/32768 K (Java/Others)Total submission (s): 415

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Pearls Time Limit: 2000/1000 MS(Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 388 accepted

Vito shoshould live on the street which is the median of his relatives. Code: /*************************************** ********************************** * Copyright (c) 2008 by liukaipeng * * Liukaipeng at gmail dot com * *********************

I just simulate the flipping. we are not required to find the optimal solution, so I choose a way easy to understand. I find the biggest cake in the unsorted stack, and then check its position. if it is at the bottom of the stack, then nothing need

Question type: Stack Simulation Problem solving experience: crash .... Question: (from Baidu space on spark) Your task is to simulate a card game called "accordian". Its rules are as follows: A deck of playing cards has 52 cards. First, arrange one

We can solve this problem by simulating the calculating process of multiply two numbers on the paper, yet we 've already known the product. we guess the least significant digit of one number, multiply it with the other number to get a 1 of the least

Straight forward simulating. Code: /*************************************** ********************************** * Copyright (c) 2008 by liukaipeng * * Liukaipeng at gmail dot com * **************************************** ***********************

Just like find a number in a binary search tree. The only trick is keeping record of the current node's left and right node to get to its child node. Code: /*************************************** ********************************** * Copyright

Checking the Kings against others may be faster than checking reversely. I check the knights first and then pawns. all the others are checked by walking along in the eight directions ctions. you must be very cautious in coding. A minor typo wowould

I use the naive string SEARCH method that scans for the eight directions ctions at each point in the matrix. Due to the relatively small input size, this method works well enough to get the top 20% ranking. Code: /*********************************