PKU 1486 sorting slides

The position of the Maxx, Minx, Maxy, miny, and N points of N slides indicates the slide number, which is written on the slide, ask if the maximum match between the slide and the serial number can be used to determine the unique match, and output

HDU 1063 & pku1001

Hey, postCode, Easy to understand Multiplication of large numbers, but there are many issues to pay attention. # Include # Include Void times (char * a, char * B, char * t) // multiplication of large numbers. A and B are multiplied and the

HDU, a little bee...

A little bee... Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 155 accepted submission (s): 92 Problem descriptionA trained bee can only

HDU tower VII

Tower VII Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 203 accepted submission (s): 174 Problem description The minimum number of moves to

HDU piggy-bank

Piggy-bank Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 71 accepted submission (s): 48 Problem description Before ACM can do anything, a

HDU bone board

Bone plate shop Square Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 103 accepted submission (s): 87 Problem description In a rectangle box of 2 × N, fill the square with a 1 × 2

HDU digital roots

Digital roots Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 176 accepted submission (s): 91 Problem descriptionthe digital root of a

HDU meal card

Loading the editor. Meal card Time Limit: 5000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 112 accepted submission (s): 50 Problem

HDU tiling_easy version

Tiling_easy version Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 107 accepted submission (s): 95 Problem description There is a grid with a size of 2 x n. Now we need to fill it with

HDU fatmouse's speed

Fatmouse's speed Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 177 accepted submission (s): 90 Problem descriptionFatmouse believes that

HDU 1455 sticks (Classic Deep Search + pruning)

Sticks Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3582 accepted submission (s): 903 Problem descriptiongeorge Took sticks of the same length and cut them randomly until all parts Became at

HDU proud merchants

Proud merchants Time Limit: 2000/1000 MS (Java/others) memory limit: 131072/65536 K (Java/Others) Total submission (s): 84 accepted submission (s): 46 Problem description recently, ISEA went to

Problem E: Communication

Problem E: Communication Time Limit: 1 sec memory limit: 128 MBSubmit: 66 solved: 11[Submit] [Status] [web board] Description Military training has started. specified groups is training all day. But because neu has no playground which is big

HDU 4001 to miss our children time

Question:When children play with blocks and build houses:N is given in the first row of each group of test data, which indicates that there are n bricks next;In the next n rows, each row shows the length, width, height, and attributes (A, B, C, and

HDU Wolf and rabbit

Wolf and rabbit Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 335 accepted submission (s): 214 Problem descriptionthere is a hill with N

HDU data Tower

Shuta Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 106 accepted submission (s): 94 Problem descriptionDescribe DPAlgorithmA classic

HDU 1717 decimal to fractional

(1) When the pure cyclic decimal point (only the integer part is 0) is converted into a score, the denominator of the score is composed of 9, and the number of 9 is equal to the number of digits of a cyclic section, molecules are composed of numbers

HDU 1010 tempter of the bone (Deep Search + parity pruning)

Tempter of the bone Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 615 accepted submission (s): 219 Problem descriptionthe doggie found a bone

HDU hat's Fibonacci

Hat's Fibonacci Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 268 accepted submission (s): 112 Problem descriptionA Fibonacci sequence is

Hdu 2531 Catch him

Catch him Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 124 Accepted Submission (s): 49Problem Description in American football, the player is responsible for directing the entire team's

Total Pages: 64722 1 .... 54984 54985 54986 54987 54988 .... 64722 Go to: GO

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.