Submission #2798064

---

Source Code Expand

import sys, math
sys.setrecursionlimit(10**8)
mod = 10**9 + 7

R,G,B = map(int,input().split())

R -= 1
G -= 1
B -= 1


def calc(N,max):
	if max < 0:
		N += 1
		max *= -1
		ans = (max+N-1+max)*N//2
	else:
		if N%2 == 0:
			n2 = N//2
			if n2 <= max:
				ans = digit(n2)*2
			else:
				ans = digit(max)
				ans += digit(N-max)
		else:
			n2 = (N-1)//2
			if n2 <= max:
				ans = digit(n2)*2 + n2+1
			else:
				ans = digit(max)
				ans += digit(N-max)
	return ans
	
def digit(N):
	if N < 0:
		return -N*(N+1)//2
	else:
		return N*(N+1)//2
	
finalans = float("inf")

for GL in range(-500,500):
	GR = G - GL
	
	anss = 0
	
	anss += digit(GR) + digit(GL)
	
	B_max = 99 - GR
	R_max = 99 - GL
	
	anss += calc(B,B_max)
	anss += calc(R,R_max)
	
	finalans = min(anss,finalans)
		
		
print (finalans)

Submission Info

Judge Result