Submission #51875538

---

Source Code Expand

import math

def popcount(N):
    ans = 0
    while N >= 1:
        if N % 2 == 1:
            ans += 1
        N = (N - (N % 2)) // 2
    return ans

#S = input()
#N = int(input())
a, b, C = map(int, input().split())
_C = C
c = 0
dc = []
fi = 0
count = 0

i = 0

while _C >= 1:
    c += _C % 2
    dc.append(_C % 2)
    _C = (_C - (_C % 2)) // 2
    i += 1

d = ((a + b) - c) // 2
    

ldc = len(dc)

for i in range(ldc):
    _dc = dc[i]
    if _dc == 1 and count < a - d:
        fi += 2 ** i
        count += 1

#print(ldc)

#print(''.join(map(str, dc)))
if ((a + b) - c) % 2 == 0 and abs(a - b) <= c and d >= 0:
    ans = 0
    i = 0
    while not d == 0:
        if i < ldc:
            if dc[i] == 0:
                ans += (2 ** i)
                d -= 1
        else:
            ans += 2 ** i
            d -= 1
        i += 1
    if C == 0:
        if ans < 2 ** 60:
            print(ans, ans)
        else:
            print(-1)
    else:
        #print(ans, fi)
        if (ans + fi) < 2 ** 60 and ans + C - fi < 2 ** 60:
            #print(popcount(ans))
            
            #print(popcount(ans + fi))

            #print(popcount(ans + C - fi))
            
            
            
            print(ans + fi, ans + C - fi)
        else:
            print(-1)
    
else:
    print(-1)

Submission Info

Judge Result