Find 2^N modulo 5
CodeChefOpen on judge ↗
For each test-case, print 2N modulo 5. Note: 2N can exceed limits of primitive data types. Input First line of input contains a single integer, T, number of test-cases. Next T lines of input contain a single integer, N. Output For each test-case, print 2N modulo 5 on a new line. Constraints 0 T N Sample Input 2 8 10 Sample Output 1 4 Explanation 28 modulo 5 = 256 modulo 5 = 1 210 modu
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