英语翻译一道题目After a success of the previous Vasechkin’s program

英语翻译一道题目
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
上面那题不用翻译了！！！！！！
翻译下面那题……
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

从前有个计算机程序员正沿着高速公路行驶.路很平坦而且笔直,没有坑,没有包,没有转弯处,向前延伸到很远很远.一个词,无聊!所以这个程序员决定看看沿路的广告牌.有一个广告牌特别有意思,他就想仔细观察观察它.但他发现没有电脑在身边,它很难决定观看广告牌的最大角度.
输入
我们将广告牌当成一架飞机上的一个部分,而把这条路想象成横坐标轴.输入的四条线包括数字 x1,y1,x2,y2,正好是广告牌的四个边.这些数字是从负1000到正1000的整数.但广告牌的四边于这个条件不符合.
输出
你需要用计算出从路上观测广告牌的最佳角度的弧度,小数点后六位数.
因为数学知识有限,所以很多术语什么意思,就能翻译成这样了,具体的你自己理解一下吧