A Simple Sum

CodeChefOpen on judge ↗

Given three integers x, m and n. Evaluate (1 + x + x 2 + .. + x m) (mod n) Input First line of the input contains a single integer T representing number of test cases that follow. For next T lines, each line contains three space separated integers x, m and n. Output Output exactly T lines each containing the answer to the corresponding test case. Constraints - 1 ≤ T ≤ 1000 - 1 ≤ x, n, m ≤

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