英語翻譯一道題目
After a success of the previous Vasechkin’s program that allowed to calculate the results of the elections in cause of two days Artemy Sidorovich was placed at the head of the department. At the moment Artemy Sidorovich prepares a task for his subordinate — programmer Petechkin. The task is to write a very useful function that would ease the life of all the department programmers. For each integer from 0 to M the function would calculate how many times this number appears in the N-element array. Artemy Sidorovich deems that the function should work as follows (the sample code for N=3, M=1):
Artemy Sidorovich wants to estimate the time that Petechkin will need to execute the task. We know that Petechkin needs one second to write a line of the code (he’s fast, isn’t he?). Artemy Sidorovich doesn’t know exactly bounds for M and N. Your task is to write program that would calculate a number of seconds that Petechkin will write the code.
Input
contains 2 nonnegative integers — N (N
上面那題不用翻譯了?。。。。。?br/>翻譯下面那題……
Once an ACM programmer was driving along a highway. The road was very smooth and straight, no pits, no bumps, no turns miles and miles forward. In short, boring! So the programmer decided to view billboards along the highway. One billboard was so interesting that the programmer wanted to examine it properly. But without a computer he found it difficult to determine the point with the maximal viewing angle.
Input
We regard the billboard as a segment on a plane and assume that the road is represented by the abscissa axis. The four lines of the input file contain numbers x1, y1, x2, y2, which are the coordinates of the billboard's edges. The numbers are integers in the range from −1000 to 1000. Billboard's edges are not coincide.
Output
You should output the value (in radians) of the best viewing angle of the billboard from the road within 6 digits after the decimal point.
http://acm.timus.ru/problem.aspx?space=1&num