![]() |
||||||||||
|
||||||||||
Light and ShadowTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 870 Accepted Submission(s): 249 Problem Description ![]() A nuclear explosion happened and how many sticks on the ground will be illuminated by the radiation? You can assume that the ground is flat, and no radiation can go through the sticks, and any two sticks have no intersections. To simplify the problem, no two endpoints located on the path of a single radiation. Input For each case, the first line contains the number of sticks n(1~10,000), until the end of file. The second line includes (sx, sy) to denote the position of explosion center. Then following n lines are the sticks expressed in (ax, ay) and (bx, by). Output For each case, print the number of sticks which would be illuminated. Sample Input
Sample Output
Source | ||||||||||
|