回答 2 已采纳 Problem Description
“Point, point, life of student!”
This is a ballad（歌谣）well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told you the rules which are used in this course.
There are 5 problems in this final exam. And I will give you 100 points if you can solve all 5 problems; of course, it is fairly difficulty for many of you. If you can solve 4 problems, you can also get a high score 95 or 90 (you can get the former(前者) only when your rank is in the first half of all students who solve 4 problems). Analogically（以此类推）, you can get 85、80、75、70、65、60. But you will not pass this exam if you solve nothing problem, and I will mark your score with 50.
Note, only 1 student will get the score 95 when 3 students have solved 4 problems.
I wish you all can pass the exam!
Input contains multiple test cases. Each test case contains an integer N (1<=N<=100, the number of students) in a line first, and then N lines follow. Each line contains P (0<=P<=5 number of problems that have been solved) and T（consumed time）. You can assume that all data are different when 0<p.
A test case starting with a negative integer terminates the input and this test case should not to be processed.
Output the scores of N students in N lines for each case, and there is a blank line after each case.
回答 1 已采纳 he LCD screen of my accutron is damaged. Some part of it does not work any more. So my accutron can not display the time correctly now. When it works well, the digits look like this:
_ _ _ _ _ _ _ _
| | | _| _||_||_ |_ ||_||_|
|_| ||_ _| | _||_| ||_| _|
But now they are fragmentary, like this:
| | | _| _||_||_ |_ ||_||_|
_| | _ _| | _| _| | _| _|
Still, if you are clever enough, you can guess the current time. I can provide you with some of the displays of my accutron, could you please tell me the current time?
The input contains several test cases. Each test case begins with an integer n. The following n lines give n time displayed by my accutron. The last line is the current time displayed by my accutron.
Time is represented by 4 digits, in format hh:mm(0 <= hh < 24). Each digit occupies a 3 * 3 matrix. There is no space between two digits. See sample input below.
For each test case, print the current time in format hh:mm. If there are several possible answers, print the latest one.
Note: you can assume that the input is valid.
_ _ _
| _ |_ | //maybe 12:25
| _||_ | //maybe 15:01
_ _ _ _
|_| _||_ |
回答 1 已采纳 In the game show "The Price is Right", a number of players (typically 4) compete to get on stage by guessing the price of an item. The winner is the person whose guess is the closest one not exceeding the actual price. Because of the popularity of the one-person game show "Who Wants to be a Millionaire", the American Contest Management (ACM) would like to introduce a one-person version of the "The Price is Right". In this version, each contestant is allowed G (1 <= G <= 30) guesses and L (0 <= L <= 30) lifelines. The contestant makes a number of guesses for the actual price. After each guess, the contestant is told whether it is correct, too low, or too high. If the guess is correct, the contestant wins. Otherwise, he uses up a guess. Additionally, if his guess is too high, a lifeline is also lost. The contestant loses when all his guesses are used up or if his guess is too high and he has no lifelines left. All prices are positive integers.
It turns out that for a particular pair of values for G and L, it is possible to obtain a guessing strategy such that if the price is between 1 and N (inclusive) for some N, then the player can guarantee a win. The ACM does not want every contestant to win, so it must ensure that the actual price exceeds N. At the same time, it does not want the game to be too diffcult or there will not be enough winners to attract audience. Thus, it wishes to adjust the values of G and L depending on the actual price. To help them decide the correct values of G and L, the ACM has asked you to solve the following problem. Given G and L, what is the largest value of N such that there is a strategy to win as long as the price is between 1 and N (inclusive)?
The input consists of a number of cases. Each case is specified by one line containing two integers G and L, separated by one space. The end of input is specified by a line in which G = L = 0.
For each case, print a line of the form:
Case c: N
where c is the case number (starting from 1) and N is the number computed.
Case 1: 3
Case 2: 6
Case 3: 847
Case 4: 127
回答 2 已采纳 The calendar now in use evolved from the Romans. Julius Caesar codified a calendar system that came to be known as the Julian calendar. In this system, all months have 31 days, except for April, June, September, and November, which have 30 days, and February, which has 28 days in non-leap years, and 29 days in leap years. Also, in this system, leap years happened every four years. That is because the astronomers of ancient Rome computed the year to be 365.25 days long, so that after every four years, one needed to add an extra day to keep the calendar on track with the seasons. To do this, they added an extra day (February 29) to every year that was a multiple of four.
Every year that is a multiple of 4 is a leap year, i.e. has an extra day (February 29).
In 1582, Pope Gregory's astronomers noticed that the year was not 365.25 days long, but closer to 365.2425. Therefore, the leap year rule would be revised to the following:
Every year that is a multiple of 4 is a leap year, unless it is a multiple of 100 that is not a multiple of 400.
To compensate for how the seasons had shifted against the calendar up until that time, the calendar was actually shifted 10 days: the day following October 4, 1582 was declared to be October 15.
England and its empire (including the United States) didn't switch to the Gregorian calendar system until 1752, when the day following September 2 was declared to be September 14. (The delay was caused by the poor relationship between Henry VIII and the Pope.)
Write a program that converts dates in the United States using a calendar of the time and outputs weekdays.
The input will be a series of positive integers greater than zero, three integers per line, which represent dates, one date per line. The format for a date is ``month day year" where month is a number between 1 (which indicates January) and 12 (which indicates December), day is a number between 1 and 31, and year is positive number.
The output will be the input date and name of the weekday on which the given date falls in the format shown in the sample. An invalid date or nonexistent date for the calendar used in the United States at the time should generate an error message indicating a invalid date. The input will end with three zeroes.
11 15 1997
1 1 2000
7 4 1998
2 11 1732
9 2 1752
9 14 1752
4 33 1997
0 0 0
November 15, 1997 is a Saturday
January 1, 2000 is a Saturday
July 4, 1998 is a Saturday
February 11, 1732 is a Friday
September 2, 1752 is a Wednesday
September 14, 1752 is a Thursday
4/33/1997 is an invalid date.
回答 1 已采纳 A snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. The snail has a fatigue factor of 10%, which means that on each successive day the snail climbs 10% * 3 = 0.3 feet less than it did the previous day. (The distance lost to fatigue is always 10% of the first day's climbing distance.) On what day does the snail leave the well, i.e., what is the first day during which the snail's height exceeds 6 feet? (A day consists of a period of sunlight followed by a period of darkness.) As you can see from the following table, the snail leaves the well during the third day.
Day Initial Height Distance Climbed Height After Climbing Height After Sliding
1 0 3 3 2
2 2 2.7 4.7 3.7
3 3.7 2.4 6.1 -
Your job is to solve this problem in general. Depending on the parameters of the problem, the snail will eventually either leave the well or slide back to the bottom of the well. (In other words, the snail's height will exceed the height of the well or become negative.) You must find out which happens first and on what day.
The input file contains one or more test cases, each on a line by itself. Each line contains four integers H, U, D, and F, separated by a single space. If H = 0 it signals the end of the input; otherwise, all four numbers will be between 1 and 100, inclusive. H is the height of the well in feet, U is the distance in feet that the snail can climb during the day, D is the distance in feet that the snail slides down during the night, and F is the fatigue factor expressed as a percentage. The snail never climbs a negative distance. If the fatigue factor drops the snail's climbing distance below zero, the snail does not climb at all that day. Regardless of how far the snail climbed, it always slides D feet at night.
For each test case, output a line indicating whether the snail succeeded (left the well) or failed (slid back to the bottom) and on what day. Format the output exactly as shown in the example.
6 3 1 10
10 2 1 50
50 5 3 14
50 6 4 1
50 6 3 1
1 1 1 1
0 0 0 0
success on day 3
failure on day 4
failure on day 7
failure on day 68
success on day 20
failure on day 2
回答 1 已采纳 Problem Description
Today is Saturday, 17th Nov,2007. Now, if i tell you a date, can you tell me what day it is ?
There are multiply cases.
One line is one case.
There are three integers, year(0<year<10000), month(0<=month<13), day(0<=day<32).
Output one line.
if the date is illegal, you should output "illegal". Or, you should output what day it is.
2007 11 17
回答 1 已采纳 Problem Description
Lmy is the lovely cousin of zmq, and she’s a junior high school student. One day she came back from school.
Zmq: What did you learn in your class today?
Lmy: Similar triangle.
Zmq: Well, fine, have you mastered it?
Lmy: Sure, that’s a piece of cake.
Zmq: OK, well, let me test you to see whether you have thoroughly understood the conception of being similar. I’ll draw two Arbitrary Polygons, and you have to tell me whether they are similar or not. If you are right, I’ll take you out.
It seems that little lmy got into troubles. Can you help her out by designing a program?
There are several test cases in the input.
The first line of each case is an n (n <= 300), indicating that each polygon has n points. And in the following 2n lines, each line represents a point. The first n point represents the first polygon in anti-clockwise order, and so the second. Please note that all the polygons are simple.
You can try to rotate them, then tell whether they are similar or not.
For each case, output “Yes” or “No”, showing whether they are similar.
回答 3 已采纳 SO_KEEPALIVE：
When the keepalive option is set for a TCP socket and no data has been exchanged across the socket in either direction for 2 hours (NOTE: the actual value is implementation dependent),TCP automatically sends a keepalive probe to the peer. This probe is a TCP segment to which the peer must respond.
One of three responses is expected:
1. The peer responds with the expected ACK. The application is not notified (since everything is OK). TCP will send another probe following another 2 hours of inactivity.
2. The peer responds with an RST, which tells the local TCP that the peer host has crashed and rebooted. The socket is closed.
3. There is no response from the peer. The socket is closed.
The purpose of this option is to detect if the peer host crashes.
Valid only for TCP socket: SocketImpl
从上面一段英文，what is “the peer”？
langb2014的博客 最后这一篇是对于计算卡的理解指导《 A Full Hardware Guide to Deep Learning》 Deep Learning is very computationally intensive, so you will need a fast CPU ... Or is it maybe wasteful to buy a fas
cum44153的博客 linux上查看gpu卡型Fatmawati Achmad Zaenuri/ShutterstockFatmawati Achmad Zaenuri / ShutterstockNeed to identify the Graphics Processing Unit (GPU) in a Linux computer? Here’s how you can identify the ...
yangzqiao的博客 Given the expansive growth in the field, it’s become challenging to discern what belongs in a modern computer science degree. 由于计算机领域的迅速发展，辨别什么是现代计算机科学学位是一项挑战。 My ...
蓝天和白云的博客 深入浅出的介绍了现代GPU的方方面面，从软件到硬件都有。理解了这些对理解新一代图形API大有好处！ 原文 A trip through the Graphics Pipeline 2011: Index A trip through the Graphics Pipeline 2011: Index
weixin_30274627的博客 Given the expansive growth in the field, it's become challenging to discern what belongs in a modern computer science degree. My own faculty is engaging in this debate, so I've coalesced ...
weixin_30583563的博客 The Brain vs Deep Learning Part I: Computational Complexity — Or Why the Singularity Is NowhereNear July 27, 2015July 27, 2015Tim DettmersDeep Learning,NeuroscienceDeep Learning,dendritic spikes...
weixin_26756255的博客 ai芯片fpgaMajor tech companies invest billions in AI chip ... Even Microsoft and Facebook are onboard with Intel FPGA in accelerating their hardware infrastructures. There are a handful of star...
青枫阁的博客 Real-time Terrain Modeling using CPU-GPU CoupledComputation Adrien Bernhardt∗ ... Sketch-based terrain modeling example in our tool: as each stroke is drawn (left) or manipulated (right), the...
Fly20141201的博客 clean - Remove most generated files but keep the config and enough build support to build external modules mrproper - Remove all generated files + config + various backup files distclean - ...
weixin_30369087的博客 在查找VTK设计架构与相关设计模式时，google到一篇介绍VTK的综述，虽然简单，但讲的还是蛮好的。个人觉得值得深入学习的地方都标红了...The Visualization Toolkit (VTK) is a widely used software system for data...
ztguang的博客 amp;px=MTM0OTEWritten by Michael Larabel in Wayland on 11 April 2013 at 01:42 PM EDT. 62 CommentsJolla, the start-up company built around former Nokia ...