description stringlengths 171 4k | code stringlengths 94 3.98k | normalized_code stringlengths 57 4.99k |
|---|---|---|
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | L = int(input())
num = input()
rem = []
for i in range(1, L):
if num[i] != "0":
a = i
b = L - i
rem.append((max(a, b), max(a, b) + 1, i))
rem.sort()
ans = int(num[: rem[0][2]]) + int(num[rem[0][2] :])
for item in rem:
if item[0] > rem[0][1]:
break
tmp = int(num[: item[2]]) + ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR VAR ASSIGN VAR BIN_OP VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VAR VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER VAR EXPR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER N... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
ans = None
ml = None
for i in range(1, l):
if s[i] == "0":
continue
la = i
lb = l - i
ll = max(la, lb)
if ml is None or ml > ll:
ml = ll
for i in range(1, l):
if s[i] == "0":
continue
la = i
lb = l - i
ll = max(la, lb)
if ll > ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NONE ASSIGN VAR NONE FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR NONE VAR VAR ASSIGN VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | from sys import stdin, stdout
l = int(stdin.readline())
s = stdin.readline().strip()
mid = l // 2
front = s[:mid][::-1]
back = s[mid:]
i = 0
ll = len(back)
while i < ll:
if back[i] != "0":
break
i += 1
j = 0
ll = l - ll
while j < ll:
if front[j] != "0":
break
j += 1
best = int(s)
for lo... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR WHILE VAR VAR IF VAR VAR STRING VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR VAR WHILE VAR VAR IF VAR VAR STRING VAR NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
input = sys.stdin.readline
n = int(input())
x = input()
res = int(x)
idx = n // 2
for i in range(idx, 0, -1):
if x[i] == "0":
continue
res = min(res, int(x[i:]) + int(x[:i]))
break
for i in range(idx + 1, n):
if x[i] == "0":
continue
res = min(res, int(x[i:]) + int(x[:i])... | IMPORT ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR NUMBER FOR VAR FUNC_CALL VAR VAR NUMBER NUMBER IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBE... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
def valid(l):
return l > 0 and l < n
ANS = int(s)
def test(l):
if not valid(l):
return ANS
sL = s[:l]
sR = s[l:]
if sL[0] == "0":
return ANS
if sR[0] == "0":
return ANS
L = int(s[:l])
R = int(s[l:])
M = L + R
return M
l... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_DEF RETURN VAR NUMBER VAR VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_DEF IF FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR IF VAR NUMBER STRING RETURN VAR IF VAR NUMBER STRING RETURN VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def is_empty(x):
return len(x) == 0
def has_leading_zero(x):
return x[0] == "0"
def is_legal(x):
return is_empty(x) or not has_leading_zero(x)
def safe_to_int(x):
if len(x) == 0:
return 0
return int(x)
length_string = input()
number_string = input()
length = int(length_string)
ans = ... | FUNC_DEF RETURN FUNC_CALL VAR VAR NUMBER FUNC_DEF RETURN VAR NUMBER STRING FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_DEF IF FUNC_CALL VAR VAR NUMBER RETURN NUMBER RETURN FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR IF VAR NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
m = int(n)
for i in range(l // 2, l):
if n[i] != "0":
m = int(n[0:i]) + int(n[i:])
break
for i in range(l // 2, l):
if n[l - i] != "0":
print(min(m, int(n[0 : l - i]) + int(n[l - i :])))
break | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR IF VAR BIN_OP VAR VAR STRING EXPR FUNC_CALL VAR FUNC... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n % 2 == 0:
if s[n // 2] != "0":
print(int(s[: n // 2]) + int(s[n // 2 :]))
else:
ok = 0
for i in range(1, n // 2 + 1):
if ok == 1:
break
if s[n // 2 - i] != "0" and s[n // 2 + i] != "0":
ok = 1
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER IF VAR BIN_OP VAR NUMBER STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER IF VAR NUMBER IF VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
number = input()
ans = 0
def give_sum(split_point):
str1 = ""
for i in range(split_point):
str1 = str1 + number[i]
str2 = ""
for i in range(split_point, n):
str2 = str2 + number[i]
n1 = 0
n2 = 0
if str1 != "":
n1 = int(str1)
if str2 != "":
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR STRING FOR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR VAR VAR ASSIGN VAR STRING FOR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER IF VAR STRING ASSIGN VAR FUNC_CALL VAR VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
k = input()
mi = float("inf")
inda = n // 2
indb = n // 2
while inda < n and k[inda] == "0":
inda += 1
while indb >= 0 and k[indb] == "0":
indb -= 1
a = float("inf")
b = float("inf")
if inda < n:
a = int(k[:inda]) + int(k[inda:])
if inda + n % 2 < n and k[inda + n % 2] != "0":
a = min(a... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR STRING IF VAR VAR ASSIGN V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
n = int(input())
s = input()
k1 = int(s)
d = list(s)
mini = sys.maxsize
k = n // 2
if s[k] == "0":
lo, bo = 10**18, 10**18
for i in range(k, n):
if s[i] != "0":
z = n - i
b = int(s[:i]) + int(s[i:])
if s[z] != 0 and s[n - i] != "0":
a = int... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR BIN_OP VAR NUMBER IF VAR VAR STRING ASSIGN VAR VAR BIN_OP NUMBER NUMBER BIN_OP NUMBER NUMBER FOR VAR FUNC_CALL VAR VAR VAR IF VAR VAR STRING ASSIGN VAR BIN_OP VAR VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | le = int(input())
n = input()
l = le // 2
if le % 2 == 0:
l -= 1
r = le // 2
if le % 2 != 0:
r += 1
minSum = -1
while l >= 0 and r < le:
if int(n[l]) != 0:
s = int(n[:l]) + int(n[l:])
if minSum == -1 or s < minSum:
minSum = s
if int(n[r]) != 0:
s = int(n[:r]) + int(n[... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER IF BIN_OP VAR NUMBER NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER IF BIN_OP VAR NUMBER NUMBER VAR NUMBER ASSIGN VAR NUMBER WHILE VAR NUMBER VAR VAR IF FUNC_CALL VAR VAR VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
m = input()
if n % 2 == 0:
if m[n // 2] == "0":
k1 = n // 2
while m[k1] == "0":
k1 += 1
if k1 >= n:
break
k2 = n // 2
while m[k2] == "0":
k2 -= 1
if k2 <= 0:
break
if k1 == n:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER IF VAR BIN_OP VAR NUMBER STRING ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER IF VAR NUMBER IF VAR VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
arr = input()
arr1 = []
arr2 = []
arr3 = []
arr4 = []
if len(arr) % 2 == 0:
i = len(arr) // 2
j = len(arr) // 2 - 1
else:
i = len(arr) // 2
j = len(arr) // 2
while arr[i] == "0" and i < len(arr) - 1:
i += 1
while arr[j] == "0" and j > 0:
j -= 1
if i == len(arr):
i -= 1
if j ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR LIST ASSIGN VAR LIST ASSIGN VAR LIST IF BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def solve():
l = int(input())
x_s = input()
def calculate(split_pos):
return int(x_s[:split_pos]) + int(x_s[split_pos:])
lth = l
pos = -1
result = int(x_s)
for i in range(1, l):
if x_s[i] != "0":
dl = max(i, l - i)
if dl < lth:
pos = ... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_DEF RETURN BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP VAR VAR IF VAR VAR ASSIGN VAR V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
class BSplitANumber:
def __init__(self):
self.t = 0
def solve(self):
l = int(input())
n = input()
s = (l - 1) // 2
lo = s
hi = s + 1
while lo >= 0 and n[lo] == "0":
lo -= 1
while hi < l and n[hi] == "0":
hi +=... | IMPORT CLASS_DEF FUNC_DEF ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR STRI... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
inf = 10**10**5 + 1
n = input()
if l % 2:
k1 = l // 2
while n[k1] == "0":
k1 -= 1
if k1:
n1 = int(n[:k1]) + int(n[k1:])
else:
n1 = inf
k2 = l // 2 + 1
while n[k2] == "0":
k2 += 1
if k2 == l:
n2 = inf
break
else:... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP NUMBER BIN_OP NUMBER NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER IF VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR ASSIGN VAR BIN_OP BIN_OP VAR N... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
def rint():
return map(int, sys.stdin.readline().split())
def cal_sum(s):
return int(n[:s]) + int(n[s:])
def is_valid_left(sl):
return sl > 0 and n[sl] != "0"
def is_valid_right(sr):
return sr < l and n[sr] != "0"
l = int(input())
n = input()
sl_ori = l // 2
sr_ori = l // 2 + l % 2
... | IMPORT FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_DEF RETURN VAR NUMBER VAR VAR STRING FUNC_DEF RETURN VAR VAR VAR VAR STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = [*map(int, input())]
def f(i):
a = s[:i]
b = s[i:]
c = []
carry = 0
while a or b:
c.append((a if a else [0]).pop() + (b if b else [0]).pop() + carry)
carry = c[-1] // 10
c[-1] %= 10
c.reverse()
return c
def key(x, y):
if len(x) != len(y):
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR LIST FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR ASSIGN VAR LIST ASSIGN VAR NUMBER WHILE VAR VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR VAR LIST NUMBER FUNC_CALL VAR VAR LIST NUMBER VAR ASSIGN VAR BIN_OP VAR NUMBER NUMBER VAR N... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | length = int(input())
number = input().strip()
lStart = length // 2
if length % 2 == 0:
rStart = length // 2
else:
rStart = length // 2 + 1
lCut = 0
for i in reversed(range(1, lStart + 1)):
rSubstring = number[i:length]
if not rSubstring.startswith("0"):
lCut = i
break
rCut = -1
for i in... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR VAR VAR VAR IF FUNC_CALL VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
a = input()
i = l // 2
if l % 2 == 0:
if a[i] != "0":
s1 = ""
s2 = ""
for x in range(0, i):
s1 += a[x]
for x in range(i, l):
s2 += a[x]
num1 = int(s1)
num2 = int(s2)
print(num1 + num2)
else:
x = i
y ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER IF BIN_OP VAR NUMBER NUMBER IF VAR VAR STRING ASSIGN VAR STRING ASSIGN VAR STRING FOR VAR FUNC_CALL VAR NUMBER VAR VAR VAR VAR FOR VAR FUNC_CALL VAR VAR VAR VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
ret = int(s)
testing = 2
def debug(s):
if testing == 1:
print(s)
def check(middle, dir):
global s
while middle > 0 and middle < l - 1 and s[middle] == "0":
debug(middle)
middle += dir
s1 = s[:middle]
s2 = s[middle:]
if s1 == "" or s2 == ""... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FUNC_DEF IF VAR NUMBER EXPR FUNC_CALL VAR VAR FUNC_DEF WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR VAR STRING EXPR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR IF VAR STRING VAR STRING RETURN... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n % 2 == 0:
fir = n // 2 - 1
sec = n // 2
while fir >= 0 and s[fir] == "0":
fir -= 1
while sec < n and s[sec] == "0":
sec += 1
if sec == n:
temp1 = int(s[fir:])
temp2 = int(s[:fir])
print(temp2 + temp1)
elif fir == 0:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def t(c):
one = a // 2
two = a // 2 + a % 2
if sum((int(c[:two]), int(c[-one:]))) > sum((int(c[:one]), int(c[-two:]))):
return c[:one], c[-two:]
return c[:two], c[-one:]
def f1(a, b):
while b[0] == "0":
b = a[-1] + b
a = a[:-1]
if a == "":
a = "0"
if b == ""... | FUNC_DEF ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER IF FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR RETURN VAR VAR VAR VAR RETURN VAR VAR VAR VAR FUNC_DEF WHILE VAR NUMBER STRING ASSIGN VAR BIN_OP VAR NUMBER V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
def solvef(n, i):
while n[i] == "0":
i = i + 1
if i == len(n):
return 1000000000000000
n1 = n[0:i]
n2 = n[i:]
return int(n1) + int(n2)
def solveb(n, i):
while n[i] == "0":
i = i - 1
if i == -1:
return 1000000000... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_DEF WHILE VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER IF VAR FUNC_CALL VAR VAR RETURN NUMBER ASSIGN VAR VAR NUMBER VAR ASSIGN VAR VAR VAR RETURN BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_DEF WHILE VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER IF V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def main():
N = int(input())
S = str(input())
mid = 100010
C = 10**mid
for i in range(1, N):
if S[i] != "0":
mid = min(mid, max(i, N - i) + 2)
for i in range(1, N):
if S[i] != "0" and max(i, N - i) <= mid:
T = int(S[:i]) + int(S[i:])
C = min(C,... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR BIN_OP NUMBER VAR FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING FUNC_CAL... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
mx = int(s)
half = l // 2
half += 1
i = half
while i < l:
if s[i] != "0":
break
i = i + 1
if i <= l - 1:
pref = int(s[:i])
suff = int(s[i:])
mx = min(mx, pref + suff)
i = half - 1
while s[i] == "0":
i = i - 1
if i >= 1:
pref = int(s[:i])
suff = int(s[... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR VAR WHILE VAR VAR IF VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER IF VAR BIN_OP VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
ans = float("inf")
temp = 1
mid1 = l // 2
mid2 = l // 2
while mid1 < l and int(n[mid1]) == 0:
mid1 += 1
while mid2 >= 0 and int(n[mid2]) == 0:
mid2 -= 1
if mid1 != l:
ans = min(ans, int(n[0:mid1]) + int(n[mid1:l]))
if mid2 >= 1:
ans = min(ans, int(n[0:mid2]) + int(n[mid2:l])... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR FUNC_CALL VAR VAR VAR NUMBER VAR NUMBER WHILE VAR NUMBER FUNC_CALL VAR VAR VAR NUMBER VAR NUMBER IF VAR VAR ASSIGN VAR FUNC_CALL VAR V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | totlen = []
def mykey(ele):
return max(ele + 1, totlen[0] - ele)
def mykey2(ele):
return max(ele, totlen[0] - ele - 1)
k = int(input())
num = list(input())
possible = []
totlen.append(len(num))
for i in range(1, totlen[0]):
if num[i] == "0":
continue
possible.append(i)
possible.sort(key=my... | ASSIGN VAR LIST FUNC_DEF RETURN FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR FUNC_DEF RETURN FUNC_CALL VAR VAR BIN_OP BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR LIST EXPR FUNC_CALL VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
j = 0
k = 0
if n % 2 == 0:
if s[n // 2] != "0":
print(int(s[: n // 2]) + int(s[n // 2 :]))
else:
for i in range(n):
if s[i] != "0" and i < n // 2:
j = i
elif s[i] != "0":
k = i
break
if j... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER IF BIN_OP VAR NUMBER NUMBER IF VAR BIN_OP VAR NUMBER STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER FOR VAR FUNC_CALL VAR VAR IF VAR VAR STRING VAR BIN_OP VAR NUM... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
l = list(input())
inf = -1
ans = 0
left = []
right = []
for i in range(1, n // 2 + n % 2):
if l[i] != "0":
left.append(i)
for i in range(n // 2, n):
if l[i] != "0":
right.append(i)
for i in range(len(left) - 1, max(len(left) - 3, 0) - 1, -1):
if ans == 0:
ans = int("... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR LIST ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR STRING EXPR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR IF VAR VAR STRING... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
if l % 2 == 0:
left = l // 2
right = l // 2
while left >= 1 and n[left] == "0":
left -= 1
while right < l and n[right] == "0":
right += 1
if left == 0:
print(int(n[:right]) + int(n[right:]))
elif right == l:
print(int(n[:left]) + int(n... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
i1 = l // 2
i2 = i1 + 1
i3 = i1 - 1
i4 = i2 + 1
p1 = p2 = p3 = p4 = int(s)
if i1 < l and i1 >= 0:
while i1 > 0 and s[i1] == "0":
i1 -= 1
if i1 > 0:
p1 = int(s[i1:]) + int(s[:i1])
if i2 < l and i2 >= 0:
while i2 < l and s[i2] == "0":
i2 += 1
if i2 < l:... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR IF VAR VAR VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER IF VAR NUMBER ASSIGN VAR BIN_OP FU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
possible = []
for i in range(1, l):
if s[i] is not "0":
possible.append(i)
good = [possible[0]]
digits1 = good[0]
digits2 = l - digits1
maxdigits = max(digits1, digits2) + 1
for p in possible:
digits1 = p
digits2 = l - digits1
localmax = max(digits1, digits2) + 1
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING EXPR FUNC_CALL VAR VAR ASSIGN VAR LIST VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER FOR VAR VAR ASSIGN VAR VAR ASSIGN VAR BIN_OP... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def do(s, j):
return int(s[:j]) + int(s[j:])
def main():
n = int(input())
x = input()
mid = n // 2
cnt = 0
best = None
for i in range(mid + 2):
j = mid + i
if j < n and x[j] != "0":
val = do(x, j)
cnt += 1
if best is None:
... | FUNC_DEF RETURN BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NONE FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR VAR IF VAR VAR VAR VAR STRING ASSIGN VAR FUNC_CALL VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input().strip())
str = input()
ans = 1e1000
pos = int(n / 2 - 1)
while pos >= 0 and str[pos + 1] == "0":
pos = pos - 1
if pos >= 0 and str[pos + 1] != "0":
suma = int(str[0 : pos + 1])
sumb = int(str[pos + 1 : n + 1])
sum = suma + sumb
if sum < ans:
ans = sum
pos = int(n / 2 - 1)
whi... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER STRING ASSIGN VAR BIN_OP VAR NUMBER IF VAR NUMBER VAR BIN_OP VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR VAR NUMBER BIN_OP VAR NUMBER... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n == 2:
print(int(s[0]) + int(s[1]))
exit(0)
mid = n // 2
tmid = mid
INF = pow(10, 50002)
ras = INF
ans = INF
while tmid < n - 1:
if s[tmid + 1] != "0":
a = int(s[0 : tmid + 1])
b = int(s[tmid + 1 :])
ras = a + b
break
tmid += 1
if ras != I... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR VAR ASSIGN VAR VAR WHILE VAR BIN_OP VAR NUMBER... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
L = int(input())
S = input()
res = 0
if L % 2 == 1:
for i in range(int(L / 2)):
if S[int(L / 2) + i + 1] != "0" or S[int(L / 2) - i] != "0":
if S[int(L / 2) + i + 1] != "0":
res = int(S[0 : int(L / 2) + i + 1]) + int(S[int(L / 2) + i + 1 : L])
if (
... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER IF BIN_OP VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER IF VAR BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR NUMBER VAR NUMBER STRING VAR BIN_OP FUNC_CALL VAR BIN_OP VAR NUMBER VAR STRING IF VAR BIN_OP BIN_OP FUN... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | a = int(input())
n = input()
INF = 1e1000
res = INF
wei = INF
for i in range(1, a):
if n[i] != "0":
wei = min(wei, max(i, a - i))
for i in range(1, a):
if n[i] != "0" and max(i, a - i) <= wei:
res = min(int(n[:i]) + int(n[i:]), res)
wei = max(i, a - i)
print(res) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR BIN_OP VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING FUNC_CALL VAR VAR BIN_OP VAR VAR VAR ASSIGN ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def v(s):
return len(s) > 0 and s[0] != "0"
def i(s):
try:
return int(s)
except:
return 0
n = int(input())
s = input()
a = n // 2
b = n // 2 + 1
while a > 0 and s[a] == "0":
a -= 1
while b < n and s[b] == "0":
b += 1
print(min(i(s[:a]) + i(s[a:]), i(s[:b]) + i(s[b:]))) | FUNC_DEF RETURN FUNC_CALL VAR VAR NUMBER VAR NUMBER STRING FUNC_DEF RETURN FUNC_CALL VAR VAR RETURN NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR N... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n, c = int(input()), input()
x, y = n // 2, (n + 1) // 2
while x >= 1 and y < n:
if c[x] == "0" and c[y] == "0":
x -= 1
y += 1
continue
a = int(c[:x]) + int(c[x:])
b = int(c[:y]) + int(c[y:])
if c[x] == "0":
print(b)
elif c[y] == "0":
print(a)
else:
... | ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR BIN_OP VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR NUMBER VAR VAR IF VAR VAR STRING VAR VAR STRING VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
if l % 2:
flag = False
for i in range(1, l // 2 + 1):
seg1 = int(l / 2 + i)
seg2 = int(l / 2 - i) + 1
ans1 = -1
ans2 = -1
if n[seg1] != "0":
flag = True
ans1 = int(n[:seg1]) + int(n[seg1:])
if n[seg2] != "0":
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP BIN_OP VAR NUMBER VAR ASSIGN VAR BIN_OP FUNC_CALL VAR BIN_OP BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBE... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
ans = float("inf")
if l < 20:
for i in range(1, l):
x = int(n[:i])
y = n[i:]
if y[0] != "0":
ans = min(ans, x + int(y))
else:
s = list(n)
ind = []
cur = l
for i in range(1, l):
if s[i] != "0":
num = float("inf")
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING IF VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR VAR IF VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST A... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
first = l // 2 + 1
second = l // 2
while second < l and n[second] == "0":
second += 1
while n[first] == "0":
first -= 1
ans = -1
if second == l:
ans = int(n[0:first]) + int(n[first:l])
elif first == 0:
ans = int(n[0:second]) + int(n[second:l])
else:
ans = min(int(n[0:sec... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER WHILE VAR VAR STRING VAR NUMBER ASSIGN VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUM... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def sum(a, b):
if len(a) < len(b):
a, b = b, a
k = len(a) - 1
k2 = len(b) - 1
i = k
j = k2
ost = 0
while j >= 0:
sum = int(b[j]) + int(a[i]) + ost
ost = sum // 10
sum %= 10
a[i] = str(sum)
i -= 1
j -= 1
while i >= 0 and ost != 0:
... | FUNC_DEF IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR NUMBER WHILE VAR NUMBER ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR BIN_OP VAR NUM... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = str(input())
def sum(x):
return int(n[:x]) + int(n[x:])
if l % 2 == 0:
left = l // 2 - 1
right = l // 2
while n[left] == "0":
left -= 1
while right < l and n[right] == "0":
right += 1
if right - left == 1:
print(sum(right))
elif right == l:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def main():
l = int(input())
s = input()
if l % 2 == 0:
left = l // 2
right = l // 2
else:
left = l // 2
right = l // 2 + 1
while True:
if right == left:
if s[right] == "0":
left -= 1
right += 1
else:
... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE NUMBER IF VAR VAR IF VAR VAR STRING VAR NUMBER VAR NUMBER ASSIGN VAR FUNC_CALL VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n % 2:
k = n // 2
if s[k] != "0":
ans = int(s[:k]) + int(s[k:])
if s[k + 1] != "0":
ans1 = int(s[: k + 1]) + int(s[k + 1 :])
ans = min(ans, ans1)
else:
p = k + 1
while p < len(s) and s[p] == "0":
p += 1
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER IF VAR VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF VAR BIN_OP VAR NUMBER STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER ASSI... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | k = int(input())
a = input()
m = int(a)
sub = []
ii = (k - 1) // 2
jj = ii + 1
while ii > 0 or jj < k:
if ii > 0:
if a[ii] != "0":
sub.append(ii)
ii -= 1
if jj < k:
if a[jj] != "0":
sub.append(jj)
jj += 1
for i in sub[:2]:
m = min(m, int(a[:i]) + int(a... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR IF VAR NUMBER IF VAR VAR STRING EXPR FUNC_CALL VAR VAR VAR NUMBER IF VAR VAR IF VAR VAR STRING EXPR FUNC_CALL VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | le = int(input())
num = input()
data = [-1] * 4
mid = le // 2
for i in range(mid + 1, le):
if num[i] != "0":
if data[2] == -1:
data[2] = i
else:
data[3] = i
break
for i in range(mid, -1, -1):
if num[i] != "0":
if data[1] == -1:
data[1] = i
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR IF VAR VAR STRING IF VAR NUMBER NUMBER ASSIGN VAR NUMBER VAR ASSIGN VAR NUMBER VAR FOR VAR FUNC_CALL VAR VAR NUMBER NUMBER IF VAR VAR STRING IF VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def getSum(s, rhInd):
r1 = rhInd
while r1 >= 0 and s[r1] == "0":
r1 -= 1
if r1 == 0:
s1 = int(s)
else:
s1 = int(s[:r1]) + int(s[r1:])
r2 = rhInd
while r2 < len(s) and s[r2] == "0":
r2 += 1
if r2 == len(s):
s2 = int(s)
else:
s2 = int(s[:r2])... | FUNC_DEF ASSIGN VAR VAR WHILE VAR NUMBER VAR VAR STRING VAR NUMBER IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR WHILE VAR FUNC_CALL VAR VAR VAR VAR STRING VAR NUMBER IF VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP FUNC_CA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
a = s[: n // 2 + n % 2]
b = s[n // 2 + n % 2 :]
ch1 = ch3 = int(a)
ch2 = ch4 = int(b)
fa = 0
for i in range(len(a) - 1, 0, -1):
if a[i] != "0":
fa = i
break
for i in range(len(b)):
if b[i] != "0":
fb = i
break
if b[0] == "0":
if fa != 0:
c... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def findSum(str1, str2):
if len(str1) > len(str2):
t = str1
str1 = str2
str2 = t
str = ""
n1 = len(str1)
n2 = len(str2)
str1 = str1[::-1]
str2 = str2[::-1]
carry = 0
for i in range(n1):
sum = ord(str1[i]) - 48 + (ord(str2[i]) - 48 + carry)
str += c... | FUNC_DEF IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR VAR NUMBER BIN_OP BI... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
b = input()
flag = 0
newRange = 5
oldRange = 0
ans = int(b)
if n < 20:
for i in range(0, len(b) - 1):
if b[i + 1] != "0":
ans = min(ans, int(b[0 : i + 1]) + int(b[i + 1 :]))
while flag == 0 and newRange <= n:
for i in range(n // 2 - newRange, n // 2 - oldRange):
if i... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR IF VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER IF VAR BIN_OP VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR NUMBER BIN_O... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
mini = 1000000000
for i in range(1, n):
if s[i] != "0":
mini = min(mini, max(i, n - i) + 1)
res = 0
for i in range(1, n):
if s[i] != "0" and max(i, n - i) + 1 == mini:
d = int(s[0:i]) + int(s[i:n])
if res == 0 or res > d:
res = d
print(res) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING BIN_OP FUNC_CALL VAR VAR BIN_OP VAR VAR NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n % 2 == 0:
t1 = n // 2 - 1
t2 = n // 2
while s[t1] == "0":
t1 -= 1
while t2 < n and s[t2] == "0":
t2 += 1
if t2 == n:
ans = int(s[:t1]) + int(s[t1:])
elif t1 > 0:
ans = min(int(s[:t2]) + int(s[t2:]), int(s[:t1]) + int(s[t1:]))
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF VAR NUMB... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
sys.setrecursionlimit(150000)
n = int(input())
str1 = input()
mid = n // 2
ck1 = mid - 1
ck2 = mid
fl1 = fl2 = 0
while ck1 >= 0:
if str1[ck1 + 1] != "0":
fl1 = 1
break
ck1 = ck1 - 1
while ck2 < n - 1:
if str1[ck2 + 1] != "0":
fl2 = 1
break
ck2 = ck2 + 1
in1 = ... | IMPORT EXPR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR NUMBER WHILE VAR NUMBER IF VAR BIN_OP VAR NUMBER STRING ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR BIN_OP VAR NUMBER IF V... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
poz = []
if n < 100:
for i in range(1, n):
if s[i] != "0":
poz.append(i)
else:
pol = n // 2
a, b = pol - 1, pol
while a > 0 and s[a] == "0":
a -= 1
if a > 0 and s[a] != "0":
poz.append(a)
while a > 0 and s[a] == "0":
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST IF VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR IF VAR VAR STRING EXPR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR BIN_OP VAR NUMBER VAR WHILE VAR NUMBER VAR VAR STRING VAR NUMBER IF VAR NUMBER VAR VAR STRING EXPR FUNC_CALL... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | len = int(input())
number = input()
mid1 = len // 2
while mid1 > 0 and number[mid1] == "0":
mid1 -= 1
mid2 = (len + 1) // 2
while mid2 < len and number[mid2] == "0":
mid2 += 1
num11 = int(number[0:mid1]) if mid1 > 0 else 0
num12 = int(number[mid1:]) if mid1 < len else 0
num21 = int(number[0:mid2]) if mid2 > 0 e... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER ASSIGN VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER VAR NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR VAR VAR NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | L = int(input())
X = input()
ans = float("inf")
cnt = 0
idx = L // 2
while cnt < 5 and idx >= 1:
if X[idx] != "0":
ans = min(ans, int(X[:idx]) + int(X[idx:]))
cnt += 1
idx -= 1
cnt = 0
idx = L // 2
while cnt < 5 and idx < L:
if X[idx] != "0":
ans = min(ans, int(X[:idx]) + int(X[idx:]... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR NUMBER IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR VAR NUMBER VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
input = lambda: sys.stdin.readline().strip("\r\n")
l = int(input())
n = input()
ans = float("inf")
if l % 2 == 0:
mid = l // 2
r = mid
l = mid
while True:
if n[r] != "0":
ans = min(ans, int(n[:r]) + int(n[r:]))
if n[l] != "0":
ans = min(ans, int(n[:l])... | IMPORT ASSIGN VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR WHILE NUMBER IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
st = l // 2
if l % 2 != 0 and int(n[: st + 1]) < int(n[st:]):
st += 1
if n[st] != "0":
sum = int(n[:st]) + int(n[st:])
else:
ip = st
while n[ip] == "0" and ip < l - 1:
ip += 1
il = st
while n[il] == "0":
il -= 1
if il == 0:
sum = int(n[:ip... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER IF BIN_OP VAR NUMBER NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR VAR VAR NUMBER IF VAR VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR WHILE VAR VAR STRING VAR BIN_OP VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
number = int(input())
s = str(number)
def nextNum(num):
if num < l / 2:
return l - num
else:
return l - 1 - num
m = l // 2
while s[m] == "0":
m = nextNum(m)
f = int(s[:m]) + int(s[m:])
next = nextNum(m)
if next > 0 and s[next] != "0":
g = int(s[:next]) + int(s[next:]... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_DEF IF VAR BIN_OP VAR NUMBER RETURN BIN_OP VAR VAR RETURN BIN_OP BIN_OP VAR NUMBER VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
l = n // 2
r = (n + 1) // 2
while s[l] == "0" == s[r]:
l -= 1
r += 1
f = []
if l and s[l] != "0":
f.append(int(s[:l]) + int(s[l:]))
if r < n and s[r] != "0":
f.append(int(s[:r]) + int(s[r:]))
print(min(f)) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR VAR STRING VAR VAR VAR NUMBER VAR NUMBER ASSIGN VAR LIST IF VAR VAR VAR STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF VAR VAR VAR VAR STRING... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
if l & 1 == 0:
if n[l // 2] != "0":
print(int(n[: l // 2]) + int(n[l // 2 :]))
else:
ind = l // 2
while ind < l and n[ind] == "0":
ind += 1
if ind >= l:
temp1 = int(n[:ind])
else:
temp1 = int(n[:ind]) + int(... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER IF VAR BIN_OP VAR NUMBER STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR FUNC_CA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | input()
a = input()
lena = len(a)
x = lena // 2
y = x + 1
while a[x] == "0":
x -= 1
while y < lena - 1 and a[y] == "0":
y += 1
s = []
inf = int("9" * 100001)
def sum(x):
try:
b = int(a[:x])
c = int(a[x:])
1 / int(a[x:][0])
res = b + c
except Exception:
res = inf... | EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER WHILE VAR BIN_OP VAR NUMBER VAR VAR STRING VAR NUMBER ASSIGN VAR LIST ASSIGN VAR FUNC_CALL VAR BIN_OP STRING NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = input()
n = input()
l = int(l)
k = int(n)
if l == 1:
print(n)
elif l == 2 and k % 10 == 0:
print(int(n[0]) + int(n[1]))
else:
mid = int(l / 2)
p = mid
x = mid
while p < l:
if n[p] == "0":
p = p + 1
else:
break
while x >= 0:
if n[x] == "0":
... | ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR VAR IF VAR NUMBER BIN_OP VAR NUMBER NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR VAR AS... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
l = n // 2
i = l
j = l + 1
k1 = 0
k2 = 0
while i > 0 and s[i] == "0":
i -= 1
while j < n and s[j] == "0":
j += 1
if j != n:
k2 = int(s[:j]) + int(s[j:])
if i == 0:
print(k2)
elif j == n:
k1 = int(s[:i]) + int(s[i:])
print(k1)
else:
k1 = int(s[:i]) + int(s[i:])
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def calc(i):
res = -1
a = s[0 : i + 1]
b = s[i + 1 :]
if b[0] != "0":
if res == -1:
res = int(a) + int(b)
else:
res = min(int(a) + int(b), res)
return res
n = int(input())
s = input()
x = n // 2
y = (n + 1) // 2
a = []
for i in range(n):
l = x - i - 1
... | FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR VAR BIN_OP VAR NUMBER IF VAR NUMBER STRING IF VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR VAR RETURN VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
mid = l // 2
choose = []
for i in range(mid, l):
if n[i] == "0":
continue
choose.append(int(n[:i]) + int(n[i:]))
if len(choose) >= 3:
break
for i in range(1, mid)[::-1]:
if n[i] == "0":
continue
choose.append(int(n[:i]) + int(n[i:]))
if len(ch... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR VAR IF VAR VAR STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF FUNC_CALL VAR VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR NUMBER IF VAR VAR STRING EXPR FU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def gns():
return list(map(int, input().split()))
n = int(input())
s = input()
def sm(x):
ans = []
l = 0
i, j = x, n - 1
while i >= 0 or j > x:
if i >= 0:
si = s[i]
else:
si = 0
sj = s[j] if j > x else 0
t = int(si) + int(sj) + l
l ... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR LIST ASSIGN VAR NUMBER ASSIGN VAR VAR VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR IF VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR VAR VAR VAR VAR N... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if "0" not in s:
if n % 2 == 0:
print(int(s[: n // 2]) + int(s[n // 2 :]))
else:
print(
min(
int(s[: n // 2]) + int(s[n // 2 :]),
int(s[: n // 2 + 1]) + int(s[n // 2 + 1 :]),
)
)
else:
right = -1
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF STRING VAR IF BIN_OP VAR NUMBER NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER BIN_... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
a = int(input())
s = str(a)
l = []
for i in range(int(n / 2), n):
if s[i] != "0":
l.append(int(s[i:]) + int(s[:i]))
break
if n > 2:
for i in range(int(n / 2) + 1, 0, -1):
if s[i] != "0":
l.append(int(s[i:]) + int(s[:i]))
break
print(min(l)) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR IF VAR VAR STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR IF VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP FUNC_CAL... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def solve_left(num, len):
x = num[0 : (len + 1) // 2]
y = num[(len + 1) // 2 : len]
ptr = 1
while y.startswith("0"):
x = num[0 : (len + 1) // 2 - ptr]
y = num[(len + 1) // 2 - ptr : len]
ptr = ptr + 1
if y == num:
return int(y)
return int(x) + int(y)
def... | FUNC_DEF ASSIGN VAR VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR VAR BIN_OP BIN_OP VAR NUMBER NUMBER VAR ASSIGN VAR NUMBER WHILE FUNC_CALL VAR STRING ASSIGN VAR VAR NUMBER BIN_OP BIN_OP BIN_OP VAR NUMBER NUMBER VAR ASSIGN VAR VAR BIN_OP BIN_OP BIN_OP VAR NUMBER NUMBER VAR VAR ASSIGN VAR BIN_OP VAR NUMBER IF VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input().strip()
ans = int(s)
mid = n // 2 + 1
mid1 = n // 2
while mid < n and s[mid] == "0":
mid = mid + 1
while mid1 > 0 and s[mid1] == "0":
mid1 = mid1 - 1
try:
if mid1 > 0:
ans = min(ans, int(s[0:mid1]) + int(s[mid1:]))
if mid < n:
ans = min(ans, int(s[0:mid]) + i... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER IF VAR NUMBER ASSIGN VAR F... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
for i in range(l // 2, 0, -1):
if s[i] != "0" and s[l - i] != "0":
print(min(int(s[:i]) + int(s[i:]), int(s[: l - i]) + int(s[l - i :])))
break
elif s[i] != "0":
print(int(s[:i]) + int(s[i:]))
break
elif s[l - i] != "0":
print(int(s[: l - ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER IF VAR VAR STRING VAR BIN_OP VAR VAR STRING EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR VAR FUNC_CALL VAR VAR BIN_OP VAR VAR I... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
l = int(input())
S = input()
if l % 2 == 0:
m2 = l // 2
m1 = m2 - 1
if S[m2] != "0":
print(int(S[:m2]) + int(S[m2:]))
sys.exit()
m2 += 1
else:
m1 = l // 2
m2 = m1 + 1
while S[m1] == "0" and S[m2] == "0":
m1 -= 1
m2 += 1
if S[m1] != "0" and S[m2] != "0":
pr... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER IF VAR VAR STRING EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR EXPR FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_O... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
ns = input()
rr = l // 2
ll = (l + 1) // 2
def gett(x):
return int(ns[:x]) + int(ns[x:])
for _ in range(l):
if (ll >= 1 and ns[ll] != "0") and (rr < l and ns[rr] != "0"):
ansl = gett(ll)
ansr = gett(rr)
print(min(ansl, ansr))
break
if ll >= 1 and ns[ll] !... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER FUNC_DEF RETURN BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR VAR IF VAR NUMBER VAR VAR STRING VAR VAR VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
pos1 = l // 2
pos2 = pos1 + 1
while pos1 >= 0 and n[pos1] == "0":
pos1 -= 1
while pos2 < l and n[pos2] == "0":
pos2 += 1
s1 = int("0" + n[:pos1]) + int("0" + n[pos1:])
s2 = int("0" + n[:pos2]) + int("0" + n[pos2:])
print(min(s1, s2)) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR BIN_OP STRING VAR VAR FUNC_CALL VAR BIN_OP STRING VAR VAR ASSIGN VAR BIN_OP FUNC_CA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
ans = float("inf")
if l & 1:
i, j = l // 2, l // 2 + 1
while j < l and n[j] == "0":
j += 1
while i > 0 and n[i] == "0":
i -= 1
if i:
ans = min(ans, int(n[:i]) + int(n[i:]))
if j != l:
ans = min(ans, int(n[:j]) + int(n[j:]))
print(ans)
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING IF BIN_OP VAR NUMBER ASSIGN VAR VAR BIN_OP VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER IF VAR ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
a = int(input())
b = str(a)
t = [0] * n
counter = 0
x = 1
y = n - 1
z = 0
for i in range(n - 1, 0, -1):
if b[i] != "0":
t[z] = [max(x, y) + 1, x]
z += 1
x += 1
y -= 1
temp = [0] * z
for i in range(z):
temp[i] = t[i]
if z == 1:
x1 = pow(10, temp[0][1])
a1 = a // x... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER IF VAR VAR STRING ASSIGN VAR VAR LIST BIN_... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input().strip()
k = l // 2
ans = int(n)
def getLeft(i):
while i >= 0:
if n[i] is not "0":
break
else:
i = i - 1
return i
def getRight(i, l):
while i < l:
if n[i] is not "0":
break
else:
i = i + 1
ret... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR FUNC_DEF WHILE VAR NUMBER IF VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER RETURN VAR FUNC_DEF WHILE VAR VAR IF VAR VAR STRING ASSIGN VAR BIN_OP VAR NUMBER RETURN VAR IF BIN_OP VAR NUMBER NU... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | len_num = int(input())
num_str = input()
len_1 = len_num // 2
len_2 = len_1
if len_num & 1:
len_2 += 1
flag = 0
ans = 0
while True:
if num_str[len_1] != "0":
num1 = int(num_str[:len_1]) + int(num_str[len_1:len_num])
ans = num1
flag = 1
if len_2 < len_num and num_str[len_2] != "0":
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR IF BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER WHILE NUMBER IF VAR VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR VAR ASSIGN VAR NUMBER IF VAR VAR VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def string_sum(str1, str2):
if len(str1) > len(str2):
t = str1
str1 = str2
str2 = t
str = ""
n1 = len(str1)
n2 = len(str2)
str1 = str1[::-1]
str2 = str2[::-1]
carry = 0
for i in range(n1):
sum = ord(str1[i]) - 48 + (ord(str2[i]) - 48 + carry)
str +... | FUNC_DEF IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR VAR NUMBER BIN_OP BI... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def main():
n = int(input())
s = input()
s2 = ""
s1 = ""
mid = n // 2
l = mid
while s[l] == "0":
l -= 1
for i in range(l, n, 1):
s2 += s[i]
for i in range(0, l, 1):
s1 += s[i]
if len(s1) and len(s2):
sum1 = int(s1) + int(s2)
else:
sum1 ... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR STRING ASSIGN VAR STRING ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR VAR WHILE VAR VAR STRING VAR NUMBER FOR VAR FUNC_CALL VAR VAR VAR NUMBER VAR VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR NUMBER VAR VAR VAR IF FUNC_CALL VAR VAR FUNC_CALL VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
t = n // 2
s = input()
while s[t] == "0":
t -= 1
k = n // 2 + 1
while k < len(s) and s[k] == "0":
k += 1
ans1 = -1
ans2 = -1
if t > 0:
ans1 = int(s[:t]) + int(s[t:])
if k < len(s):
ans2 = int(s[:k]) + int(s[k:])
if ans1 == -1:
print(ans2)
elif ans2 == -1:
print(ans1)
else:
p... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR FUNC_CALL VAR WHILE VAR VAR STRING VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR FUNC_CALL VAR VAR VAR VAR STRING VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CAL... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
ans = float("inf")
for i in range(n // 2, n - 1):
if s[i + 1] != "0":
ans = min(ans, int(s[: i + 1]) + int(s[i + 1 :]))
break
for i in range(n // 2 - 1, -1, -1):
if s[i + 1] != "0":
ans = min(ans, int(s[: i + 1]) + int(s[i + 1 :]))
break
print(ans) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER IF VAR BIN_OP VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR BIN_OP VAR NUMBER FOR VAR FUNC_CALL VAR BIN_... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
s = input()
n = int(s)
if l % 2 == 0:
div = int(l / 2)
if s[div] != "0":
s1 = int(s[:div])
s2 = int(s[div:])
print(s1 + s2)
else:
right = l
for i in range(int(l / 2), l):
if s[i] != "0":
right = i
break
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP VAR NUMBER IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR ASSIGN VAR VAR FOR VAR FUNC_CALL VAR F... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
l = int(n / 2)
r = int((n + 1) / 2)
while l and s[l] == "0":
l -= 1
while r != n - 1 and s[r] == "0":
r += 1
if l == 0 or r == n - 1:
if l == 0:
ans = int(s[:r]) + int(s[r:])
else:
ans = int(s[:l]) + int(s[l:])
else:
ans = min(int(s[:l]) + int(s[l:]), int... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR VAR VAR STRING VAR NUMBER WHILE VAR BIN_OP VAR NUMBER VAR VAR STRING VAR NUMBER IF VAR NUMBER VAR BIN_OP VAR NUMBER IF VAR NUMBER ASSIGN VAR BIN_O... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def main():
n = int(input())
num = input()
bsum = None
begin = n // 2
i = -1
while True:
i += 1
if begin + i + 1 >= n:
break
if num[begin + i + 1] == "0":
continue
csum = int(num[: begin + i + 1]) + int(num[begin + i + 1 :])
if not ... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NONE ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER WHILE NUMBER VAR NUMBER IF BIN_OP BIN_OP VAR VAR NUMBER VAR IF VAR BIN_OP BIN_OP VAR VAR NUMBER STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR BIN_OP BIN_OP VAR VAR NUMBER FUNC_CALL VAR VA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | def findSum(str1, str2):
if len(str1) > len(str2):
t = str1
str1 = str2
str2 = t
str = ""
n1 = len(str1)
n2 = len(str2)
str1 = str1[::-1]
str2 = str2[::-1]
carry = 0
for i in range(n1):
sum = ord(str1[i]) - 48 + (ord(str2[i]) - 48 + carry)
str += c... | FUNC_DEF IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR VAR NUMBER BIN_OP BI... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
def rl(proc=None):
if proc is not None:
return proc(sys.stdin.readline())
else:
return sys.stdin.readline().rstrip()
def srl(proc=None):
if proc is not None:
return list(map(proc, rl().split()))
else:
return rl().split()
def test(r, s, p):
if p <= 0 o... | IMPORT FUNC_DEF NONE IF VAR NONE RETURN FUNC_CALL VAR FUNC_CALL VAR RETURN FUNC_CALL FUNC_CALL VAR FUNC_DEF NONE IF VAR NONE RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR RETURN FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER VAR FUNC_CALL VAR VAR VAR VAR STRING RETURN VAR RETURN FUNC_CALL VAR VAR BIN_O... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
a = int(s)
for k in range(-1, 2):
if n // 2 + k >= 0 and n // 2 + k < n:
for i in range(max(1, n // 2 + k), n):
if s[i] != "0":
a = min(a, int(s[i:]) + int(s[:i]))
break
for i in range(n // 2 + k, 0, -1):
if s[i] !=... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER NUMBER IF BIN_OP BIN_OP VAR NUMBER VAR NUMBER BIN_OP BIN_OP VAR NUMBER VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER BIN_OP BIN_OP VAR NUMBER VAR VAR IF VAR VAR STRING ASSIGN VAR FUNC_CALL VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | import sys
try:
sys.stdin = open("in.in", "r")
except:
pass
n = int(input())
s = input().strip()
l_non0 = [-1] * n
r_non0 = [-1] * n
for i in range(n):
if s[i] == "0":
l_non0[i] = -1 if i == 0 else l_non0[i - 1]
else:
l_non0[i] = i
for i in range(n - 1, -1, -1):
if s[i] == "0":
... | IMPORT ASSIGN VAR FUNC_CALL VAR STRING STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR BIN_OP LIST NUMBER VAR FOR VAR FUNC_CALL VAR VAR IF VAR VAR STRING ASSIGN VAR VAR VAR NUMBER NUMBER VAR BIN_OP VAR NUMBER ASSIGN VAR VAR VAR FOR VAR FUNC_C... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
s = input()
if n == 2:
print(int(s[0]) + int(s[1]))
else:
mid = len(s) // 2
mid1 = mid - 1
mid2 = mid + 1
while mid1 > 0 and s[mid1] == "0":
mid1 -= 1
while mid2 < n and s[mid2] == "0":
mid2 += 1
r = []
if s[mid] != "0":
bst1 = int(s[:mid]) + int(... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR STRING VAR NUMBER WHILE VAR VAR VAR VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
x = l // 2
while n[x] == "0":
x += 1
if x == l:
break
y = l // 2
while n[y] == "0":
y -= 1
A = 10**101
B = A
C = A
if y != 0:
A = int(n[:y]) + int(n[y:])
if x != l:
B = int(n[:x]) + int(n[x:])
if x < l - 1 and n[x + 1] != "0":
C = int(n[: x + 1]) + int(n[x + ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR VAR STRING VAR NUMBER ASSIGN VAR BIN_OP NUMBER NUMBER ASSIGN VAR VAR ASSIGN VAR VAR IF VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CA... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
ans = int(n)
x = l // 2 + 1
while x < l and n[x] == "0":
x += 1
if x < l and n[x] != "0":
ans = min(int(n[x:]) + int(n[:x]), ans)
x = l // 2
while x and n[x] == "0":
x -= 1
if x and n[x] != "0":
ans = min(int(n[x:]) + int(n[:x]), ans)
print(ans) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER WHILE VAR VAR VAR VAR STRING VAR NUMBER IF VAR VAR VAR VAR STRING ASSIGN VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
number = input()
checks = []
counter = 0
i = l // 2
while counter < 2 and i < l:
if number[i] != "0":
checks.append(i)
counter += 1
i += 1
i = l // 2 - 1
counter = 0
while counter < 1 and i > 0:
if number[i] != "0":
checks.append(i)
counter += 1
i -= 1
an... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR VAR IF VAR VAR STRING EXPR FUNC_CALL VAR VAR VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR NUMBER WHILE VAR NUMBER VAR NUMBER IF VAR VAR STRIN... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | l = int(input())
n = input()
mid = l // 2
c = 0
v1 = v2 = int(n)
if n[mid] == "0":
for i in n[mid:]:
if i == "0":
c += 1
else:
break
if mid + c < l:
v1 = int(n[: mid + c]) + int(n[mid + c :])
c = 0
for i in n[mid::-1]:
if i == "0":
c -=... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR VAR IF VAR VAR STRING FOR VAR VAR VAR IF VAR STRING VAR NUMBER IF BIN_OP VAR VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR BIN_OP VAR VAR FUNC_CALL VAR VAR BIN_OP VAR VAR ASSIGN VAR ... |
Dima worked all day and wrote down on a long paper strip his favorite number $n$ consisting of $l$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive ... | n = int(input())
string = input()
if n % 2 == 0:
index = n // 2
for i in range(index, n):
if string[i] != "0":
index = i
break
ans = int(10**100000)
if string[index] != "0":
ans = int(string[:index]) + int(string[index:])
index = n // 2 - 1
for i in range(... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR NUMBER FOR VAR FUNC_CALL VAR VAR VAR IF VAR VAR STRING ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR BIN_OP NUMBER NUMBER IF VAR VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.