[problem:479A]↵
Currently this is for 3 numbers and one can easily come up with some bruteforce solution like I did here [submission:370459644] but what if there were n numbers $1 \leq n \leq 10^95$↵
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.
Currently this is for 3 numbers and one can easily come up with some bruteforce solution like I did here [submission:370459644] but what if there were n numbers $1 \leq n \leq 10^
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.
