A power B mod C
You are given an integer $A \ (2 \leq A \leq 10^{9})$. Find two integers $B$ and $C$ such that: - $2 \leq A \lt B \lt C \leq 10^{18}$; - $A^{B}$ $\%$ $C = 0;$ - $B^{C}$ $\%$ $A = 0$ It can be proved that at least one solution exists. If multiple solutions exist, print any. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case
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