Soal 2 pertemuan 25
Soal Eulerian Path dan Cycle
1.
Kerjakan problem D pada BNPC-HS Final 2003 di bawah ini.
Problem D: Drawing
Little Theodore like to draw. After exploring with circular shape objects such as wheels,
planets, lanterns, now he learns to draw straight lines objects such as one in figure 1. With
his adventuring curiosity he made the drawing with each line drawn exactly once and
without lifting the pen from the paper while the drawing is being performed. As shown in
figure 2, the drawing follow the vertices 1425432165
Figure 1
Figure 2
Little Theodore asks your help, for you could do it by writing a program, to list all the
sequences of such drawings, sorted in non decreasing order.
Input
There is no input needed because the drawing is fixed as shown in figure 1.
Output
The output is look like this. The three dots mean the rest of the sequences.
1234254165
1234524165
...