Exponentiation Commutativity
For a given prime number p find the number of all pairs (m, n) of positive integers such that 1 and p divides nm - mn. Output the result modulo 1000000007. Input The first line contains a single positive integer T , the number of test cases. T test cases follow. The only line of each test case contains a prime number p , where 2 12. Output For each test case, output a single line containing th
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