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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
    a, b, c = LI()
    if a+b+c >= 22:
        print("bust")
    else:
        print("win")

main()

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:
    ans = 'bust'
else:
    ans = 'win'

print(ans)

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:
K = [int(x) for x in input().split()]
if sum(K) <= 21:
  print("win")
else:
  print("bust")

Submission status: Accepted

Solution code:
X,Y,Z = map(int, input().split())

if X+Y+Z >= 22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = LIST()

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:
a, b, c = [int(s) for s in input().split()]
if a + b + c >= 22:
  print('bust')
else:
  print('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:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    A = string_to_int(inputs[0])
    if sum(A) >= 22:
        return "bust"
    return "win"


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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:
s = sum(map(int, input().split()))
if s>21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC147 A

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a1,a2,a3 = LI()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(_) for _ in input().split()]
if a + b + c >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
a = sum([int(i) for i in input().split()])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if (sum(A_list)) >= 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:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c = m()

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:
A1, A2, A3 = map(int, input().split())
print("bust" if A1 + A2 + A3 >= 22 else "win")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1,A2,A3=map(int,input().split())
f=A1+A2+A3>=22

print('bust' if f 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())

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

Submission status: Accepted

Solution code:
# coding: utf-8
A = list(map(int, input().split()))
print("bust" if sum(A) >= 22 else "win")

Submission status: Accepted

Solution code:
from sys import stdin

li = list(map(int,stdin.readline().rstrip().split()))

if sum(li) > 21:
    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:
if sum([int(i) for i in input().split()]) >= 22:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
a, b, c = (int(i) for i in 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("win")
else:
  print("bust")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, string
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**7)
inf = float('inf')
mod = 10**9+7
ans = inf ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
# ABC147a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

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


if __name__ == '__main__':
    main()

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())
print('bust' if a+b+c >= 22 else '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:
a1 ,a2 ,a3 = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

A1,A2,A3 = II()

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b, c = list(map(int, readline().split()))
    print("bust" if a + b + c >= 22 else "win")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a=sum(map(int,input().split()))
    print("bust" if(a>=22) else "win")
resolve()

Submission status: Accepted

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

if a + b + c > 21:
  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
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353



A = list(map(int, sys.stdin.buffer.readline().split()))
s = A[0] + A[1] + A[2]
if s >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b,c = LI()
    if a+b+c >= 22:
        print("bust")
    else:
        print("win")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)

int main() {
  int a,b,c;
	cin >> a >> b >> c;
	string ans = "win";
	if (a+b+c>21) ans = "bust";
  cout << ans << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=list(input().split())
if sum(a)>=22:
  print("bust")
elif sum(a)<=21:
  print("win")

Submission status: Runtime Error

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

T = A1 + A2 + A3

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int a, b, c;
	cin >> a >> b >> c;
	cout << (a+b+c >= 22 ? "bust" : "win");
}

Submission status: Runtime Error

Solution code:
#C - HonestOrUnkind2
N = int(input())
A = []
X = []
Y = []
for _ in range(N):
    a = int(input())
    A.append(a)
    box_x = []
    box_y = []
    for _ in range(a):
        x,y = map(int,input().split())
        box_x.append(x)
        box_y.append(y)
    X.append(box_x)
    Y.append(box_y)

person = [2]*N

maxim = 0
for i in range(1<<N):
    c_person = person.copy()
    honest = 0
    for j in range(N):
        mask = 1<<j
        if mask&i != 0:
            c_person[j] = 1
        else:
            c_person[j] = 0
    #正直者かどうかの仮定
    for k,l in enumerate(c_person):
        #kが正直者のとき
        if l == 1:
            #kの証言を判定
            for m,n in zip(X[k],Y[k]):
                #矛盾があるなら honest = 0でbreak
                if c_person[m-1] != n:
                    honest = 0
                    break
            else:
                honest = sum(c_person)
                continue
            break
    maxim = max(maxim,honest)
                
print(maxim)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = sum(inputlist())
if s >= 22:
    print("bust")
else:
    print("win")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(['bust','win'][sum(map(int,input.split()))<22])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [[] for _ in range(n)]
for i in range(n):
  num = int(input())
  for j in range(num):
    person, state = map(int, input().split())
    a[i].append([person-1, state])
honest = 0
for i in range(1, 2**n):
  flag = True
  for j in range(n):
    if (i>>j)&1 == 1:
      for x, y in a[j]:
        if (i>>x)&1 != y:
          flag = False
          break
  if flag:
    honest = max(honest, bin(i)[2:].count('1'))
print(honest)

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))

bit = [0] * 60
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
    c = 0
    for x in a:
        if x >> i & 1:
            c += 1
    ans = (ans + c * (n - c) * (2 ** i)) % mod

print(ans)

Submission status: Runtime Error

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

bit = [0] * 60
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
    c = 0
    for x in a:
        if x >> i & 1:
            c += 1
    ans = (ans + c * (n - c) * (2 ** i)) % mod

print(ans)

Submission status: Runtime Error

Solution code:
def main():  
  import sys
  read = sys.stdin.buffer.read
  readline = sys.stdin.buffer.readline
  readlines = sys.stdin.buffer.readlines

  h,w = map(int,readline().split())
  a = []
  A = [list(map(int,readline().split())) for _ in range(h)]
  B = [list(map(int,readline().split())) for _ in range(h)]
  C = [[0]*w for _ in range(h)]
  for i in range(h):
      for j in range(w):
          C[i][j] = abs(A[i][j] - B[i][j])

  dp = [[set() for _ in range(w)] for _ in range(h)]
  dp[0][0].add(C[0][0])

  for i in range(h):
    for j in range(w):
      for k in dp[i][j]:
          if i < h-1:
            c = C[i+1][j]
            if k+c < 6321:
              dp[i+1][j].add(k+c)
            dp[i+1][j].add(abs(k-c))
          if j < w-1:
            d = C[i][j+1]
            if k+d < 6321:
              dp[i][j+1].add(k+d)
            dp[i][j+1].add(abs(k-d))

  print(min(dp[h-1][w-1]))
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end() 
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;

int main() {
    string B = "bust", W = "win";
    int A1, A2, A3;

    cin >> A1 >> A2 >> A3;

    if (A1 + A2 + A3 >= 22){
        cout << B << endl;
    }
    else{
        cout << W << endl;
    }
    
}

Submission status: Runtime Error

Solution code:
x = int(input())
y = int(input())
z = int(input())
point = x + y + z

if point <= 21:
  print("win")

else:
  print("bust")

Submission status: Runtime Error

Solution code:
x = input()
a = x.sprit(' ')
if int(a[0]) + int(a[2]) + int(a[4]) >=22:
 print('bust')
else:
 print('win')

Submission status: Runtime Error

Solution code:
x = input()
if int(x[0]) + int(x[2]) + int(x[4]) >=22:
 print('bust')
else:
 print('win')

Submission status: Runtime Error

Solution code:
x = input()
if int(x[0]) + int(x[2]) + int(x[4]) >=22 ;
 print('bust')
else;
 print('win')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
l=sorted(list(map(int,input().split())))
for i,x in enumerate(l):
  l[i]=format(x,'63b')
memo=[0]*63
for i in range(63):
  for j in range(n):
    if l[j][i]=='1':
      memo[-i-1]+=1
now=1
ans=0
mod=10**9+7
for x in memo:
  ans+=(now*x*(n-x))%mod
  now*=2
print(ans%mod)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

total = sum(a1, a2, a3)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import defaultdict
def main2():
    ketaone = [0]*61
    MOD = 10**9 + 7
    n = int(input())
    A=[int(i) for i in input().split()]

    for i in A:
        for j in range(61):
            if i&(1<<j):
                ketaone[j]+=1
    res = 0

    for i in range(61):
        res = res + (ketaone[i]*(n-ketaone[i])*(2**i))%MOD
        res%=MOD
    print(res)


def main1():
    n = int(input())
    lis = [[] for _ in range(n)]
    for i in range(n):
        a = int(input())
        for j in range(a):
            lis[i].append(list(map(int, input().split())))
    res = 0

    for i in range(1<<n):
        f = True
        uso=set()
        syo=set()
        tmp=0
        for j in range(n):
            if(i&(1<<j)):
                tmp+=1
                for k in lis[j]:
                    if (i&(1<<(k[0]-1))) and k[1]==0:
                        f=False
                    if k[1]==1 and not (i&(1<<k[0]-1)):
                        f=False
        if f:
            res = max(res,tmp)
    print(res)


if __name__ == '__main__':
    main2()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8
a = list(map(int, input().split()))
if sum(a) > 21:
    print("bust")
else:
    print(win)

Submission status: Runtime Error

Solution code:
N = int(input())
A = []
XY = []
honest_count = []

for i in range(N):
    a = int(input())
    A.append(a)
    inter = []
    for x in range(a):
        xy = list(map(int,input().split()))
        inter.append(xy)
    XY.append(inter)

for i in range(2**N):
    pt = [0]*N
    ck = 1
    for j in range(N):
        if (i>>j)&1:
            pt[N-j-1]=1
    for k in range(N):
        if pt[k] ==1:
            for l in range(A[k]):
                if XY[k][l][1] != pt[XY[k][l][0] -1]:
                    ck = 0
    if ck == 1:
        honest_count.append(sum(pt))
print(max(honest_count))

Submission status: Runtime Error

Solution code:
N = int(input())
A = []
XY = []
honest_count = []

for i in range(N):
    a = int(input())
    A.append(a)
    inter = []
    for x in range(a):
        xy = list(map(int,input().split()))
        inter.append(xy)
    XY.append(inter)

for i in range(2**N):
    pt = [0]*N
    ck = 1
    for j in range(N):
        if (i>>j)&1:
            pt[N-j-1]=1
    for k in range(N):
        if pt[k] ==1:
            for l in range(A[k]):
                if XY[k][l][1] != pt[XY[k][l][0] -1]:
    if ck == 1:
        honest_count.append(sum(pt))
print(max(honest_count))

Submission status: Runtime Error

Solution code:
print(sum([int(list(input().split())[i]) for i in range(3)]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a1 = input('a1:')
a2 = input('a2:')
a3 = input('a3:')


sum = int(a1) + int(a2) + int(a3)

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

Submission status: Runtime Error

Solution code:
import itertools
n = int(input())
l = []
for i in range(n):
    d = int(input())
    for dd in range(d):
        x, y = map(int, input().split())
        l.append([i, x-1, y])

ans = 0
for p in itertools.product([0, 1], repeat=n):
    for ll in l:
        if p[ll[0]] == 1 and p[ll[1]] != ll[2]:
            break
    else:
        ans = max(ans, sum(p))
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A_1=int(input())
A_2=int(input())
A_3=int(input())
if A_1+A_2+A_3>=22:
    print("bust")
if A_1+A_2+A_3<=21:
    print("win")

Submission status: Runtime Error

Solution code:
A_1=int(input())
A_2=int(input())
A_3=int(input())
if A_1+A_2+A_3>=22:
    print("bust")
if A_1+A_2+A_3<=21:
    print("bust")

Submission status: Runtime Error

Solution code:

A = list(map(int, input.split()))

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

Submission status: Runtime Error

Solution code:
N=int(input())

A=[]
test = []
for i in range(N):
    A_i= int(input())
    A.append(A_i)
    testimony_i=[]
    for j in range(A_i):
        x,y= map(int,input().split())

        testimony_i.append([x,y])
    
    test.append(testimony_i)
    
total=0
for i in range(2**N):

    member = format(i,'0{}b'.format(N))

    flg = 0

    for j in range(N):
        if member[j]== '1':

            syogen = test[j]

            for s in syogen:
                if member[s[0]-1]==str(s[1]):
                    continue
                else:
                    flg+=1

    if flg ==0:
        total = max(total , member.count('1')) 

print(total)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
g = []
ans = 0
for j in range(60):
    d = 0
    for i in range(n):
        d += a[i]&1
        a[i] >>= 1
    g.append(d)
for i in range(60):
    ans += g[i]*(n-g[i])*(pow(2,i,1000000007))
    ans = ans % (1000000007)
print(ans%(1000000007))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
MOD = 10**9 + 7
n = int(input())
a = list(map(int,intput().split()))

cnt = [0] * 60

for num in a:
  for j in range(60):
    cnt[j] += num >> j
ans = 0
for b in range(60):
  ans += cnt[b] * (n-cnt[b]) << b
  
ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
    A = int(readline())
    for j in range(A):
        x,y = map(int,readline().rstrip().split())
        tes[i][x-1] = y

cnt = 0
for i in range(2**N):
    hon = [0]*N
    for j in range(N):
        if (i>>j)&1:
            hon[j] = 1
    flag = True
    for j in range(N):
        if hon[j]:
            for k in range(N):
                if tes[j][k] != hon[k]:
                    flag = False
                    break
        if not flag:
            break
    if flag:
        cnt = max(cnt,hon.count(1))
print(cnt)

Submission status: Runtime Error

Solution code:
s = input()
list = list(s)

for i in range(len(s) / 2):
  print(list[i])

Submission status: Runtime Error

Solution code:
n = int(input())

a = []

evidences = []
for i in range(n):
    ls = []
    x = int(input())
    a.append(x)
    for j in range(x):
        l = [int(_) for _ in input().split(' ')]
        ls.append(l)
    evidences.append(ls)

patterns = []
for i in range(2**n):
    pattern = [0] * n
    for j in range(n):
        if (i >> j & 1):
            pattern[j] = 1
    patterns.append(pattern)

honest = 0
for pattern in patterns:
    contradict = False
    for i in range(n):
        for evidence in evidences[i]:
            if(pattern[i] == 1):
                if (pattern[evidence[0]-1] != evidence[1]):
                    contradict = True
            else:
                if (pattern[evidence[0]-1] == evidence[1]):
                    contradict = True
    if (contradict == False):
        honest = max(honest, pattern.count(1))

print(honest)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

1 <= a <= b <= c <= 13

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

1 <= a, b, c <= 13

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

1 <= a, b, c <= 13

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

Submission status: Runtime Error

Solution code:
ef main():
    a1, a2, a3 = map(int, input().split())
    if (a1+a2+a3) <= 21:
        print("win")
    else:
        print("bust")

if __name__ == "__main__":
    main()