1991C - Absolute Zero - CodeForces Solution


constructive algorithms math

Please click on ads to support us..

Python Code:

n= int(input())
for i in range(n):
    m= int(input())
    l=list(map(int,input().split()))
    ans =[]
    for j in range(40):
        num = (min(l)+max(l))//2
        if num==0:
            break 
        for t in range(m):
            l[t] =abs(l[t]-num)
        ans.append(num)
    if l==[0]*m:
        print(len(ans))
        print(*ans,sep=" ")
    else:
        print(-1)


Comments

Submit
0 Comments
More Questions

620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even
977F - Consecutive Subsequence
939A - Love Triangle
755A - PolandBall and Hypothesis
760B - Frodo and pillows
1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll