Count Sum (keteki)

CodeChefOpen on judge ↗

Given a number N, find the number of unique ways in which it can be printed as a sum of two positive integers. Input: Input starts with an integer T, the number of test cases, on a newline. Each test case would contain an integer N on a newline, the given number Output: Print the required value for each test on a newline each. Constraints: 1Example: Input: 2 1 2 Output: 0 1 Explanati

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