Problem:


Score : 100 points

Problem Statement

Given are three integers A_1, A_2, and A_3.

If A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.

Constraints

1 \leq A_i \leq 13 \ \ (i=1,2,3)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A_1 A_2 A_3

Output

If A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.

Sample Input 1

5 7 9

Sample Output 1

win

5+7+9=21, so print win.

Sample Input 2

13 7 2

Sample Output 2

bust

13+7+2=22, so print bust.



Sample input:
5 7 9


Sample output:
win

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
ans=a+b+c
if ans>21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
sum=a+b+c

if sum > 21:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

if(A1+A2+A3) >= 22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
def resolve():
    a, b, c = map(int, input().split())
    if a+b+c >= 22:
        print("bust")
    else:
        print("win")

resolve()

Submission status: Accepted

Solution code:
from sys import stdin
A1,A2,A3 = [int(x) for x in stdin.readline().rstrip().split()]
if A1+A2+A3 >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split(' '))
k = a+b+t
if k>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a1, a2, a3 = map(int, input().split())
if a1 + a2 + a3 > 21:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))

ans = 0
for a in A:
    ans += a

if ans >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a1,a2,a3 = map(int, input().split())  

if (a1+a2+a3>=22):
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a=sum(list(map(int,input().split())))
print('win' if a<=21 else 'bust')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a+b+c) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a1,a2,a3=map(int,input().split())
if a1+a2+a3>=22:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
a = map(int,input().split())
if sum(a) >=22:
    print("bust")
    exit(0)
print("win")

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if a[0]+a[1]+a[2]>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a+b+c > 21:
	print("bust")
else:
	print("win")

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
#n = int(input())
if x+y+z >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

s = sum((A, B, C))

if s >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("bust") if A+B+C >= 22  else print("win")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a+b+c<22:
    print("win")
else:
    print("bust")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

A, B, C = map(int, input().split())

if A+B+C > 21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a, b, c = map(int, (input().split()))
print('bust' if a + b + c > 21 else 'win')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

print("bust" if a + b + c >= 22 else "win")

Submission status: Accepted

Solution code:
a1, a2, a3 = map(int, input().split())
print("bust" if a1 + a2 + a3 >= 22 else "win")

Submission status: Accepted

Solution code:
A1, A2, A3 = (int(i) for i in input().split())
if A1+A2+A3 <= 21: print('win')
else: print('bust')

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]

    if (A+B+C) > 21:
        print('bust')
    else:
        print('win')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

s = sum(ril())
if s > 21:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
print("win" if sum(a)<22 else "bust")

Submission status: Accepted

Solution code:
A = map(int, input().split())
sum_val = sum(A)
if sum_val >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
#%%

a, b, c = map(int, input().split())
tmp = a + b + c
if tmp >= 22:
    ans = 'bust'
else:
    ans = 'win'
print(ans)

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int, input().split())
if A1 + A2 + A3 >21:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
a=sum([int(j) for j in input().split()])
if a>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, sys.stdin.readline().split())

if a + b + c >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
if sum(X) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if sum((a,b,c)) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
def main():

    a, b, c = map(int, input().split())
    if a+b+c >= 22: return 'bust'
    return 'win'

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
A, B, C=map(int, input().split())

if A+B+C>=22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print('bust') if sum(a) > 21 else print('win')

Submission status: Accepted

Solution code:
def main():
    n=list(map(int,input().split()))
    if sum(n)>=22:
        print("bust")
    else:
        print("win")
main()

Submission status: Accepted

Solution code:


a,c,b=map(int,input().split())

if(a+c+b>=22):
	print("bust")
else:
	print("win")

Submission status: Accepted

Solution code:
A_1,A_2,A_3 = map(int,input().split())

if A_1 + A_2 + A_3 >= 22 :
    print('bust')
else :
    print('win')

Submission status: Accepted

Solution code:
a1,a2, a3 = map(int, input().split())
if a1+a2+a3 >= 22:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
x=a+b+c
print('bust' if x>21 else 'win')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def main():
    a = list(map(int, input().split()))

    if sum(a) >= 22:
        print('bust')
    else:
        print('win')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
	a1,a2,a3 = map(int,input().split())

	if a1+a2+a3 >= 22:
		print('bust')
	else:
		print('win')

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

A = LI()
if sum(A) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int, input().split())

if A1+A2+A3 >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


A, B, C = map(int, input().split())


# In[ ]:


if A + B + C >= 22:
    print('bust')
else:
    print('win')


# In[ ]:

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    la = rli()
    if sum(la) >= 22:
        print("bust")
    else:
        print("win")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = sum(a)
ans = 'win'
if b >= 22:
    ans = 'bust'
print(ans)

Submission status: Accepted

Solution code:
# 2019/12/08

a,b,c=map(int,input().split())
print('win' if a+b+c<22 else 'bust')

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
if a+b+c>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if(sum(a)>=22):
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
print("bust" if sum(map(int,input().split()))>21 else "win")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
b = sum(a)
if b>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
# A
a, b, c = map(int, input().split())
su = a + b + c
if su >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))

if sum(A) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print('bust' if a+ b+c >= 22 else 'win')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
m=a+b+c
if m>=22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

if A1 + A2 + A3 >= 22:
    print ('bust')
else:
    print ('win')

Submission status: Accepted

Solution code:
S = list(map(int, input().split()))
if sum(S) <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

bust = 'bust'
win = 'win'
def solve(A: "List[int]"):
    if sum(A) >= 22:
        print(bust)
    else:
        print(win)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = [int(next(tokens)) for _ in range(3)]  # type: "List[int]"
    solve(A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print("win" if sum(list(map(int, input().split()))) <= 21 else "bust")

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    l = LMIIS()
    if sum(l) >= 22:
        print('bust')
    else:
        print('win')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = a + b + c
if ans >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    a,b,c = mi()
    if a+b+c > 21:
        print("bust")
    else:
        print("win")

main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a + b + c >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a1,a2,a3 = map(int,input().split())

s = a1+a2+a3

if s >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A+B+C >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

A=many_int()

if sum(A)>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
if sum(A) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
x,y,z = map(int,input().strip().split())
if x+y+z>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int, input().split())

print('bust' if A1+A2+A3 >= 22 else 'win')

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

s = sum(a)

if s > 21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().strip().split()))
if a + b + c >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
#coding:utf-8
a, b, c = map(int, input().split())

if a + b + c >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a+b+c >=22:print("bust")
else:print("win")

Submission status: Accepted

Solution code:
import sys
a_ls = [int(i) for i in sys.stdin.readline().split()]
if sum(a_ls) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
if sum(A) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
print("bust" if sum(list(map(int,input().split())))>21 else"win")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a+b+c >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a1, a2, a3 = map(int,input().split())

if a1 + a2 + a3 > 21:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
v=a+b+c
if v>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
def main():
    a, b, c = list(map(int, input().split()))

    if a + b + c >= 22:
        print('bust')
    else:
        print('win')
    
  

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int, input().split())

if A1+A2+A3 > 21:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int,(input().split()))
if A1+A2+A3 > 21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a+b+c <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())
if A+B+C >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

print("win") if sum(a) <= 21 else print("bust")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A = [int(x) for x in input().strip().split()]
if sum(A) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    a, b, c = LI()
    if a + b + c >21:
        print("bust")
    else:
        print("win")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = IL()
if sum(a) <= 21:
  print("win")
else:
  print("bust")

Submission status: Accepted

Solution code:
A1, A2, A3= map(int, input().split())

if(A1+A2+A3 > 21):
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a1, a2, a3 = map(int, input().split())

if a1+a2+a3 >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

sum=A+B+C

if sum>=22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
A,B, C = map(int,input().split())

if A+B+C >= 22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
print("win" if eval(input().replace(" ", "+")) <= 21 else "bust")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if a + b + c >=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
import sys
from collections import deque
readline = sys.stdin.readline

s = sum(map(int, readline().split()))

if s >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print('win' if sum(a) < 22 else 'bust')

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]

if sum(A) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:

a,b,c = map(int,input().split())

if a+b+c >= 22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
a,b,c= map(int,input().split())
if a+b+c >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
L = list(map(int, input().split()))

if L[0] + L[1] + L[2] >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a1, a2, a3=map(int, input().split())
if a1+a2+a3>=22:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b = list(map(int, input().split()))
# s = input()

a, b, c = list(map(int, input().split()))
if a +b+c <= 21:
    print("win")
else:
    print("bust")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#


def main():
    if sum(lmis()) >= 22:
        print('bust')
    else:
        print('win')





main()

Submission status: Accepted

Solution code:
def solve():
    a1, a2, a3 = map(int, input().split())
    if a1+a2+a3 >= 22:
        print('bust')
    else:
        print('win')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print("bust" if a+b+c>=22 else "win")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

if (a + b + c) >= 22:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A + B + C > 21:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int,input().split())

if A1+A2+A3>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a = list(map(int, input().split()))
print(['win', 'bust'][sum(a) >= 22])

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
print('bust' if sum(A) >= 22 else 'win')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print("bust" if a+b+c >= 22 else "win")

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().strip().split())

if A1 + A2 + A3 >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
if sum(list(map(int, input().split()))) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if(a+b+c >= 22):
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
a,b, c = map(int,input().split())
ans = 'win'
if a+b+c >21:
  ans = 'bust'
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A):
    return 'bust' if sum(A) > 21 else 'win'


def main():
    A = read_int_n()
    print(slv(A))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a + b + c >= 22:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

total=a+b+c

if total>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A+B+C>21:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b,c=LI()
  sm=a+b+c

  if sm>=22:
    return 'bust'
  return 'win'

# main()
print(main())

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    A=list(map(int,input().split()))
    print('bust' if sum(A)>21 else 'win')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    A = [int(i) for i in input().split()]
    if 22 <= sum(A):
        print("bust")
    else:
        print("win")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

if A1 + A2 + A3 > 21:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
def main():
    A1, A2, A3 = [int(i) for i in input().split()]
    if A1 + A2 + A3 >= 22:
        print('bust')
    else:
        print('win')

main()

Submission status: Accepted

Solution code:
a = map(int, input().split())
if sum(a) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]

def main():
    a,b,c=inpm()
    x=a+b+c
    if x>=22:
        print('bust')
    else:
        print('win')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]
print('bust' if sum(A) > 21 else 'win')

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LI()
    if sum(A)<=21:
        print("win")
    else:
        print("bust")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = a + b + c
if d >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

A = LI()

print("bust" if sum(A) >= 22 else "win")

Submission status: Accepted

Solution code:
a1,a2,a3 = map(int, input().split())

if a1+a2+a3>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a1,a2,a3 = map(int,input().split())

if a1+a2+a3 >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A + B + C >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int,input().split())

if A1+A2+A3 >= 22:
    print('bust')
else:
    print("win")

Submission status: Accepted

Solution code:
a = map(int, input().split())

print('bust' if sum(a) >= 22 else 'win')

Submission status: Accepted

Solution code:
a = sum(list(map(int, input().split())))
if a >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
def p_a():
    a = map(int, input().split())
    print("bust" if sum(a) >= 22 else "win")
    
p_a()

Submission status: Accepted

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    A, B, C = MI()

    if A + B + C >= 22:
        print('bust')
    else:
        print('win')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
from itertools import permutations
from itertools import combinations

#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
a, b, c = map(int, input().split())

if a+b+c>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
# abc 147
a = list(map(int,input().split()))
if a[0] + a[1] + a[2] >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:

a,b,c = list(map(int, input().split()))
if(a+b+c<=21):
    print("win")
else:
    print("bust")

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
if X+Y+Z <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
if sum(a) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:

A,B,C = map(int,input().split())

if A+B+C >= 22:
    print ("bust")
else:
    print ("win")

Submission status: Accepted

Solution code:
import bisect
from math import ceil, floor, sqrt

A1, A2, A3 = list(map(int, input().split()))
if A1 + A2 + A3 >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

def main():
    A = list(map(int, input().split()))
    if sum(A) >= 22:
        print("bust")
    else:
        print("win")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

A1,A2,A3=map(int,input().split())

if A1+A2+A3>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a + b + c <= 21:
    print('win')
else:
    print('bust')