Clarifications

Problem A · 2014-11-27 18:54:45

We need more test cases for Problem A.
Would you help us with that?
Thanks in advance
Answer: Input:
1
5
He-a

Output:
HeaeH

Problem J · 2014-11-27 18:50:25

When do cables cross each other?
Answer: If there is a cable from i to j and there is a cable from x to y and (i-x)*(j-y) < 0

Problem E · 2014-11-27 18:17:33

What is the answer for n=0?
Answer: N > 0. The problem statement is corrected.

Problem E · 2014-11-27 17:28:11

what is the answer for n=1?
Answer: Edoce:1, Rahs:1

Problem C · 2014-11-27 17:21:59

Is it possible that all routers are boundary routers?
Answer: No

General · 2014-11-27 17:11:52

MOSABEGHE TA SAAT CHANDE ?
Answer: The contest will be finished at 19:30:00

Problem L · 2014-11-27 17:06:52

what is the max value of M?
Answer: 1 <= M <= 50
The problem statement updated

Problem F · 2014-11-27 16:53:23

Please provide one more test!
Answer: Input:
1
3 5

Output:
3.110

Problem C · 2014-11-27 16:33:50

No computer can be connected to the boundary routers.
Answer: No computer can be connected to the boundary routers.

Problem J · 2014-11-27 16:17:49

age K sefr bashe bayad endl ezafe chap konim ya na ?
Answer: In that case, the list of the cables are empty. So you should print an empty line for that.

Problem A · 2014-11-27 15:41:45

can you give an example of reversing the direction ?
Answer: Input:
1
5
He-a

Output:
HeaeH

Problem E · 2014-11-27 15:27:51

Can N be equal to 0? If yes what should the output be?
Answer: No!
N is greater than zero! Problem statement updated.
0 < N < 100000

Problem C · 2014-11-27 14:52:23

Packet ha az router 1 shoru be pakhsh shodan mikonan ya az router haye gheyre boundary ?
Answer: Packets are transmitted from clients' computers, which can be connected to any router except the boundary routers.