source string | code string | inputs string | outputs string | metadata string |
|---|---|---|---|---|
google_code_jam | def build_initial(string):
vals = []
for num in string:
vals.append( "(" * int(num) + num + ")" * int(num))
return "".join(vals)
def replace_parentheses(string, n):
for i in range(n, 0, -1):
string = string.replace(")" * n + "(" * i, ")"*(n-i))
return string
if __name__ == '__main_... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | l=[]
def output(cases):
global sol
sol=""
if len(cases)==1:
sol="("*int(cases)+cases+")"*int(cases)
else:
for i in range(len(cases)-1):
if i==0: #def basecase
sol+="("*int(cases[i])
if int(cases[i])>int(cases[i+1]):
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | n = int(input())
for case_num in range(1, n+1):
data = map(int, input())
depth = 0
output = []
for i in data:
while i < depth:
output.append(")")
depth -= 1
while i > depth:
output.append("(")
depth += 1
output.append(str(i))
wh... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def dfs(s,k):
#ddprint(f"dfs s {s} k... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | caseCount = input()
for i in range(int(caseCount)):
parenCount = 0
out = ''
line = input()
intList = [int(char) for char in line]
for index, digit in enumerate(intList):
for k in range(digit - parenCount):
out += '('
parenCount += 1
out += str(digit)
i... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(t,result,prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
retu... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for t in range(1, T+1):
numbers = [int(s) for s in input()]
ret = ""
prev = 0
for n in numbers:
diff = n - prev
if diff > 0:
ret += "(" * diff
elif diff < 0:
ret += ")" * abs(diff)
ret += str(n)
prev = n
re... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def insertX (source_str, insert_str, pos, x):
answer = source_str
for i in range(0, x):
answer = answer[:pos + i]+insert_str+answer[pos + i:]
return answer
test_cases = int(input()) # read a line with a single integer
for i in range(1, test_cases + 1):
s = input().strip()
open_parenthesis ... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
def solve():
solution = ""
string = [int(d) for d in input()]
for i, character in enumerate(string):
temp = str(character)
for cycle in range(0, character):
temp = "(" + temp + ")"
solution += temp
temp2 = [char for char in solution]
fl... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def dfs(s,v):
r = ""
i = 0
n = len(s)
for j in range(n):
if int(s[j]) == v:
if j > i:
r += dfs(s[i:j], v+1)
r += s[j]
i = j+1
if n > i:
r += dfs(s[i:n], v+1)
if v > 0:
r = "(" + r + ")"
return r
T = int(input())
fo... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(n):
res = ''
cur_depth = 0
for i in n:
if cur_depth < int(i):
for j in range(int(i) - cur_depth):
res += '('
elif cur_depth > int(i):
for j in range(cur_depth - int(i)):
res += ')'
cur_depth = int(i)
res += i
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def main():
T = int(input())
for x in range(1, T+1):
lst = list(input())
ans = []
for n, i in enumerate(lst):
if i != '(' and i != ')':
for a in range(int(i)):
ans.append('(')
ans.append(i)
for a in range(int... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for i in range(1, t+1):
out = "Case #{}: ".format(i)
s = input()
print(out, end='')
stack = 0
for i in s:
i = int(i)
while i > stack:
print("(", end='')
stack += 1
while i < stack:
print(")", end='')
stack -= 1
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def nestingDepth(inpStr):
inpList = [int(x) for x in inpStr]
newStr ='('*inpList[0]
for i in range(len(inpList)):
if i == 0:
newStr+=str(inpList[0])
elif inpList[i-1]==inpList[i]:
newStr+=str(inpList[i])
else:
if inpList[i-1]>inpList[i]:
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for case in range(t):
s = input().strip()
r = ""
ints = [int(x) for x in s]
curval = 0
for x in ints:
if(x > curval):
r = r + '('*(x- curval)
curval = x
elif(x < curval):
r = r + ')'*(curval -x)
curval = x
r = r + str(x)
r = r + ')'*(curval)
print ("Case #" + str... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def listToString(s):
str1 = ""
for ele in s:
str1 += ele
return str1
for _ in range(int(input())):
lst=list(input())
i=0
l,r,left_bracket,right_bracket=0,0,0,0
left_bracket=int(lst[0])
for j in range(left_bracket):
lst.insert(j,"(")
i=left_bracket
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for cn in range(0,t):
s = input()
sp = ''
n = 0
for i in range(0,len(s)):
num = int(s[i])
subsp = ''
diff = num-n
if diff > 0:
subsp = '('*diff
if diff < 0:
subsp = ')'*-diff
n = n+diff
subsp = subsp+s[i]
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
def solution(seq):
last = 0
new_seq = []
for c in seq+"0":
n = int(c)
new_seq.append("("*max(0,n-last)+")"*max(0,-n+last)+c)
last = n
return "".join(new_seq)[:-1]
t = int(input())
for t in range(1,t+1):
seq = input()
print ("Case #{}: {}".format(t, solution(seq... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def solve(S):
S = [int(c) for c in S]
S_ = []
curr = 0
for c1 in S:
# if c1 == 0:
# continue
if curr < c1:
while curr < c1:
S_.append('(')
curr += 1
elif curr == c1:
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for cas in range(int(input())):
s = list(map(int, input()))
print("Case #" + str(cas+1) + ":", "("*s[0] + "".join(str(c) + ("()"[c > n])*abs(c - n) for c, n in zip(s, s[1:])) + str(s[-1]) + ")"*s[-1])
| ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def add_parens(S):
s = ''
s += '('*S[0] + str(S[0])
for i in range(1, len(S)):
if S[i] == S[i-1]:
s += str(S[i])
if S[i] < S[i-1]:
s += ')'*(S[i-1]-S[i]) + str(S[i])
if S[i] > S[i-1]:
s += '('*(S[i]-S[i-1]) + str(S[i])
s += ')'*S[-1]
return... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | num_of_cases = int(input())
for i in range(1, num_of_cases + 1):
cur_int = -1
answer = ""
num_of_paren = 0
for char in input():
my_int = int(char)
# First char
# Open parenthesis
if cur_int == -1:
for j in range(num_of_paren, my_int):
answer... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(t, result, prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
re... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def returnP(c, o):
return ")"*c+"("*o
t = int(input())
for i in range(t):
s = input()
fs = ""
ocount = 0
for ss in s:
if ocount>int(ss):
fs+=returnP(ocount-int(ss),0)
elif ocount<int(ss):
fs+=returnP(0,int(ss)-ocount)
ocount=int(ss)
fs+=str(in... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def nest(s):
chars = set(c for c in s)
for c in chars:
n = int(c)
s = s.replace(c, ("(" * n) + c + (")" * n))
l = 0
while l != len(s):
l = len(s)
s = s.replace(")(", "")
return s
T = int(input())
for case in range(T):
s = nest(input())
print("Case #{}: {}".... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | tt = int(input())
ans = []
def func(temp_str):
n = len(temp_str)
validity = 0
for i in range(n):
if(temp_str[i]!='(' and temp_str[i]!='0' and temp_str[i]!=')' ):
validity = 1
break
for i in range(n):
if(temp_str[i]=='0' and validity == 1):
for j in ra... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def nestedStr(line):
L = list(line)
newL = []
k = 0
numberOpen = 0
while k<len(L):
for i in range(0,int(L[k])-numberOpen):
newL.append('(')
numberOpen = int(L[k])
cpt = k
while(cpt<len(L) and L[cpt]==L[k]):
cpt += 1
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import sys
def func():
lines = sys.stdin.readlines()
num_test_cases = int(lines[0])
for case in range(num_test_cases):
case_str = lines[case + 1]
result = ""
curr_depth = 0
for i in range(len(case_str) - 1):
depth = int(case_str[i])
while curr_depth ... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import bisect
import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
# mod = 10 ** 9 + 7
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): retu... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def para():
test = input()
prev = 0
res = ""
for i in range(0, len(test)):
curr = int(test[i])
if curr > prev:
res = res + "(" * (curr-prev) + test[i]
elif curr < prev:
res = res + ")" * (prev-curr) + test[i]
else:
res = res + test[i]
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for tt in range(T):
s = input()
arr = [int(ss) for ss in s]
# arr.sort()
b_put = 0
op = ""
for num in arr:
if b_put > num :
while b_put > num:
op+=')'
b_put-=1
op+= str(num)
elif b_put < num:
op+... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def f(s):
ans = ''
level = 0
for c in s:
num = int(c)
if num > level:
ans += '(' * (num - level)
elif num < level:
ans += ')' * (level - num)
ans += c
level = num
ans += ')' * level
return ans
cases = int(input())
for i in range(c... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for case in range(1,T+1):
line = input()
N = []
for i in line:
N.append(int(i))
string = []
for n in line:
string.extend([[],n,[]])
length = len(N)
R = [0]*length
while R != N:
a = 0
while R[a] == N[a]:
a += 1
b = a + 1... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
T = int(input())
for t in range(1, T + 1):
S = input()
result = ''
n = 0
for ch in S:
value = int(ch)
if n == value:
result += ch
elif n > value:
while n > value:
result += ')'
n -= 1
result += ch
e... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for z in range(t):
a = list(map(int, list(input())))
res = ''
cnt = 0
for i, n in enumerate(a):
if i == 0:
res += '(' * n
res += str(n)
cnt += n
continue
if n > a[i-1]:
res += '(' * (n - a[i-1])
res += str(n)
cnt = n
elif n < a[i-1... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def get_open_paren(n):
return "(" * n
def get_close_paren(n):
return ")" * n
test_cases = int(input())
for tc in range(1, test_cases + 1):
num_braces = 0
result = ""
S = input()
for c in S:
if (num_braces == int(c)):
result += c
elif (num_braces < int(c)):
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def main():
T = int(input())
for index in range(T):
s = [int(char) for char in input()]
result = ''
previous = None
for current in s:
nest_depth = current
place_position = len(result)
if previous and current != 0:
if previous ==... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def sol2(string):
stack = []
prev = 0
res = ''
for char in string:
curr = int(char)
if curr == prev:
res += str(curr)
elif prev > curr:
while len(stack) != curr:
res += stack.pop()
stack.append(str(curr))
elif prev < c... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import sys
for case in range(int(sys.stdin.readline())):
sets = (sys.stdin.readline().strip())
previous_state = 0
initial_state = 0
output = ""
for char in sets:
difference = int(char) - previous_state
if difference > 0:
output += ('(' * difference) + char
pr... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for i in range(t):
n = input()
a = list(n)
result = ""
for x in range(len(a)):
if x == 0:
for n in range(int(a[x])):
result += "("
if x == len(a) -1:
result += str(a[x])
for n in range(int(a[x])):
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def f(s):
r = ""
d = 0
for i in range(len(s)):
if d < s[i]:
while d < s[i]:
r += "("
d += 1
r += str(s[i])
elif d > s[i]:
while d > s[i]:
r += ")"
d -= 1
r += str(s[i])
else:
r += str(s[i])
while d > 0:
r += ")"
d -= 1
return r
t = int(input())
for i in range(1, t + 1):
s... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import sys
tc = int(sys.stdin.readline())
for t in range(tc):
inp = [int(x) for x in sys.stdin.readline().strip()]
output = []
depth = 0
for c in inp:
if c - depth > 0:
output.extend(["("] * (c-depth))
elif c -depth < 0:
output.extend([")"] * (depth-c))
output.append(c)
depth = c
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for i in range(1, t+1):
s = str(input())
p = 0
sl = ''
for c in s:
x = int(c)
if (x > p):
sl += (x-p)*'(' + str(x)
p += x-p
continue
if (x < p):
sl += (p-x)*')' + str(x)
p -= p-x
continue
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for _ in range(int(input())):
s = input()
op = 0
s1 = ''
for i in s:
n = int(i)
if n>op:
br=n-op
s1+='('*br+i
op=n
elif n<op:
br=op-n
s1+=')'*br+i
op=n
else:
s1+=i
s1+=')'*op
print('Case #%d: %s' % (_+1,s1))
| ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | from collections import deque
N = int(input())
count = 1
while N >= count:
S = input().strip()
# stack = deque([])
ans = []
base = 0
for ch in S:
if int(ch) == base:
ans.append(ch)
elif int(ch) > base:
ans.append("{}{}".format("(" * (int(ch) - base), ch))
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
def solve(A):
n = len(A)
ans = ''
cur = 0
for i in range(n):
it = A[i]
if it>=cur:
diff = it - cur
ans += '('*diff
ans += str(it)
cur += diff
elif it < cur:
diff = cur - it
ans += ')'*diff
cur -... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | # can do this greedily, just don't add unnecessary parentheses
T = int(input())
for case in range(1, T+1):
S = [int(x) for x in input()]
S_prime = []
current_depth = 0
for digit in S:
if current_depth < digit:
S_prime.append('('*(digit-current_depth))
elif current_depth > di... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for t in range(int(input())):
res = ""
curr = 0
s = input()
for i in s:
i = int(i)
a = min(i, curr)
b = i - a
temp = "(" * b + str(i) + ")" * b
if (a == 0):
res += temp
else:
res = res[:-a] + temp + res[-a:]
curr = i
pri... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for _ in range(1,int(input())+1):
s = input()
n = len(s)
ans = []
i = 0
top = 0
while i<n:
x = int(s[i])
if s[i] == '0':
ans.append('0')
top = 0
elif x <= top:
ans = ans[:len(ans)-x]+[s[i]]+ans[len(ans)-x:]
top = x
e... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | from sys import stdin,stdout
for t in range(int(stdin.readline().strip())):
a=list(map(int,stdin.readline().strip()))
a.append(0)
n=len(a)
i=0
po=0
ponew=0
while i<n:
if a[i]>po:
ponew=a[i]
for j in range(a[i]-po):
a.insert(i,'(')
i+=1
n+=1
po=ponew
elif a[i]<po:
ponew=a[i]
for j i... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t=int(input())
count=0
while(t>0):
count+=1
s=(input())
# s=list(s)
# s=[int(x) for x in input().split()]
# a=[int(x) for x in input().split()]
# print("s=",s," len=",len(s))
print("Case #"+str(count)+": ",end='')
if len(s)==1:
for j in range(int(s)):
print("(",end='')
print(s,end='')
for j in ra... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
def interview3(arr):
l = len(arr)
answer = ""
for a in range(int(arr[0])):
answer += "("
answer += arr[0]
prev = int(arr[0])
for b in range(1, l):
temp = prev - int(arr[b])
if temp > 0:
for i in range(temp):
answer += ")"
a... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def main():
T = input()
cases = []
for i in range(int(T)):
cases.append(input())
for i in range(int(T)):
print("Case #" + str(i+1) + ": " + output(cases[i]))
def output(number):
corr = 0
number2 = number
for i in range(len(number)):
corr2 = 0
if i == 0:
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(s):
ans = ''
s.append(0)
stack = [0]
for c in s:
if c < stack[-1]:
d = stack[-1] - c
ans += (')' * d) + str(c)
stack.pop()
stack.append(c)
elif c > stack[-1]:
d = c - stack[-1]
ans += ('(' * d) + str(c)
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(t,result,prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
retu... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | test_cases = int(input())
for case in range(test_cases):
s = input()
arijit = 0
singhh = ""
if(len(s) == 1):
singhh += "("*int(s) + s + ")"*int(s)
else:
for index,n in enumerate(s):
if(index == 0):
larijit = int(n)
rarijit = int(n)-int(s[in... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | from collections import deque
for case in range(1,int(input())+1):
s = input()
ans = ''
curr = 0
for i in s:
i=int(i)
#print(i,curr)
if i>curr:
ans+='('*(i-curr)+str(i)
curr+=i-curr
elif i<curr:
ans+=')'*(curr-i)+str(i)
curr... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for z in range(int(input())):
s=list(map(int,input()))
s1=''
n=len(s)
if(n==1):
s1=s1+'('*s[0]+str(s[0])+')'*s[0]
else:
s1=s1+'('*s[0]
for i in range(n):
if(i==n-1):
s1=s1+str(s[i])+')'*s[i]
else:
s1=s... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def nest(istring,bal,new):
sub = []
base = istring[0]
for k in range(base):
sub.append('(')
bal+=1
sub.append(str(base))
for i in range(1,len(istring)):
p = istring[i]
if base > p:
for k in range(p, base):
sub.append(... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def nestingDepth(s):
ss=''
i=0
for c in s:
i=i-int(c)
while i<0:
ss=ss+'('
i=i+1
while i>0:
ss=ss+')'
i=i-1
ss=ss+c
i=int(c)
for _ in range(i):
ss=ss+')'
return ss
if __name__ == '__main__':
t=int(input())
for i in range(t):
s= input()
print("Case #"+str(i+1)+":",nestingDepth(s)) | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t=int(input())
m=1+t
while(t>0):
s=input()
S=[int(i) for i in s]
S.insert(0,0)
res=''
for i in range(1,len(S)):
a=S[i]-S[i-1]
if(a>0):
res+=str(('('*a)+str(S[i]))
elif(a<0):
res+=str(')'*(a*-1))+str(str(S[i]))
elif(S[i]-S[i-1]==0):
res+=str(S[i])
res+=str(')'*S[len(S)-1])... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def fun(res,s,k):
res+='('
while k<len(s) and s[k]=='1':
res+=s[k]
k+=1
res+=')'
return res,k
def fun1(res,s,k) :
f=int(s[k])
res+=('('*f)+str(f)+(')'*f)
return res,k+1
t=int(input())
for i in range(t):
s=input()
res=''
j=0
while j<len(s):
k=s[j]
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def fun1(res,s,k) :
f=int(s[k])
res+=('('*f)+str(f)+(')'*f)
return res,k+1
t=int(input())
for i in range(t):
s=input()
res=''
j=0
while j<len(s):
k=s[j]
if k=='0':
res+=k
j+=1
## elif k=='1':
## res,j=fun(res,s,j)
else :
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def process(digits):
open_brackets, parenthesis_string = 0, ""
for digit in digits:
number = ord(digit) - 48
while open_brackets < number:
parenthesis_string, open_brackets = parenthesis_string + '(', open_brackets + 1
while open_brackets > number:
parenthesis_s... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | for t in range(int(input())):
s = input()
s1 = ''
r = 0
for i in s:
n = int(i)
if n>r:
for k in range(n-r):
s1 += '('
elif n<r:
for k in range(r-n):
s1 += ')'
r = n
s1 += i
for k in range(int(s[-... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | num_cases = int(input())
for case in range(num_cases):
original_s = input()
answer = []
left = 0
for s in original_s:
if s == '0' and left:
answer += ([')'] * left)
answer.append('0')
left = 0
elif s == '0' and left == 0:
answer.append('0')
else:
# ~ print('else, s, left', s, left)
if left ... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | #!/usr/bin/env python3
import sys
for i, c in enumerate(sys.stdin.readlines()[1:]):
c = c.strip()
for z in range(1, 10):
p = 0
m = False
while p < len(c):
if c[p] not in '()' and (int(c[p]) >= z) != m:
if not m:
c = c[:p] + '(' + c[p:]
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import sys
t=int(input())
for ip in range(t):
n=[int(i) for i in input()]
ans=[]
for i in range(n[0]):
ans.append('(')
ans.append(n[0])
for i in range(len(n)-1):
pq=n[i+1]-n[i]
#print(pq)
if pq<0:
for j in range(abs(pq)):
ans.append(")")
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for _ in range(1, T+1):
s = input()
st = '(' * int(s[0])
for i in range(len(s)):
if i == len(s) - 1:
st = st + s[i] + ')' * int(s[i])
else:
if int(s[i]) - int(s[i+1]) < 0:
st = st + s[i] + '(' * (int(s[i+1]) - int(s[i]))
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t=int(input())
def check(s):
openn=0
st=""
for i in s:
num=int(i)
if openn<num:
st+="("*(num-openn)+i
openn+=(num-openn)
elif openn>num:
st+=")"*((openn-num))+i
openn-=(openn-num)
else:
st+=i
if openn>0:... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | #!/usr/bin/env python
import sys
def recur(dlist, depth):
if not dlist:
return ''
sd = min(dlist)
collect = ''
prefix = []
for d in dlist:
if d == sd:
collect += recur(prefix, sd)
collect += str(sd)
prefix = []
else:
prefix.ap... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
left = '('
right = ')'
for t in range(T):
S = input()
res = ''
balance = 0
for s in S:
if balance == s:
res += s
else:
dis = int(s) - balance
if dis > 0:
res += left*dis
elif dis < 0:
res +=... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | #!/usr/bin/env python3
import collections
# Algorithm
# read the digit one by one
# if digit is 0, do nothing, just push the digit directly to queue
# if current digit is smaller than previous digit, start pushing (Di+1 - Di) closing parenthesis to queue, then push the current digit
# if current digit is equal to previ... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | # raw_input() reads a string with a line of input, stripping the '\n' (newline) at the end.
# This is all you need for most Kickstart problems.
t = int(input()) # read a line with a single integer
for test in range(1, t + 1):
s = input()
result = ''
current_depth = 0
for c in s:
num = int(c)
if num =... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for i in range(t):
s = input()
o = []
ctr = 0
prev = 0
n = 0
for j in range(len(s)):
prev = n
n = int(s[j])
dif = n - prev
if dif > 0:
o.append(dif*'(')
ctr += dif
if dif < 0:
o.append(-1*dif*')')
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def main():
T = int(input())
S = [input() for _ in range(T)]
# print(S)
def exe(s):
result = ''
depth = 0
for c in s:
if int(c) == depth:
result = result + c
elif int(c) > depth:
result = result + '(' * (int(c) - depth) +... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for x in range(t):
output_string = ''
input_list = list(map(int,list(input().strip())))
prev = 0
flag = 1
tmp = ''
start_brack = 0
end_brack = 0
#print(input_list)
for i in input_list:
count = abs(i - prev)
if i > input_list[0] and flag:
f... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | # inInt
inInt = lambda: int(input())
# params
inTuple = lambda: tuple(map(int, input().split()))
# char list
inCharL = lambda: input().split()
# int list
inIntL = lambda: list(map(int, input().split()))
# output string of list
strL = lambda ans: ' '.join(map(str, ans))
# output
out = lambda tt, res: print("Case #{}: {}... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | cases = int(input())
for case in range(cases):
s = input()
depth = 0
result = ""
for c in s:
if depth > int(c):
result += ")" * (depth - int(c))
depth -= depth - int(c)
elif depth < int(c):
result += "(" * (int(c) - depth)
depth += int(c) - depth
result += c
result += ")... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | n = int(input())
for i in range(n):
word = list(input())
res = []
level = 0
for x in word:
while level < int(x):
res.append("(")
level += 1
while level > int(x):
res.append(")")
level -= 1
res.append(x)
while level > 0:
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for t in range(1, T+1):
s = input()
curr = 0
out = ''
for c in s:
val = int(c)
while curr < val:
out += '('
curr += 1
while curr > val:
out += ')'
curr -=1
out += c
while curr > 0:
curr -= 1... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read
def solve(I):
s = [int(i) for i in input()]
res = ""
v = 0
for i in s:
if i > v:res += "("*(i-v)
elif i < v: res += ")"*(v-i)
v = i
res += st... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(t,result,prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
retu... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import fileinput
import sys
def sol_coolo(S):
nested=0
res=''
for n in S:
n = int(n)
if nested > n:
for i in range(0, nested - n):
res += ')'
if nested < n:
for i in range(0, n - nested):
res += '('
nested = n
r... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
def solve(t,result,prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
ret... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
t = int(input()) # read a line with a single integer
for i in range(1, t + 1):
string = input()
string += "0"
nested = 0
answer = ""
for c in string:
while int(c) != nested:
while int(c) < nested:
answer += ")"
nested -= 1
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T=int(input())
def cut(s, n):
ans=''
state_n=True
last_n=0
last_not_n=0
for i in range(len(s)):
if int(s[i])!=n:
if state_n:
last_not_n=i
state_n=False
ans+=s[last_n:i]
else:
if not state_n:
last... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | from sys import stdin
# t test case
t = int(stdin.readline().rstrip())
for _ in range(t):
string = ''
list_num = list(map(int, stdin.readline().rstrip()))
for num in list_num:
string += '(' * num + str(num) + ')' * num
orig_len = len(string)
while 1: # do while loop
string = stri... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | # input() reads a string with a line of input, stripping the ' ' (newline) at the end.
# This is all you need for most Code Jam problems.
t = int(input()) # read a line with a single integer (number of cases)
for i in range(1, t + 1):
n = str(input()) # read the string with digits
s = ""
nbPar = 0
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
S_t = []
ans_t = []
for t in range(T):
S_t.append(list(map(int, input())))
for t in range(T):
S = S_t[t]
ans = ""
ans = ans + "(" * S[0] + str(S[0])
for i, n in enumerate(S[1:]):
i = i + 1
p = S[i - 1]
if p < n:
ans = ans + "(" * (n - p) + str(n)... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam |
def solve(t,result,prev):
if prev != '' and t != '':
if int(prev) > int(t[0]):
for i in range(int(prev)-int(t[0])):
result = result + ')'
if t == '':
for i in range(int(prev)):
result = result + ')'
return result
if int(t[0]) == 0:
ret... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for i in range(T):
S = input()
s = ''
last_num = 0;
for c in S:
num = int(c)
if last_num > num:
for j in range(last_num - num):
s += ')'
elif last_num < num:
for j in range(num - last_num):
s += '('
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | import fileinput
import sys
def sol_coolo(S):
nested=0
res=''
for n in S:
n = int(n)
if nested > n:
for i in range(0, nested - n):
res += ')'
if nested < n:
for i in range(0, n - nested):
res += '('
nested = n
r... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for tt in range(t):
s = input()
s2 = ''
balance = 0
for c in s:
x = int(c)
s2 += ('(' * (x - balance) if x > balance else ')' * (balance - x)) + c
balance = x
s2 += ')' * balance
print('Case #{}: {}'.format(tt + 1, s2))
| ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(S):
Sp = []
curr_d = 0
for d in S:
new_d = int(d)
diff = new_d - curr_d
if diff > 0:
Sp.append('(' * diff)
if diff < 0:
Sp.append(')' * -diff)
Sp.append(d)
curr_d = new_d
if curr_d > 0:
Sp.append(')' * curr_d)
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T=int(input())
A=[]
for x in range(T):
S=list(input())
b=0
i=0
while i<len(S):
I=S[i]
if I.isdigit():
I=int(I)
if b<I:
S.insert(i,"(")
b+=1
elif b>I:
S.insert(i,")")
b-=1
if i==len... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def solve(line):
if len(line) <= 0: return ""
s1 = []
for el in line:
n = int(el)
for i in range(n): s1.append('(')
s1.append(n)
for i in range(n): s1.append(')')
s2 = []
s2.append(s1.pop())
while len(s1) > 0:
a = s1.pop()
b = s2[-1]
... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | def f(S, t):
out = ""
counter = 0
for s in S:
if s == "0":
out += ")" * counter + s
counter = 0
elif int(s) - counter == 0:
out += s
elif int(s) - counter > 0:
out += "(" * abs(int(s) - counter) + s
counter += abs(int(s) - c... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | T = int(input())
for t in range(1, T+1):
print("Case #{0}: ".format(t), end='')
ans = ""
depth = 0
for d in [int(x) for x in list(input())]:
if d > depth:
ans += "(" * (d - depth)
depth = d
elif d < depth:
ans += ")" * (depth - d)
depth = d... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
google_code_jam | t = int(input())
for i in range(t):
s = [int(x) for x in list(input())]
s2 = ''
level = 0
for k in s:
if k != level:
if k > level:
s2 += '(' * (k - level)
s2 += str(k)
else:
s2 += ')' * (level - k )
s2 += str... | ['4\n0000\n101\n111000\n1\n', '100\n111001010110010101001110111100101000000101010101111100000110110110100011000011111111101011010011110\n010100001100100110001100110000110000001011101001010010010101011111111111001010100111010\n10101011110111010110110011110\n0100001110101\n101000101011010101111101011100101111100100001010... | ['Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)', 'Case #1: (111)00(1)0(1)0(11)00(1)0(1)0(1)00(111)0(1111)00(1)0(1)000000(1)0(1)0(1)0(1)0(11111)00000(11)0(11)0(11)0(1)000(11)0000(111111111)0(1)0(11)0(1)00(1111)0\nCase #2: 0(1)0(1)0000(11)00(1)00(11)000(11)00(11)0000(11)000000(1)0(111)0(1)00(1)0(1)00(... | {"contest": "2020qr", "problem_folder": "B"} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.