Division
CodeChefOpen on judge ↗
Write a program which calculates the quotient and the remainder of the division of two integers. Recall that the quotient and the remainder of the division of an integer X by a non-zero integer Y are respectively the only integers q and r such that - 0 ≤ r - X = Y × q + r In case you don't know it, the theorem that guarantees the existence and the uniqueness of the integers q and r is known as
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