1. The fight back to school
John unintentionally for school, is always the idea of playing skipping classes, he was sure he absolutely can pass the final exam, but the teacher didn't believe him, so the teacher set a rule, the last of the final grade will be composed of grades and test scores, the scores of each accounted for 50%, that is, out of a possible 100 points, the score 50 points, test scores 50 points, but the teacher in order not to let the students skip classes, grades will be determined by the attendance, only once every call to a 10-point skipping classes will grades,
John is very dissatisfied with the teacher the idea, determined to skip class, he has enough confidence and strength get full marks in the final -- and the rest is just see the grades, as long as he keep score in grades & gt;=10 points, he can be qualified this term, he even fully investigated teachers naming habits, found the following pattern:
Each semester of this course (K class K<=20), and to one lesson the teacher points not naming is an isolated event, and the teacher is in a class named probability p (0.0 & lt;=p<=1.0), and now fish_ball'd like to skip class, as much as possible but make sure he has more than 90% probability don't hang up, this course asks fish_ball can skip at most how many classes this semester?
Input specification:
The first line is an integer C, C<=20, followed by group C data, each group of data contains a line, in turn, given integer K (1 & lt;=K<=20) and p (0.0 & lt;=p<=1.0), as described in the title,
Output specifications:
For each set of data, the output an integer, said John can skip a few class this semester,
2. Catch bus
Alfred district school in the university, he downtown every week to learn piano, so to get to shop before 10 o 'clock every Saturday in class, from chong take bus 68 to the shop to take a full hour, and 68 bus is every half hour to hour and 30 minutes when a bus and
This time, Alfred got up late, a look at the table has been more than eight points, cleared up in a hurry, Alfred immediately rushed to the bus station, however, due to the poor road conditions, in the previous section of the road is full of mud, road conditions are as follows:
Pictured above, A (xA, yA) is Alfred's position now, B (xB, yB) is the Bus station (Bus stop), including y> Area 0 is muddy ground, Alfred on the muddy ground movement speed is v1 (m/s), and the y<0 area is concrete, Alfred on the concrete movement speed only v2 (m/s), in which v1 & lt; In the second quadrant=v2, A, B in the fourth quadrant,
Alfred is a school student, he reflected, estimate the rest of the time is running out, he looked at his watch, now only have T seconds left before 9 o 'clock (T given by the title), Alfred want to know, if use optimal strategies he raced to the bus station, today's lesson will be late,
Input specification:
The first line is an integer C, C<=10, followed by group C data, each group of data, in turn, given the xA, xB, yA, yB, v1, v2 and T and their significance as mentioned above, the x, y coordinates of the unit is m, the absolute value of all coordinates & lt; In 109, T is an integer,
Output specifications:
For each set of data, the output YES or NO, said Alfred would not to be late,
3. 1000 tons of goods, 3 car of shipment at the same time, the cart is 5 tons, a trip to 2 hours back and forth, the car is 3 tons, 1.8 hours round (decimal), with 2 tons of cars, a trip to 1.6 hours (decimal) back and forth, and regulation: if there are more vehicles arrive at the same time, loading priority is: in the cart or car or the car, not loading time, ask: (1) the last bus is the car? (2) large, medium, small car each how many trips?
Second, the essay questions (1 item in this topic, each item 20 points, a total of 20 points)
With the application of the digital library, focuses on technology, improve the performance of Web server
[tip]
In circulation in the digital library information system, mostly in the form of digital index of the abstract, the full text, image or audio, video and other multimedia information on the Web server performance have higher requirements, so a large and medium-sized library information system involves many aspects of technologies and solutions,
Some content of related to the Web server performance is discussed in this paper, from a hardware implementation method (cache server, balanced load equipment, Web image of two, CPU and network CARDS, network bandwidth expansion) and the software realization method (three layers of C/S software structure design, application deployment) two big aspects such as how to improve the performance of Web server, so that users can more quickly, efficiently and safely use application system,
Please, master of programming to help solve it!
CodePudding user response:
Find a demon elder brother, don't fail
http://my.csdn.net/ccrun/message
CodePudding user response:
game algorithm?CodePudding user response:
Demon elder brother is a great god?CodePudding user response:
Who knows the answer? Please answer, please don't hang,