Divisors Array (Hard Version)

CodeChefRating 2322Open on judge ↗

**This is the hard version of the problem. The only difference between this version and the easy version is the constraints on $M$ and $A_i$**. --- Chef has received a mathematics assignment that requires array transformations. Given an array $A$ of size $N$ and a positive integer $M$, perform these steps: - First, create array $B$ such that $B_i = A_i \times M!\ ;$ $(M!$ denotes the [factoria

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