Exam Time
CodeChefOpen on judge ↗
In an examination of $N$ papers a candidate has to pass in more papers than the number of papers in which he fails in order to be successful. Find the number of ways in which the candidate can be successful modulo 1000000007 ($10^9 + 7$). ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single ODD Integer, $N$. ##
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.
Sign in to chat with the tutor and save your progress.
Sign in to start