Consider the problem without this condition one cannot choose a pile that has been chosen in the previous turn, it's the famous parity problem, but with considering that condition there would be one trick: If there be a pile such that its stones be more than all other stones then player 'T' can choose it at first and never exit from that pile.

Example:

1 — 2 — 3 — 10

10 > 1 + 2 + 3 So 'T' can choose 10 at first and win

Look at my short solution for problem D:

n = int(input())
a = sorted(list(map(int, input().split())))
if 2 * a[-1] > sum(a):
    print('T')
else:
    print('T' if sum(a) % 2 else 'HL')

Thankyou for your great help. I

was wrong on computing the components.

I fixed my code with changing my last loop:

for (int i = 0; i < 2000; i++) {
        int root = dsu.Find(i);
        if (root != i && c[root]) {
            c[root] = false;
            ans++;
        }
    }

The main idea is executing Find function for every unchecked element for path compression.

Oh my silly mistake! I must range 1 to 100 using range(1,101) instead of range(1,100)

Can anyone help me by this error please?

Very fine and good statements. Thank you for these nice problems, but I had some problems with pretests on problems B and C -specially.

And how about the challegne of problem F? Can anyone guide me?

Has any one solved the problem E like the tutorial? Please post your code.