Cube Modulo

CodeChefOpen on judge ↗

Given three integers A, B and P, find the number of roots of the equation x3 = 1 mod P in the interval [A,B], endpoints inclusive.INPUT First line contains T, number of test cases. Then T lines follow Each testcase is described by three space-separated integers in a single line, A B and P.OUTPUT For each testcase, output a single line containing the answer to the given problem.CONSTRAINTS 1≤T≤100

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