|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||0||0||0||0.000%|
The country of Oreste consists of exactly 25 cities labeled 'A' to 'Y'. There used to be a city labeled 'Z', but it is abandoned and we will not use it in this problem. Each pair of cities are connected by a road hence there are 300 roads in total. The president of Oreste wants Symeon to plan a patrolling strategy.
There are 100 riders that will cycle their bike to patrol along their planned route each night. To make it happened, the president of Oreste wants to make 100 "Triangle of Safety". "Triangle of Safety" is defined as a set of 3 different cities which has a road connecting each pair of them, i.e. a cycle of 3 cities, which will be a route for a patrolling rider. Obviously, these 100 "Triangle of Safety" must cover all roads.
Can you help Symeon?
The input file will be empty for this problem.
The output contains 100 lines, each contains three distinct characters. The i-th line contains the label of the cities which are inside the i-th "Triangle of Safety". If there are multiple solutions, you may print any of them. You can print the "Triangle of Safety" in any order.
ABC DEF ... (97 lines truncated) WXY
The sample output given above is syntactically correct, but not necessarily correct to satisfy the constraint above.