How to solve this problem?

Правка en2, от naevis, 2019-03-26 04:29:32

https://codeforces.net/gym/101911/problem/C . For each number in the array, I will merge each number from the array until it can't be merged, and then for each number in the array after it merged, I will multiply and then search for the number in the array, if it not found and the number is bigger than the maximum value on the array, then it will be no answer, I got wrong answer..

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский naevis 2019-03-26 04:29:32 61
en1 Английский naevis 2019-03-26 04:25:03 348 Initial revision (published)