|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
We are given a convex polygon P of n sides (where 3 < n ≤ 5,000) and k its distinct diagonals not crossing one another inside the polygon. (The only point that two distinct diagonals may share is a vertex of the polygon.) Vertices of the polygon are numbered successively from 1 to n counterclockwise. All the diagonals divide P into smaller convex polygons whose interiors do not intersect.
Four diagonals: 1-8, 8-3, 3-1 and 3-6 divide the polygon P shown in the picture below into two quadrilaterals and three triangles.
Write a program that:
In each line of the standard input two positive integers separated by a single space are written.
In the first line there is the number of vertices n of the polygon and the number of diagonals k.
In each of the following k lines there is a description of one diagonal of the polygon in the form of a pair of positive integers. These integers are the numbers of the vertices of the polygon the diagonal joins. Just after the second number there is the end of the line.
The data in the standard input are written correctly and your program need not verify that.
In the standard output one should write one positive integer - the maximal number of sides of a convex polygon created by the division of the given polygon P.
9 4 1 8 8 3 3 1 3 6