OJ Board

If you don't know the reason of getting wrong answer.
1. Given strings can be empty.
2. Same longest common sequences can be found twice, in which case you should print that only once.

Input Output

Nice problem with ugly dataset. You need extra spaces in two aspects to avoid PE.
1.Print an extra space after the string "no concurrent events."
2.Print an extra space after each pair of concurrent events (both one pair and two pairs)

N will not exceed 5000.
Can be solved by 0-1 Knapsack/Coin Change/Backtrack.
Any correct output is acceptable. My output for the sample was

1.Though the problem says input would be like
time1 time2 appointment
But it's strange that it may contain no appointment at all, which means an empty string.

2.The first appointment may start after 10:00, which means there's a slot for nap even before the very first appointment.

3.Same as point ...

Input

3
root
2super
rootrootrootroot
1
0#
4
admin
bdmin
11
22
2
#0
0#0
5
1E
2D
5A
3B
4C
1
0#00


Output

--
0root
02super
0rootrootrootroot
1root
12super
1rootrootrootroot
2root
22super
2rootrootrootroot
3root
32super
3rootrootrootroot
4root
42super
4rootrootrootroot
5root
52super ...

AC