Others

Corporate Identity Time limit:3000 Ms   Memory limit:65536 K Total submissions:4152   Accepted:1569 Description Beside other services, ACM helps companies to clearly state their "login ate

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 647 Question meaning: Use the given '-', '|' rules to represent an integer. Rule: Use s "-" to represent

Because If x If X> = 10 f (x) = A0 * F (x-1) + A1 * F (X-2) + A2 * F (X-3) + ...... + A9 * F (X-10 ); Therefore, the recursive matrix is constructed based on the recursive structure. Similar to vijos1067 in nature, note that the AI and f (I)

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 653   Question meaning: To give a binary tree, each layer has a value, 1 to the right, left to the left, give

/* Question: m replicas are given sequentially, and the M replicas are used repeatedly to operate the initial sequence, asking the sequence after K replicas. M Description When the Genie have all the cards written. The genie from the gift

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1693 Question meaning: For N * m squares, there are obstacles to some squares. Ask How many ways can all non-obstacle points be placed on a ring, and there can be multiple rings.

I think this question is a good method, but I have never met it before, and I have never thought of it. This is a simple and straightforward method to reduce complexity. First, the two sets are merged into one set, and the two (S1, S2) are

Pairs of Integers Time limit:1000 ms   Memory limit:10000 K Total submissions:3622   Accepted:905 Description You are to find all pairs of integers such that their sum is equal to the given integer

Query Time Limit: 20000/10000 MS (Java/others) memory limit: 65536/65536 K (Java/Others)Total submission (s): 2059 accepted submission (s): 706Problem descriptionyou are given two strings S1 [0 .. L1], S2 [0 .. L2] and Q-number of queries.Your task

The shortest time is required. BFS is used, priority queue is used, and less time is placed on the top of the heap. First out of heap. Then, due to the need to output the path and add pre to the node, the design data structure is different here

As shown in the figure, the capacity of the ox to the source point is 1, the capacity of the ox to the ox shed is 1, and the capacity of the ox to the sink point is the capacity of the corresponding shed. Enumeration: enumeration of an interval. If

This is a detailed question. In the question, let's use two lines to connect the rain. The rain drops vertically and ask how much water we can connect with the given two lines. We will discuss it in many cases here. 1: two line segments do not want

Relocation Time limit:1000 ms   Memory limit:65536 K Total submissions:1479   Accepted:597 Description Emma and Eric are moving to their new house they bought after returning from their honeymoon. fortunately,

Question address: http://poj.org/problem? Id = 2449 This article references. The nearest short circuit of the K is the shortest of all the shops from one point to another. That is to say, the short circuit we often use is the 1st short circuit. The

Formula A [1] = 2A [n] = 2 * A [n-1] + 2 ^ (n-2) Here N is n-k in the question When K> N outputs 0 K = N output 1 N-k is equal to 1, because 2 ^ (n-2) This is 1/2 bad representation Matrix used for quick power [2, 2] [A [2] ([0, 2]) ^ (n-k-2) * [1]

Please stamp the question here A series of operations on the queue, + I indicates that I is in the queue,-I indicates that I is out of the queue, and now these operations are performed. Insert P indicates to insert an operation + I at the position P

Question address: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2399 Question meaning: I will give you a string and ask you the longest retrieval string that can be made up of it, with

  Question link: Http://poj.org/problem? Id = 2828   Question meaning: There are n people waiting in queue, each person has a pos value, and a value, which means that he can insert it behind the POs individual and output the final formation sequence.

Frog appointment Time limit:1000 ms   Memory limit:10000 K Total submissions:81634   Accepted:14126 DescriptionThe two frogs met each other on the Internet. They had a good chat, so they thought it was necessary

Girls and boys Time Limit: 20000/10000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 5528 accepted submission (s): 2466 problem descriptionthe second year of the university somebody started a study on the romantic