Codejam Qualification Round 2022. Task 2 Variant 2
Python Only
def gen_vector(v,s=10**6):
if sum(v) < s:
yield 'IMPOSSIBLE'
else:
for c in range(v[0],1,-1):
m=min([v[1],10**6-c])
y=min([v[2],10**6-c-m])
k=10**6-c-m-y
yield '%d %d %d %d'%(c,m,y,k)
T=int(input())
for t in range(T):
N=[]
for i in range(3):
N.append(list(map(int,input().split())))
v=[min([N[i][j] for i in range(3)])
for j in range(4)]
print('Case #%d: %s'%(t+1,next(gen_vector(v))))
xxxxxxxxxx
def gen_vector(v,s=10**6):
if sum(v)<s:
yield 'IMPOSSIBLE'
else:
for c in range(v[0],1,-1):
m=min([v[1],10**6-c])
y=min([v[2],10**6-c-m])
k=10**6-c-m-y
yield '%d %d %d %d'%(c,m,y,k)
def ddd_printing(
T=slider([1,2,3],default=1),
N1=input_box('300000 200000 300000 500000\n'+\
'1000000 1000000 0 0\n'+\
'768763 148041 178147 984173',
type=str,label='N1',width=30,height=3),
N2=input_box('300000 200000 500000 300000\n'+\
'0 1000000 1000000 1000000\n'+\
'699508 515362 534729 714381',
type=str,label='N2',width=30,height=3),
N3=input_box('300000 500000 300000 200000\n'+\
'999999 999999 999999 999999\n'+\
'949704 625054 946212 951187',
type=str,label='N3',width=30,height=3)):
N1=str(N1).split('\n')
N2=str(N2).split('\n')
N3=str(N3).split('\n')
NN=[[N1[i],N2[i],N3[i]] for i in range(3)]
print('C M Y K:')
[print(el) for el in NN[T-1]+['\n']]
N=[[int(n) for n in NN[T-1][i].split()]
for i in range(3)]
v=[min([N[i][j] for i in range(3)])
for j in range(4)]
gen=gen_vector(v)
print('Case #%d: %s'%(T,next(gen)))