How to solve this problem?

Revision en2, by 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..

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English naevis 2019-03-26 04:29:32 61
en1 English naevis 2019-03-26 04:25:03 348 Initial revision (published)