← All problemsSign in

2117. Abbreviating the Product of a Range

LeetCodeMathNumber TheoryOpen on judge ↗

You are given two positive integers left and right with left <= right. Calculate the product of all integers in the inclusive range [left, right]. Since the product may be very large, you will abbreviate it following these steps: - Count all trailing zeros in the product and remove them. Let us denote this count as C. - For example, there are 3 trailing zeros in 1000, and there are 0 trailing

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

Sign in to chat with the tutor and save your progress.

Sign in to start