TheScrasse, is it an error?

Problem I — 1900!

Thanks

Unordered map is constant time right, why is that giving TLE

Is it because the constant is higher for the test case. Clarify if you can why this code gave TLE 263947136

Consider an array of numbers $$$a_{1}, a_2, ..., a_n$$$.

Let $$$g$$$ be the greatest common divisor (gcd) of all these numbers.

Since every number is a multiple of $$$g$$$, we can express each number as follows:

$$$a_1 = g * k_1$$$

$$$a_2 = g * k_2$$$

...

$$$a_n = g * k_n$$$

where $$$k_1, k_2, ..., k_n$$$ are positive integers.

The sum of these numbers is:

$$$a_1 + a_2 + ... + a_n = g * (k_1 + k_2 + ... + k_n) = x$$$

Therefore, $$$g$$$ should be a factor of $$$x$$$.

And here all $$$k_i$$$'s are positive integers so $$$\sum k_i \geq n$$$ hence we have to find smallest factor of $$$x$$$ that is greater that or equal to $$$n$$$ ,say $$$f$$$

Then $$$x/f$$$ is our required $$$g$$$