Sum it!

CodeChefOpen on judge ↗

*This problem doesn't even have a good problem statement. It was prepared today.* You are given an integer $n$. Print two composite integers $a$ and $b$ such that $a+b=n$. ###Input Format - First line will contain $T$, number of test cases. Then the test cases follow. - Each test case contains of a single line of input, one integer $n$. ###Constraints - $1\leq T \leq 1000$ - $1\leq

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