##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/2117.html

# 2117. Abbreviating the Product of a Range

• Difficulty: Hard.
• Related Topics: Math.
• Similar Questions: Factorial Trailing Zeroes, Maximum Trailing Zeros in a Cornered Path.

## Problem

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 zeros in 546.

Denote the remaining number of digits in the product as d. If d > 10, then express the product as <pre>...<suf> where <pre> denotes the first 5 digits of the product, and <suf> denotes the last 5 digits of the product after removing all trailing zeros. If d <= 10, we keep it unchanged.

• For example, we express 1234567654321 as 12345...54321, but 1234567 is represented as 1234567.

Finally, represent the product as a string "<pre>...<suf>eC".

• For example, 12345678987600000 will be represented as "12345...89876e5".

Return a string denoting the **abbreviated product of all integers in the inclusive range** [left, right].

Example 1:

Input: left = 1, right = 4
Output: "24e0"
Explanation: The product is 1 × 2 × 3 × 4 = 24.
There are no trailing zeros, so 24 remains the same. The abbreviation will end with "e0".
Since the number of digits is 2, which is less than 10, we do not have to abbreviate it further.
Thus, the final representation is "24e0".


Example 2:

Input: left = 2, right = 11
Output: "399168e2"
Explanation: The product is 39916800.
There are 2 trailing zeros, which we remove to get 399168. The abbreviation will end with "e2".
The number of digits after removing the trailing zeros is 6, so we do not abbreviate it further.
Hence, the abbreviated product is "399168e2".


Example 3:

Input: left = 371, right = 375
Output: "7219856259e3"
Explanation: The product is 7219856259000.


Constraints:

• 1 <= left <= right <= 104

## Solution

• class Solution {
public String abbreviateProduct(int left, int right) {
long threshold0 = 100_000_000_000_000L;
long threshold1 = 10_000_000_000L;
long threshold2 = 100_000;
long curr = 1;
int i;
int zerosCount = 0;
for (i = left; i <= right && curr < threshold0; i++) {
curr *= i;
while (curr % 10 == 0) {
curr /= 10;
zerosCount++;
}
}
if (curr < threshold1) {
return String.format("%de%d", curr, zerosCount);
}

long low = curr % threshold1;
double high = curr;
while (high > threshold1) {
high /= 10;
}

for (; i <= right; i++) {
low *= i;
high *= i;
while (low % 10 == 0) {
low /= 10;
zerosCount++;
}
if (low >= threshold1) {
low %= threshold1;
}
while (high > threshold1) {
high /= 10;
}
}

while (high >= threshold2) {
high /= 10;
}
low %= threshold2;
return String.format("%d...%05de%d", (int) high, low, zerosCount);
}
}

• # 2117. Abbreviating the Product of a Range
# https://leetcode.com/problems/abbreviating-the-product-of-a-range

class Solution:
def abbreviateProduct(self, left: int, right: int) -> str:
prefixM, suffixM = 10 ** 12, 10 ** 10
prefix = suffix = 1
needSplit = False
trailing = 0

for x in range(left, right + 1):
prefix *= x

while prefix > prefixM:
prefix //= 10

suffix *= x

while suffix % 10 == 0:
suffix //= 10
trailing += 1

if suffix >= suffixM:
suffix %= suffixM
needSplit = True

if not needSplit:
return f"{suffix}e{trailing}"

return f"{str(prefix)[:5]}...{str(suffix)[-5:]}e{trailing}"


• class Solution {
public:
string abbreviateProduct(int left, int right) {
int cnt2 = 0, cnt5 = 0;
for (int i = left; i <= right; ++i) {
int x = i;
for (; x % 2 == 0; x /= 2) {
++cnt2;
}
for (; x % 5 == 0; x /= 5) {
++cnt5;
}
}
int c = min(cnt2, cnt5);
cnt2 = cnt5 = c;
long long suf = 1;
long double pre = 1;
bool gt = false;
for (int i = left; i <= right; ++i) {
for (suf *= i; cnt2 && suf % 2 == 0; suf /= 2) {
--cnt2;
}
for (; cnt5 && suf % 5 == 0; suf /= 5) {
--cnt5;
}
if (suf >= 1e10) {
gt = true;
suf %= (long long) 1e10;
}
for (pre *= i; pre > 1e5; pre /= 10) {
}
}
if (gt) {
char buf[10];
snprintf(buf, sizeof(buf), "%0*lld", 5, suf % (int) 1e5);
}
}
};

• func abbreviateProduct(left int, right int) string {
cnt2, cnt5 := 0, 0
for i := left; i <= right; i++ {
x := i
for x%2 == 0 {
cnt2++
x /= 2
}
for x%5 == 0 {
cnt5++
x /= 5
}
}
c := int(math.Min(float64(cnt2), float64(cnt5)))
cnt2 = c
cnt5 = c
suf := int64(1)
pre := float64(1)
gt := false
for i := left; i <= right; i++ {
for suf *= int64(i); cnt2 > 0 && suf%2 == 0; {
cnt2--
suf /= int64(2)
}
for cnt5 > 0 && suf%5 == 0 {
cnt5--
suf /= int64(5)
}
if float64(suf) >= 1e10 {
gt = true
suf %= int64(1e10)
}
for pre *= float64(i); pre > 1e5; {
pre /= 10
}
}
if gt {
return fmt.Sprintf("%05d...%05de%d", int(pre), int(suf)%int(1e5), c)
}
return fmt.Sprintf("%de%d", suf, c)
}


Explain:

nope.

Complexity:

• Time complexity : O(n).
• Space complexity : O(n).