THEFT AT JEWELLERY STORE

CodeChefOpen on judge ↗

In a Jewellery shop, there are $n$ types of ornaments. There are exactly $x$ ornaments of each type. $y$ thieves broke into the shop at night and each of them has taken exactly $z$ ornaments of a single type. A different thief might have taken different types of ornaments. Also, the values of $x$, $y$, $z$ are unknown (to you). The next morning the owner of the shop discovers the loss. He counts

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