Code: Select all
Sample Input:
1
5 3
...
Z..
Z..
Z.B
..A
Sample Output:
Minimal possible length of a trip is 1
Code: Select all
Sample Input:
1
5 3
...
Z..
Z..
Z.B
..A
Sample Output:
Minimal possible length of a trip is 1
Code: Select all
Sample Input:
1
8 10
Ac output:
No jumping champion
Code: Select all
1
E
AB
Code: Select all
so the graph is
A -> B
C
D
E
Code: Select all
3
6
5
4
1
111
Code: Select all
2
Hey good lawyer
as I previously previewed
yam does a soup(and 4 space)
Code: Select all
scan test case
enter
enter
scan input and print output ( input is terminated when input is only a new line )
scan input and print output ( input is terminated when input is only a new line )
.......
.......
Code: Select all
EE
E