← All problemsSign in

The Last Supper

Problem Definition : Keep your friends close, enemies closer. Your enemies are by your side. The one remaining at the round table in the end is the one who wins Input : - First Line contains Number of Test Cases: T. - Each test case is a single number N. Output : For each test case print a single integer. Constraints : - 1 ≤ T ≤ 103 - 1 ≤ N ≤ 103 Example Input : 2 3 41 Exam

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

Sign in to chat with the tutor and save your progress.

Sign in to start