 Get Many Persimmon Trees

Description
Seiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to reward him for his meritorious career in education, Katanobu Matsudaira, the lord of the domain of Aizu, had decided to grant him a rectangular estate within a large field in the Aizu Basin. Although the size (width and height) of the estate was strictly specified by the lord, he was allowed to choose any location for the estate in the field. Inside the field which had also a rectangular shape, many Japanese persimmon trees, whose fruit was one of the famous products of the Aizu region known as 'Mishirazu Persimmon', were planted. Since persimmon was Hayashi's favorite fruit, he wanted to have as many persimmon trees as possible in the estate given by the lord.
For example, in Figure 1, the entire field is a rectangular grid whose width and height are 10 and 8 respectively. Each asterisk (*) represents a place of a persimmon tree. If the specified width and height of the estate are 4 and 3 respectively, the area surrounded by the solid line contains the most persimmon trees. Similarly, if the estate's width is 6 and its height is 4, the area surrounded by the dashed line has the most, and if the estate's width and height are 3 and 4 respectively, the area surrounded by the dotted line contains the most persimmon trees. Note that the width and height cannot be swapped; the sizes 4 by 3 and 3 by 4 are different, as shown in Figure 1.
Figure 1: Examples of Rectangular EstatesYour task is to find the estate of a given size (width and height) that contains the largest number of persimmon trees.
InputThe input consists of multiple data sets. Each data set is given in the following format.
N
W H
x1 y1
x2 y2
...
xN yN
S TN is the number of persimmon trees, which is a positive integer less than 500. W and H are the width and the height of the entire field respectively. You can assume that both W and H are positive integers whose values are less than 100. For each i (1 <= i <= N), xi and yi are coordinates of the ith persimmon tree in the grid. Note that the origin of each coordinate is 1. You can assume that 1 <= xi <= W and 1 <= yi <= H, and no two trees have the same positions. But you should not assume that the persimmon trees are sorted in some order according to their positions. Lastly, S and T are positive integers of the width and height respectively of the estate given by the lord. You can also assume that 1 <= S <= W and 1 <= T <= H.
The end of the input is indicated by a line that solely contains a zero.
OutputFor each data set, you are requested to print one line containing the maximum possible number of persimmon trees that can be included in an estate of the given size.
Sample Input16
10 8
2 2
2 5
2 7
3 3
3 8
4 2
4 5
4 8
6 4
6 7
7 5
7 8
8 1
8 4
9 6
10 3
4 3
8
6 4
1 2
2 1
2 4
3 4
4 2
5 3
6 1
6 2
3 2
0
Sample Output4
3
Calories from Fat _course
20171016Description Fat contains about 9 Calories/g of food energy. Protein, sugar, and starch contain about 4 Calories/g, while alcohol contains about 7 Calories/g. Although many people consume more than 50% of their total Calories as fat, most dieticians recommend that this proportion should be 30% or less. For example, in the Nutrition Facts label to the right, we see that 3g of fat is 5% of the recommended daily intake based on a 2,000 calorie diet. A quick calculation reveals that the recommended daily intake of fat is therefore 60g; that is, 540 Calories or 27% Calories from fat. Others recommend radically different amounts of fat. Dean Ornish, for example, suggests that less than 10% of total caloric intake should be fat. On the other hand, Robert Atkins recommends the elimination of all carbohydrate with no restriction on fat. It has been estimated that the average Atkins dieter consumes 61% of Calories from fat. From a record of food eaten in one day, you are to compute the percent Calories from fat. The record consists of one line of input per food item, giving the quantity of fat, protein, sugar, starch and alcohol in each. Each quantity is an integer followed by a unit, which will be one of: g (grams), C (Calories), or % (percent Calories). Percentages will be between 0 and 99. At least one of the ingredients will be given as a nonzero quantity of grams or Calories (not percent Calories). Input Input will consist of several test cases. Each test case will have one or more lines as described above. Each test case will be terminated by a line containing ''. An additional line containing '' will follow the last test case. Output For each test case, print percent Calories from fat, rounded to the nearest integer. Sample Input 3g 10g 10% 0g 0g 55% 100C 0% 0g 30g  25g 0g 0g 0g 0g  1g 15% 20% 30% 1C   Sample Output 53% 100% 32%
Division _course
20171001Description Given t, a, b positive integers not bigger than 2147483647, establish whether (t^a  1)/(t^b 1) is an integer with less than 100 digits. Input Each line of input contains t, a, b. Output For each line of input print the formula followed by its value, or followed by "is not an integer with less than 100 digits.", whichever is appropriate. Sample Input 2 9 3 2 3 2 21 42 7 123 911 1 Sample Output (2^91)/(2^31) 73 (2^31)/(2^21) is not an integer with less than 100 digits. (21^421)/(21^71) 18952884496956715554550978627384117011154680106 (123^9111)/(123^11) is not an integer with less than 100 digits.
Magic Bitstrings _course
20171016Description A bitstring, whose length is one less than a prime, might be magic. 1001 is one such string. In order to see the magic in the string let us append a nonbit x to it, regard the new thingy as a cyclic string, and make this square matrix of bits each bit 1001 every 2nd bit 0110 every 3rd bit 0110 every 4th bit 1001 This matrix has the same number of rows as the length of the original bitstring. The mth row of the matrix has every mth bit of the original string starting with the mth bit. Because the enlarged thingy has prime length, the appended x never gets used. If each row of the matrix is either the original bitstring or its complement, the original bitstring is magic. Input Each line of input (except last) contains a prime number p <= 100000. The last line contains 0 and this line should not be processed. Output For each prime number from the input produce one line of output containing the lexicographically smallest, nonconstant magic bitstring of length p1, if such a string exists, otherwise output Impossible. Sample Input 5 3 17 47 2 79 0 Sample Output 0110 01 0010111001110100 0000100001101010001101100100111010100111101111 Impossible 001001100001011010000001001111001110101010100011000011011111101001011110011011
How many prime numbers _course
20170528Problem Description Give you a lot of positive integers, just to find out how many prime numbers there are. Input There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32bit signed integer, and each of them won’t be less than 2. Output For each case, print the number of prime numbers you have found out. Sample Input 3 2 3 4 Sample Output 2
Map of Ninja House _course
20171017Description An old document says that a Ninja House in Kanazawa City was in fact a defensive fortress, which was designed like a maze. Its rooms were connected by hidden doors in a complicated manner, so that any invader would become lost. Each room has at least two doors. The Ninja House can be modeled by a graph, as shown in Figure 1. A circle represents a room. Each line connecting two circles represents a door between two rooms. I decided to draw a map, since no map was available. Your mission is to help me draw a map from the record of my exploration. I started exploring by entering a single entrance that was open to the outside. The path I walked is schematically shown in Figure 2, by a line with arrows. The rules for moving between rooms are described below. After entering a room, I first open the rightmost door and move to the next room. However, if the next room has already been visited, I close the door without entering, and open the next rightmost door, and so on. When I have inspected all the doors of a room, I go back through the door I used to enter the room. I have a counter with me to memorize the distance from the first room. The counter is incremented when I enter a new room, and decremented when I go back from a room. In Figure 2, each number in parentheses is the value of the counter when I have entered the room, i.e., the distance from the first room. In contrast, the numbers not in parentheses represent the order of my visit. I take a record of my exploration. Every time I open a door, I record a single number, according to the following rules. 1. If the opposite side of the door is a new room, I record the number of doors in that room, which is a positive number. 2. If it is an already visited room, say R, I record "the distance of R from the first room" minus "the distance of the current room from the first room", which is a negative number. In the example shown in Figure 2, as the first room has three doors connecting other rooms, I initially record "3". Then when I move to the second, third, and fourth rooms, which all have three doors, I append "3 3 3" to the record. When I skip the entry from the fOurth room to the first room, the distance difference "3" (minus three) will be appended, and so on. So, when I finish this exploration, its record is a sequence of numbers "3 3 3 3 3 3 2 5 3 2 5 3". There are several dozens of Ninja Houses in the city. Given a sequence of numbers for each of these houses, you should produce a graph for each house. Input The first line of the input is a single integer n, indicating the number of records of Ninja Houses I have visited. You can assume that n is less than 100. Each of the following n records consists of numbers recorded on one exploration and a zero as a terminator. Each record consists of one or more lines whose lengths are less than 1000 characters. Each number is delimited by a space or a newline. You can assume that the number of rooms for each Ninja House is less than 100, and the number of doors in each room is less than 100. Output For each Ninja House of m rooms, the output should consist of m lines. The ith line of each such m lines should look as follows: i r(1) r(2)... r(ki), where r(1),... , r(ki), should be rooms adjoining room i, and ki should be the number of doors in room i. Numbers should be separated by exactly one space character. The rooms should be numbered from 1 in visited order. r(1), r(2),..., r(ki), should be in ascending order. Note that the room i may be connected to another room through more than one door. In this case, that room number should appear in r(1),...,r(ki), as many times as it is connected by different doors. Sample Input 2 3 3 3 3 3 3 2 5 3 2 5 3 0 3 5 4 2 4 3 2 2 1 0 Sample Output 1 2 4 6 2 1 3 8 3 2 4 7 4 1 3 5 5 4 6 7 6 1 5 7 3 5 8 8 2 7 1 2 3 4 2 1 3 3 4 4 3 1 2 2 4 4 1 2 2 3
Generalized Palindromic Number _course
20170902A number that will be the same when it is written forwards or backwards is known as a palindromic number. For example, 1234321 is a palindromic number. We call a number generalized palindromic number, if after merging all the consecutive same digits, the resulting number is a palindromic number. For example, 122111 is a generalized palindromic number. Because after merging, 122111 turns into 121 which is a palindromic number. Now you are given a positive integer N, please find the largest generalized palindromic number less than N. Input There are multiple test cases. The first line of input contains an integer T (about 5000) indicating the number of test cases. For each test case: There is only one integer N (1 <= N <= 1018). Output For each test case, output the largest generalized palindromic number less than N. Sample Input 4 12 123 1224 1122 Sample Output 11 121 1221 1121
Up and Down Sequences _course
20171013Description The quality of pseudo randomnumber generators used in some computations, especially simulation, is a significant issue. Proposed generation algorithms are subjected to many tests to establish their quality, or, more usually, their lack of it. One of the common tests is the run test. In this test, sequences are tested for ``runs up" and ``runs down." We will examine series of data values for the ``Up" and ``Down" sequences each series contains. Within a series, an ``Up" sequence continues as long as each datavalue received is not less than the previous datavalue. An ``Up" sequence terminates when a datavalue received is less than the previous datavalue received. A ``Down" sequence continues as long as each datavalue received is not greater than the previous datavalue. A ``Down" sequence terminates when a datavalue received is greater than the previous datavalue received. An ``Up" sequence can be initiated by the termination of a ``Down" sequence and vice versa. (Sequences initiated in this manner have length one at this initiation point.) All the initial datavalues are part of an ``Up" sequence, and contribute to its length, if the first deviation of the datavalues is upwards. All the initial datavalues are part of a ``Down" sequence, and contribute to its length, if the first deviation of the datavalues is downwards. If the datavalues received don't allow classification as either an ``Up" or a ``Down" sequence, the data should be considered to have neither sequence. Find the average length of both the ``Up" and the ``Down" sequences encountered for each input line in the data file. Report these average lengths as each input line is processed. Input Each of the separate series to be examined is contained on a single line of input. Each series to be analyzed consists of at least one and no more than 30 unsigned, nonzero integers. Each integer in a series has at least one digit and no more than four digits. The integers are separated from each other by a single blank character. Each of the series will be terminated by a single zero (0) digit. This terminator should not be considered as being part of the series being analyzed. The set of series to be analyzed is terminated by a single zero (0) digit as the input on a line. This terminator should not be considered to be a series, and no output should be produced in response to its encounter. Output A line with two real values is to be emitted for each input data set encountered. It must begin with the message ``Nr values = N: ", where N is the number of input data in the line; and then to continue with the average values for runs. First, the average ``Up" run length, then the average ``Down" run length. Separate these values with a space. Answers must be rounded to six digits after the decimal point. Sample Input 1 2 3 0 3 2 1 0 1 2 3 2 1 0 2 2 2 2 3 0 4 4 4 4 3 0 4 4 4 3 3 3 3 0 4 4 4 3 3 3 4 0 5 5 5 5 0 1 2 3 2 3 4 5 0 0 Sample Output Nr values = 3: 2.000000 0.000000 Nr values = 3: 0.000000 2.000000 Nr values = 5: 2.000000 2.000000 Nr values = 5: 4.000000 0.000000 Nr values = 5: 0.000000 4.000000 Nr values = 7: 0.000000 6.000000 Nr values = 7: 1.000000 5.000000 Nr values = 4: 0.000000 0.000000 Nr values = 7: 2.500000 1.000000
Elevator _course
20170423The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop. For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled. Input There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed. Output Print the total time on a single line for each test case. Sample Input 1 2 3 2 3 1 0 Sample Output 17 41
poker card game _course
20171015Description Suppose you are given many poker cards. As you have already known, each card has points ranging from 1 to 13. Using these poker cards, you need to play a game on the cardboard in Figure 1. The game begins with a place called START. From START, you can walk to left or right to a rectangular box. Each box is labeled with an integer, which is the distance to START. ![](http://poj.org/images/1339_1.jpg) Figure 1: The poker card game cardboard. To place poker cards on these boxes, you must follow the rules below: (1) If you put a card with n points on a box labeled i , you got (n ∗ i) points. (2) Once you place a card on a box b, you block the paths to the boxes behind b. For example, in Figure 2, a player places a queen on the right box of distance 1, he gets 1 ∗ 12 points but the queen also blocks the paths to boxes behind it; i.e., it is not allowed to put cards on boxes behind it anymore. ![](http://poj.org/images/1339_2.jpg) Figure 2: Placing a queen. Your goal: Given a number of poker cards, find a way to place them so that you will get the minimum points. For example, suppose you have 3 cards 5, 10, and K. To get the minimum points, you can place cards like Figure 3, where the total points are 1 * 13 + 2 * 5 + 2 * 10 = 43. ![](http://poj.org/images/1339_3.jpg) Figure 3: An example to place cards. Input The first line of the input file contains an integer n, n <= 10, which represents the number of test cases. In each test case, it begins with an integer m, m <= 100000, which represents the number of poker cards. Next, each card represented by its number are listed consecutively. Note that, the numbers of ace, 2, 3, ..., K are given by integers 1, 2, 3, ..., 13, respectively. The final minimum point in each test case is less than 5000000. Output List the minimum points of each test case line by line. Sample Input 3 3 5 10 13 4 3 4 5 5 5 7 7 10 11 13 Sample Output 43 34 110
Painting _course
20161230Description Ethan wants to draw a painting on an m×n board. He can draw some strips on the board using a paintbrush of width one. In each step, he must choose a new color and paint a full column or a full row. He has a great image to be drawn on the board, but he doesn’t know which color to use first. You must help him in finding out the order of colors. Input There are multiple test cases in the input. The first line of each test case contains two integers m and n, the size of the board (0< m, n <100). Following the first line, there are m lines with n integers denoting the color in each cell. All the colors are positive integer numbers less than 10000. The input is terminated with a single line containing two consecutive zeros. Output For each test case, write a single line containing the order of colors used to paint the board. If there are several answers, output the one which is lexicographically smallest (considering each number as a symbol). Sample Input 4 4 1 5 4 3 6 5 6 6 2 2 2 2 1 5 4 3 3 2 1 1 2 3 2 3 0 0 Sample Output 1 3 4 6 5 2 2 3 1
The Alphabet Game _course
20171015Description Little Dara has recently learned how to write a few letters of the English alphabet (say k letters). He plays a game with his little sister Sara. He draws a grid on a piece of paper and writes p instances of each of the k letters in the grid cells. He then asks Sara to draw as many sidetoside horizontal and/or vertical bold lines over the grid lines as she wishes, such that in each rectangle containing no bold line, there would be p instances of one letter or nothing. For example, consider the sheet given in Figure 1, where Sara has drawn two bold lines creating four rectangles meeting the condition above. Sara wins if she succeeds in drawing the required lines. Dara being quite fair to Sara, wants to make sure that there would be at least one solution to each case he offers Sara. You are to write a program to help Dara decide on the possibility of drawing the right lines. ![](http://poj.org/images/1231_1.jpg) Input The first line of the input file contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case consists of two integers k (1 <= k <= 26), the number of different letters, and p (1 <= p <= 10), the number of instances of each letter. Followed by the first line, there are k lines, one for each letter, each containing p pairs of integers (xi, yi) for 1 <= i <= p. A pair indicates coordinates of the cell on the paper where one instance of the letter is written. The coordinates of the upper left cell of the paper is assumed to be (1,1). Coordinates are positive integers less than or equal to 1,000,000. You may assume that no cell contains more than one letter. Output There should be one line per test case containing a single word YES or NO depending on whether the input paper can be divided successfully according to the constraints stated in the problem. Sample Input 2 3 2 6 4 8 4 4 2 2 1 2 3 2 4 3 3 1 1 3 1 5 1 2 1 4 1 6 1 2 2 4 2 8 1 Sample Output YES NO
Gondwanaland Telecom _course
20171011Description Gondwanaland Telecom makes charges for calls according to distance and time of day. The basis of the charging is contained in the following schedule, where the charging step is related to the distance: Charging Step Day Rate 8am to 6pm Evening Rate 6pm to 10pm Night Rate 10pm to 8am A 0.10 0.06 0.02 B 0.25 0.15 0.05 C 0.53 0.33 0.13 D 0.87 0.47 0.17 E 1.44 0.80 0.30 All charges are in dollars per minute of the call. Calls which straddle a rate boundary are charged according to the time spent in each section. Thus a call starting at 5:58 pm and terminating at 6:04 pm will be charged for 2 minutes at the day rate and for 4 minutes at the evening rate. Calls less than a minute are not recorded and no call may last more than 24 hours. Write a program that reads call details and calculates the corresponding charges. Input Input lines will consist of the charging step (upper case letter 'A'..'E'), the number called (a string of 7 digits and a hyphen in the approved format) and the start and end times of the call, all separated by exactly one blank. Times are recorded as hours and minutes in the 24 hour clock, separated by one blank and with two digits for each number. Input will be terminated by a line consisting of a single #. Output Output will consist of the called number, the time in minutes the call spent in each of the charge categories, the charging step and the total cost in the format shown below. Sample Input A 1835724 17 58 18 04 # Sample Output 1835724 2 4 0 A 0.44
Bone Collector _course
20171124Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ? Input The first line contain a integer T , the number of cases. Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone. Output One integer per line representing the maximum of the total value (this number will be less than 231). Sample Input 1 5 10 1 2 3 4 5 5 4 3 2 1 Sample Output 14
Ponds _course
20171029Problem Description Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v. Now Betty wants to remove some ponds because she does not have enough money. But each time when she removes a pond, she can only remove the ponds which are connected with less than two ponds, or the pond will explode. Note that Betty should keep removing ponds until no more ponds can be removed. After that, please help her calculate the sum of the value for each connected component consisting of a odd number of ponds Input The first line of input will contain a number T(1≤T≤30) which is the number of test cases. For each test case, the first line contains two number separated by a blank. One is the number p(1≤p≤104) which represents the number of ponds she owns, and the other is the number m(1≤m≤105) which represents the number of pipes. The next line contains p numbers v1,...,vp, where vi(1≤vi≤108) indicating the value of pond i. Each of the last m lines contain two numbers a and b, which indicates that pond a and pond b are connected by a pipe. Output For each test case, output the sum of the value of all connected components consisting of odd number of ponds after removing all the ponds connected with less than two pipes. Sample Input 1 7 7 1 2 3 4 5 6 7 1 4 1 5 4 5 2 3 2 6 3 6 2 7 Sample Output 21
Egypt _course
20170219Problem Description A long time ago, the Egyptians figured out that a triangle with sides of length 3, 4, and 5 had a right angle as its largest angle. You must determine if other triangles have a similar property. ![](http://acm.hdu.edu.cn/data/images/C38410031.jpg) Input Input represents several test cases, followed by a line containing 0 0 0. Each test case has three positive integers, less than 30,000, denoting the lengths of the sides of a triangle. Output For each test case, a line containing "right" if the triangle is a right triangle, and a line containing "wrong" if the triangle is not a right triangle. Sample Input 6 8 10 25 52 60 5 12 13 0 0 0 Sample Output right wrong right
Primes Problem _course
20170129Problem Description Given a number n, please count how many tuple(p1, p2, p3) satisfied that p1<=p2<=p3, p1,p2,p3 are primes and p1 + p2 + p3 = n. Input Multiple test cases(less than 100), for each test case, the only line indicates the positive integer n(n≤10000). Output For each test case, print the number of ways. Sample Input 3 9 Sample Output 0 2 Source BestCoder Round #18
Paint Mix _course
20161223Description You are given two large pails. One of them (known as the black pail) contains B gallons of black paint. The other one (known as the white pail) contains W gallons of white paint. You will go through a number of iterations of pouring paint first from the black pail into the white pail, then from the white pail into the black pail. More specifically, in each iteration you first pour C cups of paint from the black pail into the white pail (and thoroughly mix the paint in the white pail), then pour C cups of paint from the white pail back into the black pail (and thoroughly mix the paint in the black pail). B, W, and C are positive integers; each of B and W is less than or equal to 50, and C < 16 * B (recall that 1 gallon equals 16 cups). The white pail's capacity is at least B+W. As you perform many successive iterations, the ratio of black paint to white paint in each pail will approach B/W. Although these ratios will never actually be equal to B/W one can ask: how many iterations are needed to make sure that the blacktowhite paint ratio in each of the two pails differs from B/W by less than a certain tolerance. We define the tolerance to be 0.00001. Input The input consists of a number of lines. Each line contains input for one instance of the problem: three positive integers representing the values for B, W, and C, as described above. The input is terminated with a line where B = W = C = 0. Output Print one line of output for each instance. Each line of output will contain one positive integer: the smallest number of iterations required such that the blacktowhite paint ratio in each of the two pails differs from B/W by less than the tolerance value. Sample Input 2 1 1 2 1 4 3 20 7 0 0 0 Sample Output 145 38 66
Refrigerator Magnets _course
20171024问题描述 : Like many families with small children, my family’s refrigerator is adorned with a set of alphabet magnets: 26 separate magnets, each containing one letter of the alphabet. These magnets can be rearranged to create words and phrases. I feel it is my parental duty to use these magnets to create messages that are witty and insightful, yet at the same time caring and supportive. Unfortunately, I am somewhat hindered in this task by the fact that I can only make phrases that use each letter once. For example, a nice inspiring message to leave for the children might be, “I LOVE YOU.” Unfortunately, I cannot make this message using my magnets because it requires two letter "O"s. I can, however, make the message, “I LOVE MUSTARD.” Admittedly this message isn’t as meaningful, but it does manage to not use any letters more than once. You are to write a program that will look at a list of possible phrases and report which phrases can be written using refrigerator magnets. 输入: The input will consist of one or more lines, ending with a line that contains only the word “END”. Each line will be 60 characters or less, and will consist of one or more words separated by a single space each, with words using only uppercase letters (A�1�7CZ). There will not be any leading or trailing whitespace, and there will not be any blank lines. 输出: The input will consist of one or more lines, ending with a line that contains only the word “END”. Each line will be 60 characters or less, and will consist of one or more words separated by a single space each, with words using only uppercase letters (A�1�7CZ). There will not be any leading or trailing whitespace, and there will not be any blank lines. 样例输入: I LOVE YOU I LOVE MUSTARD HAPPY BIRTHDAY GLAD U BORN SMILE IMAGINE WHATS UP DOC HAVE A NICE DAY END 样例输出: I LOVE MUSTARD GLAD U BORN SMILE WHATS UP DOC
Exchange Rates _course
20170914Problem Description Now that the Loonie is hovering about par with the Greenback, you have decided to use your $1000 entrance scholarship to engage in currency speculation. So you gaze into a crystal ball which predicts the closing exchange rate between Canadian and U.S. dollars for each of the next several days. On any given day, you can switch all of your money from Canadian to U.S. dollars, or vice versa, at the prevailing exchange rate, less a 3% commission, less any fraction of a cent. Assuming your crystal ball is correct, what's the maximum amount of money you can have, in Canadian dollars, when you're done? Input The input contains a number of test cases, followed by a line containing 0. Each test case begins with 0 <d ≤ 365, the number of days that your crystal ball can predict. d lines follow, giving the price of a U.S. dollar in Canadian dollars, as a real number. Output For each test case, output a line giving the maximum amount of money, in Canadian dollars and cents, that it is possible to have at the end of the last prediction, assuming you may exchange money on any subset of the predicted days, in order. Sample Input 3 1.0500 0.9300 0.9900 2 1.0500 1.1000 0 Sample Output 1001.60 1000.00
Volume _course
20171209Problem Description This time your job is to calculate the volume of a special object. The object consists of two orthogonal cylinders. The two cylinders intersect each other in the middle place. One example is shown in Fig. 1. The radiuses of the bottom disk of both cylinders are R, and the heights of both cylinders are H. ![](http://acm.hdu.edu.cn/data/images/C31110091.jpg) Input We test the problem in many cases. Each case includes two integers, the first one is R and the second one is H. All the numbers given are positive integers and are less than 100. Output The output consists of the volumes. The results must be round to 4 decimal numbers. Remember that R may be less than half of H. Sample Input 10 30 10 40 Sample Output 13516.2226 19799.4079
 5.30MB
滴滴萌猫跳一跳辅助(安卓))
20201020按提示开无障碍服务，给悬浮窗权限，然后打开跳一跳游戏，打开软件，切回游戏画面，拖动顶部栏往下让软件的半透明区域把猫覆盖完，可以点击右上角数字修改为1.6。使用方法:从猫的位置按住往第二个方块上滑动，松
软件测试2小时入门
20181010本课程内容系统、全面、简洁、通俗易懂，通过2个多小时的介绍，让大家对软件测试有个系统的理解和认识，具备基本的软件测试理论基础。 主要内容分为5个部分： 1 软件测试概述，了解测试是什么、测试的对象、原则、流程、方法、模型； 2.常用的黑盒测试用例设计方法及示例演示； 3 常用白盒测试用例设计方法及示例演示； 4.自动化测试优缺点、使用范围及示例‘； 5.测试经验谈。
C语言及程序设计初步
20150105课程针对没有任何程序设计基础的初学者，全面介绍C语言及利用C语言进行程序设计的方法。课程注重知识的传授，更关注学习者能够通过实践的方式，真正学会利用C语言解决问题，奠定程序设计的基础。为此，专门设计了实践方案，指导学习者在听讲的同时，有效完成实践。讲课中还适时穿插进行学习指导，帮助初学者尽快掌握程序设计的学习方法。
 9.61MB
UniBeast 7.1.zip
20190809用于制作mac os Sierra 10.12 启动u盘，在普通电脑上安装。
 2KB
中信银行计算机类笔试
20120412中信银行计算机类笔试题75道单项选择题，需要的同学何以参考一下，希望能帮到你
 42KB
81个Python爬虫源代码
2018121381个Python爬虫源代码，内容包含新闻、视频、中介、招聘、图片资源等网站的爬虫资源
 下载 汽车雷达传感器组网技术研究
 博客 .flo文件转png文件 Optical flow file (.flo) to picture (.png)
 学院 3天计算机视觉精进训练营
 下载 C#  RestSharp实现短信验证码注册登录完整示例
 博客 关于Room数据库，拼写模糊查找语句遇到的问题
 下载 安卓程序签名.zip
 学院 Android Jetpack架构组件及MVVM架构
 下载 Flex通过JS获取客户端IP和计算机名的实例代码
 学院 Java微信小程序校园图书商城 大学生毕业设计教学视频
 下载 车身控制模块设计要求及解决方案
 博客 水杨酸祛痘，如何度过爆痘期？哪些人不适合使用水杨酸？
 博客 html/css水平垂直居中问题方法总结
 下载 开关变压器第二讲 秒伏容量和线圈匝数的计算
 学院 spark大数据分析与实战之kafka
 学院 php面试精讲
 博客 uniapp app端使用html2canvas和renderjs实现生成海报图
 学院 20年设计模式教程/head first/java面试题/idea/s
 下载 FIRST机器人竞赛的参赛方与美国国家仪器公司合作，用CompactRIO和LabVIEW开发下一代机器人控制系统
 学院 JavaWeb手机数码购物商城毕业设计 大学生毕业设计教学视频
 学院 Web全栈之成为编程小牛的十八般武艺秘籍
 下载 JQuery操作iframe父页面与子页面的元素与方法(实例讲解)
 博客 Spring Cloud教程 第一弹 Eureka
 博客 天河安装CESM2.1.3
 博客 爬虫验证码的几种处理方式，已封装成类，文章末尾有源码！
 学院 多元线性回归模型的参数与统计量深度解读基于Python编程复现
 博客 在Vue Vite应用程序中实现暗/亮模式
 学院 基于海思3536平台为示例的嵌入式软件开发基础篇
 下载 以数字方式管理电源的简便方法
 学院 视觉应用工程师第32期
 博客 spring bean的理解