Pro.ID22681 TitleBroken line Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22681 AC12 Submit12 Ratio100.00% 时间&空间限制描述There are K line
segments on a plane. These are all segments of a broken line, in arbitrary
order. Write a program to check whether the broken line is closed. 输入Input has with (4*K+1) lines, each of them consists of
no more then 250 characters. The first line of the file contains the number of
segments K (1 <= K <= 3000).
Each segment is described by the coordinates X’, Y’, X’’,
and Y’’ of its end-points. All coordinates are non-negatives integers
and written in separate lines (so, the coordinates of one segment are in four
sequential lines). 输出Description There are K line
segments on a plane. These are all segments of a broken line, in arbitrary
order. Write a program to check whether the broken line is closed. Input Input has with (4*K+1) lines, each of them consists of
no more then 250 characters. The first line of the file contains the number of
segments K (1 <= K <= 3000).
Each segment is described by the coordinates X’, Y’, X’’,
and Y’’ of its end-points. All coordinates are non-negatives integers
and written in separate lines (so, the coordinates of one segment are in four
sequential lines). Output The first and only line of
the output must contain the number 1 if the broken line is closed, and 0
otherwise. Sample Input 3
0
0
0
1
1
0
0
0
1
0
0
1 Sample Output 1 Source 样例输入3
0
0
0
1
1
0
0
0
1
0
0
1 样例输出1 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-5 17:47 , Processed in 0.038740 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
