Play with Prime

CodeChefOpen on judge ↗

Coders of UIT love playing with numbers. Today they are solving an interesting problem, which is a prime number can be split into sum of two squares or not. They are having $N$ such numbers to test. As you are also a coder so you want to solve the question fastest. ###Input: - First line contains count of numbers to test, $N$. - Next $N$ lines contain a single prime number $M$. ###Ou

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