#P17740. [ICPC 2019 Xuzhou R] Loli, Yen-Jen, and a graph problem
[ICPC 2019 Xuzhou R] Loli, Yen-Jen, and a graph problem
Problem Description
Now, Yen-Jen is solving a problem with a cute catgirl. But he drinks too much yesterday and his mind is not open yet, so he asked you to solve the following problem for him!
There's a vertice complete graph. Please decompose the graph into trails, the trail must contain exactly distinct edges. All edges must be decomposed in exactly one trail.
Input Format
The input contains only one line with one integer , the number of vertices in the complete graph.
Output Format
If there's no way to decompose the graph, output in a single line. Otherwise, output lines, the line is the description of the trail. In the line, output integers represents the trail. The neiboring integers in one line represents the edges.
3
1 2
2 3 1