Kimi No Na Wa

CodeChefOpen on judge ↗

In Turing Hut there are $T$ members and every member has a Nickname, If the name of a member has $N$ characters and if $N$ is odd then the Nickname is a combination of $0^{th},$ $(N/2)^{th},$ $(N-1)^{th}$ characters else if $N$ is even then its a combination of $0^{th},$ $(N/2 - 1)^{th},$ $(N/2)^{th},$ $(N-1)^{th}$ characters. But it is possible that multiple people get the same Nickname so your

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI