Is there a generalization of this problem on cf?

Revision en3, by Osalotioman, 2026-04-09 22:10:46

479A - Expression Currently this is for 3 numbers and one can easily come up with some bruteforce solution like I did here 370459644 but what if there were n numbers $$$1 \leq n \leq 10^5$$$ I'm thinking up a solution for this general case, but the quickest way to verify it might be to make a submission to the general form of the problem if it exists on cf.

Tags need help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Osalotioman 2026-04-09 22:10:46 2 Tiny change: 'n \leq 10^9$\nI'm thi' -> 'n \leq 10^5$\nI'm thi'
en2 English Osalotioman 2026-04-09 21:43:17 0 (published)
en1 English Osalotioman 2026-04-09 21:42:28 415 Initial revision (saved to drafts)