A — Captcha
Author: m7a1g5i8k8a1r4p0
Just print the number of circles in the image. There are 7 if you include the circles in i and ?.
B — Right or Wrong?
Author: m7a1g5i8k8a1r4p0
The title implies that you should check if the 3 numbers are "right" or not. You can do this by checking that $$$a$$$, $$$b$$$, and $$$c$$$ form the side lengths of a right triangle, with $$$c$$$ as the hypotenuse.
C — New Sorting Algorithm
Author: ChiMasterBing
You are sorting a permutation, so all you have to do is print out the integers from $$$1$$$ to $$$n$$$, inclusive. The time constraints are very lax for this. Though you should be careful of the memory limit. If you read the second line entirely, you will probably get MLE. If you form a large string and then print it out, you will probably get MLE.
D — Subset Sums
Author: m7a1g5i8k8a1r4p0
Clearly, solving this problem as is is too hard. Is there anything that you are missing here?
Try pressing Ctrl+A to highlight all the text.
If you highlight the space below "Notes," you will see the following equations: 
If you plot these functions in Desmos, you will realize that $$$a$$$ is still a variable. By setting $$$a$$$ to $$$0$$$, $$$1$$$, and $$$2$$$, you will see the equations spell out XOR.
This signifies that the question is actually asking about how many subset XOR sums equal $$$k$$$. This can be done in $$$O(n\log \max{a_i})$$$
E — Gemini
Author: m7a1g5i8k8a1r4p0
Castor and Pollux are the twin stars of the Gemini constellation, but it seems like we can only see Castor...
To solve Castor's problem, all even numbers must be put into separate sets. It can be shown that the required number of sets is always equal to $$$\lfloor\frac{n}{2}\rfloor$$$. You can do this by pairing 1 2, 3 4, 5 6, etc. for even values of $$$n$$$. If $$$n$$$ is odd, you can instead do n-2 n-1 n for the last set.
After submitting, you will receive a verdict of Хороший! Now help solve Pollux's problem! This signifies that you should now look at Castor's partner, Pollux, since he also has a problem to solve. This can be done by switching your language to Russian.
To solve Pollux's problem, just write any sieve to print out the primes up to $$$n$$$.
At this point, you will probably get a verdict of Oops, now Castor is getting a Wrong Answer on his end. This means you should somehow solve both of their problems at the same time. (This is where the weird output format comes into play)
To solve both of their problems, first print out all of the primes in one set to satisfy Pollux's problem. Then, try to complete the original construction from Castor's problem, but skip over any instance where you have already placed a number into the set of primes. Also, place $$$1$$$ into any set other than the first set.
