Competitive Programming600 points
Can you hack* beginner competitive programmer's code for the following problem?
We say strings
B are mirror if
B are mirror if and only if
Decide that strings are mirror or not.
You are given
Solve each of them.
Biconsist of lowercase English letters.
Input is given in the following format:
N n0 A0 B0 n1 A1 B1 : n1 AN-1 BN-1
For each case, output
mirror if they are mirror; output
no if they are not.
3 4 flag galf 4 flag flag 1 a a
mirror no mirror
nc ctfq.u1tramarine.blue 10037
ncat --ssl ctfq.u1tramarine.blue 20037
To end an input and keep reading an output, you have to "half-close" the connection. One way to do so is socat. Example:
$ cat input.txt 3 4 flag galf 4 flag flag 1 a a $ cat input.txt | socat - TCP:ctfq.u1tramarine.blue:10037 Your input: Output: mirror no mirror Your hack was unsuccessful... mirror's output is correct.
Outbound packets are filterd. You cannot use reverse shells.
The flag is /home/q37/flag.txt