In the recently concluded codeforces round 714 I tried problem D. My idea was start from the lowest elements move left and right . Mark the number which are part of a certain min number in vis array and then mark their gcd/min number. And then in the end traverse the visited array and add up the values. But I am getting WA in test 3. Please help ?

My submission:112970075

I did this question . Instead of using set to sort dishes. I tried sorting the dishes based on their value and binary search the first compatible value but it seems to be giving an error i am not able to figure out. pls help.

My submission Link

I solved this question 1461D using a brute force method to find all valid sums in the array but one of my submission which seems correct to me doesnt seem to be working while another submission which is quite similar but just involves splitting and using it in a new vector gives a correct answer. Please help ?