start
stringlengths 5
368
| code
stringlengths 5
143
| end
stringlengths 5
527
|
|---|---|---|
a = 6; j = 7; m = 3
|
a += j % m
|
a = 7; j = 7; m = 3
|
i = 8; j = ['I', 'came', 'from', 'the', 'moon.', 'He', 'went', 'She', 'went', 'to', 'the', 'drawing', 'room.']; w = ['the']
|
w.append(j[i + 1].lower())
|
i = 8; j = ['I', 'came', 'from', 'the', 'moon.', 'He', 'went', 'She', 'went', 'to', 'the', 'drawing', 'room.']; w = ['the', 'to']
|
x = 'f'
|
x = x.upper()
|
x = 'F'
|
i = 2; p = [2, 1]
|
p.append(i)
|
i = 2; p = [2, 1, 2]
|
o = 8; w = [5, 2, 1]
|
w.append(o)
|
o = 8; w = [5, 2, 1, 8]
|
q = 4
|
h = q - 1
|
h = 3; q = 4
|
l = [[0, 1, 2], [3], [0, 1], [0, 1, 2], [3, 4, 5]]; s = [0]
|
l.append(s)
|
l = [[0, 1, 2], [3], [0, 1], [0, 1, 2], [3, 4, 5], [0]]; s = [0]
|
c = 0; i = 2
|
c += i * (i - 1)
|
c = 2; i = 2
|
k = 'lmno'
|
u = len(k)
|
k = 'lmno'; u = 4
|
d = {'a': 0, 'b': 0}; s = 'c'; x = 'c'
|
d[x] = s.count(x)
|
d = {'a': 0, 'b': 0, 'c': 1}; s = 'c'; x = 'c'
|
c = 5
|
h = [{'roads': [], 'fish': set()} for _ in range(c)]
|
c = 5; h = [{'roads': [], 'fish': set()}, {'roads': [], 'fish': set()}, {'roads': [], 'fish': set()}, {'roads': [], 'fish': set()}, {'roads': [], 'fish': set()}]
|
a = 8; i = 6
|
i = max(i, a)
|
a = 8; i = 8
|
f = ['5', '5', '5', '5', '5', '5', '3']
|
f.append('3')
|
f = ['5', '5', '5', '5', '5', '5', '3', '3']
|
g = deque([]); i = 5; k = 0; n = 8; r = [1, 2, 3, 4, 5]
|
n = r[k] * (i if len(g) == 0 else i - g[-1] - 1)
|
g = deque([]); i = 5; k = 0; n = 5; r = [1, 2, 3, 4, 5]
|
z = 'hack'
|
n = z[:1]
|
n = 'h'; z = 'hack'
|
j = 196
|
j += i
|
i = 93; j = 289
|
f = deque([1, 4]); x = 0
|
x = f.popleft()
|
f = deque([4]); x = 1
|
i = 4; l = [0, [-1, {2}], [-1, {1, 3}], [-1, {2}], [-1, set()]]; x = 2
|
l[x][0] = i
|
i = 4; l = [0, [-1, {2}], [4, {1, 3}], [-1, {2}], [-1, set()]]; x = 2
|
j = 1; p = [-1, -1, -1, -1, -1]
|
p[j] = 0
|
j = 1; p = [-1, 0, -1, -1, -1]
|
i = '"'; k = 'hACKERrANK.COM PRESENTS "pYTHONIST 2'
|
k += i.upper()
|
i = '"'; k = 'hACKERrANK.COM PRESENTS "pYTHONIST 2"'
|
i = 0; p = 1
|
p = i
|
i = 0; p = 0
|
m = [10, 5, 20, 20, 4, 5, 2, 25, 1]
|
d = m[0]
|
d = 10; m = [10, 5, 20, 20, 4, 5, 2, 25, 1]
|
c = [2, 4, 3, 5, 2, 6, 4, 5]
|
n = len(c)
|
c = [2, 4, 3, 5, 2, 6, 4, 5]; n = 8
|
s = 1.2000000000000002e-09
|
s /= 10
|
s = 1.2000000000000003e-10
|
d = 7; g = 6
|
g = d
|
d = 7; g = 7
|
b = [5, 5, 6]; d = 1; x = 2
|
b[x] -= d
|
b = [5, 5, 5]; d = 1; x = 2
|
q = 8192
|
q = q >> 1
|
q = 4096
|
g = '1000'
|
g += '0'
|
g = '10000'
|
o = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 2], [0, 2, 1], [1, 2, 2], [2, 0, 1], [2, 0, 2], [2, 1, 0]]; x = 2; y = 1; z = 1
|
o.append([x, y, z])
|
o = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 2], [0, 2, 1], [1, 2, 2], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1]]; x = 2; y = 1; z = 1
|
p = {'12', '100', '11'}; y = {'78', '7', '2', '6', '3', '11', '23', '84', '9', '10', '4', '8', '45', '12', '5', '1'}
|
b = b if y.issuperset(p) and y != p else False
|
b = False; p = {'11', '12', '100'}; y = {'45', '12', '10', '6', '11', '7', '78', '3', '84', '23', '2', '8', '9', '5', '1', '4'}
|
l = 13, 3, 10; p = 14; x = 1
|
p = l[x] ^ l[x + 1]
|
l = (13, 3, 10); p = 9; x = 1
|
l = 2; s = 2, 1
|
l = sum(s)
|
l = 3; s = (2, 1)
|
c = [0, 0, 0, 0, 0, 0]; i = 1
|
c[i] = 1
|
c = [0, 1, 0, 0, 0, 0]; i = 1
|
a = [[1, 2]]; q = [3, 4]
|
a.append(q)
|
a = [[1, 2], [3, 4]]; q = [3, 4]
|
k = 5; x = 4
|
k = x
|
k = 4; x = 4
|
v = 1
|
v >>= 1
|
v = 0
|
a = []
|
n = len(a)
|
a = []; n = 0
|
i = 0; j = 2; l = 'haveaniceday'; p = 4; w = 'ha'
|
w += l[j * p + i]
|
i = 0; j = 2; l = 'haveaniceday'; p = 4; w = 'hae'
|
n = ['(', '[', '[', '{', '{']
|
n.pop(0)
|
n = ['[', '[', '{', '{']
|
g = 'discard 6'; s = {3, 4, 5, 6}
|
s.discard(int(g[-1]))
|
g = 'discard 6'; s = {3, 4, 5}
|
x = 2
|
x = x + 1
|
x = 3
|
e = {(10, 2): 2, (5, 2): 1}; l = 1; m = 2; z = 4
|
e[m, l] = z
|
e = {(10, 2): 2, (5, 2): 1, (2, 1): 4}; l = 1; m = 2; z = 4
|
i = 1
|
i += 1
|
i = 2
|
n = 1; v = 2
|
n = (n + 1) % v
|
n = 0; v = 2
|
d = 'wedo'; w = 'wedodo'; y = 'must'
|
w = d + y
|
d = 'wedo'; w = 'wedomust'; y = 'must'
|
t = -1
|
p = t
|
p = -1; t = -1
|
j = 37
|
j += 1
|
j = 38
|
k = 'afa'
|
r.append(len(k))
|
k = 'afa'; r = [3]
|
a = [1, 2, 3, 4, 5]
|
j = len(a) - 1
|
a = [1, 2, 3, 4, 5]; j = 4
|
d = [[8, 6, 9], [7, 2, 5], [1, 4, 3]], 1
|
k = d[1]
|
d = ([[8, 6, 9], [7, 2, 5], [1, 4, 3]], 1); k = 1
|
b = 'cdefghijklmnopqrstuvwxyzab'
|
e = b.upper()
|
b = 'cdefghijklmnopqrstuvwxyzab'; e = 'CDEFGHIJKLMNOPQRSTUVWXYZAB'
|
x = 3; z = [5, 0, 0, 0, 2, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
|
z[x] += 1
|
x = 3; z = [5, 0, 0, 1, 2, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
|
s = 6
|
s += 1
|
s = 7
|
l = [1, 60]; o = [28]
|
o.append(l[1])
|
l = [1, 60]; o = [28, 60]
|
a = [1, 2, 3, 1, 1, 2, 3, 1, 10]; j = 3; l = 1; n = 2
|
l = j - a[n + 4]
|
a = [1, 2, 3, 1, 1, 2, 3, 1, 10]; j = 3; l = 0; n = 2
|
i = 2; p = 2; v = [(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (4, 2, 3, 1), (4, 3, 1, 2), (4, 3, 2, 1)]
|
p = v[i][0] ^ v[i][len(v[i]) - 1]
|
i = 2; p = 5; v = [(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (4, 2, 3, 1), (4, 3, 1, 2), (4, 3, 2, 1)]
|
i = 6; v = [1, 2, 1, 2, 1, 2, 1, 1, 1, 1]
|
v[i] = v[i - 1] + 1
|
i = 6; v = [1, 2, 1, 2, 1, 2, 3, 1, 1, 1]
|
f = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']; h = ''; i = 3; n = 5
|
h = '-'.join(f[i + 1:n])
|
f = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']; h = 'e'; i = 3; n = 5
|
f = 3; l = [3, 2, 7]; x = 2
|
f = l[x - 1]
|
f = 2; l = [3, 2, 7]; x = 2
|
g = {'k': [0, {}]}; k = [0, {}]
|
k[0] += 1
|
g = {'k': [0, {}]}; k = [1, {}]
|
f = 6; m = 0; s = 10
|
s = m + f
|
f = 6; m = 0; s = 6
|
b = [0, 3, -1, -1, -1, 8, 9, -1, 11, -1, -1, -1]; c = [0, 1, 2, 2, 3, 3, 4, 0, 0, 0, 0, 0]; d = 3; l = 6; m = [0, 2, 4, 5, 6, 7, -1, -1, 10, -1, -1, -1]; p = 5; r = -1
|
d, l, r = c[p], m[p], b[p]
|
b = [0, 3, -1, -1, -1, 8, 9, -1, 11, -1, -1, -1]; c = [0, 1, 2, 2, 3, 3, 4, 0, 0, 0, 0, 0]; d = 3; l = 7; m = [0, 2, 4, 5, 6, 7, -1, -1, 10, -1, -1, -1]; p = 5; r = 8
|
d = {'a': 2, 'b': 2, 'c': 2, 'd': 2, 'e': 1, 'f': 1, 'g': 1}; i = 'e'
|
d[i] += 1
|
d = {'a': 2, 'b': 2, 'c': 2, 'd': 2, 'e': 2, 'f': 1, 'g': 1}; i = 'e'
|
c = 2; i = [[6], [5], []]; j = 2
|
i[j].append(c * (len(i[j]) + 1))
|
c = 2; i = [[6], [5], [2]]; j = 2
|
d = [3, 6, 12, 24, 48, 96, 192, 384, 768]; e = 1536
|
d.append(e)
|
d = [3, 6, 12, 24, 48, 96, 192, 384, 768, 1536]; e = 1536
|
u = 10; x = '98'
|
u = int(x) + 1
|
u = 99; x = '98'
|
k = 3
|
s = k
|
k = 3; s = 3
|
k = 69; p = 'In the third category he included those Brothers (the majority) who s'; z = ( 'In the third category he included those Brothers..., breathless from his gallop and his excitement. ' )
|
p += z[k]
|
k = 69; p = 'In the third category he included those Brothers (the majority) who sh'; z = 'In the third category he included those Brothers..., breathless from his gallop and his excitement. '
|
e = '10000000000000000000000000000'
|
e += '0'
|
e = '100000000000000000000000000000'
|
j = 1; t = [4, 3, 4]
|
j = t[1] - 1
|
j = 2; t = [4, 3, 4]
|
i = 0; q = 3
|
j = q - i - 1
|
i = 0; j = 2; q = 3
|
h = '11010000001001110'; w = '1'
|
h += '1' if w == '0' else '0'
|
h = '110100000010011100'; w = '1'
|
i = 3; s = '100'
|
s = s[i:]
|
i = 3; s = ''
|
v = '1'; y = '1'
|
v, y = [int(v), int(y)]
|
v = 1; y = 1
|
i = 'C'; m = 'AB'
|
m = m + i
|
i = 'C'; m = 'ABC'
|
f = [2, 4, 6, 6, 8]; i = 1
|
f[i + 1] = f[i]
|
f = [2, 4, 4, 6, 8]; i = 1
|
b = '111111111111111111111111111'
|
b += '1'
|
b = '1111111111111111111111111111'
|
r = [[], [2, 1]]
|
e = r[0]
|
e = []; r = [[], [2, 1]]
|
e = 2; l = 1
|
e += l
|
e = 3; l = 1
|
l = 16; y = '111'
|
l = len(y)
|
l = 3; y = '111'
|
j = 3; m = 2
|
p = m + j
|
j = 3; m = 2; p = 5
|
p = True; q = False
|
p = q
|
p = False; q = False
|
w = 'GGGGGG'
|
i.append(w)
|
i = ['GGGGGG']; w = 'GGGGGG'
|
e = {'D': 2, '_': 2, 'F': 1, 'Q': 1}; l = '_'
|
e.update({l: e.get(l, 0) + 1})
|
e = {'D': 2, '_': 3, 'F': 1, 'Q': 1}; l = '_'
|
b = [1, 1, 1, 2, 2]; t = 5
|
i = b[t - 1] - b[0]
|
b = [1, 1, 1, 2, 2]; i = 1; t = 5
|
i = 0; j = 1; k = 0; l = 0; q = [[1, 1, 1, 0, 0, 0], [0, 1, 0, 0, 0, 0], [1, 1, 1, 0, 0, 0], [0, 0, 2, 4, 4, 0], [0, 0, 0, 2, 0, 0], [0, 0, 1, 2, 4, 0]]; t = 7
|
t += q[i + k][j + l]
|
i = 0; j = 1; k = 0; l = 0; q = [[1, 1, 1, 0, 0, 0], [0, 1, 0, 0, 0, 0], [1, 1, 1, 0, 0, 0], [0, 0, 2, 4, 4, 0], [0, 0, 0, 2, 0, 0], [0, 0, 1, 2, 4, 0]]; t = 8
|
i = 1; k = 1
|
j = min(i, k)
|
i = 1; j = 1; k = 1
|
i = 3; s = '7891011'; x = 78
|
x = int(s[:i])
|
i = 3; s = '7891011'; x = 789
|
e = ['2', '4', '5', '9']
|
g = list(map(int, e))
|
e = ['2', '4', '5', '9']; g = [2, 4, 5, 9]
|
l = {'cd': 2}; s = 'cd'
|
l[s] = l.get(s, 0) + 1
|
l = {'cd': 3}; s = 'cd'
|
j = 142; l = [4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140]
|
l.append(j)
|
j = 142; l = [4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 142]
|
e = 1; h = [0, 0, 1, 2, 0, 0]; i = 4
|
h[i] = e
|
e = 1; h = [0, 0, 1, 2, 1, 0]; i = 4
|
h = [0, 1, 3, 7, 15, 31, 63, 127, 255, 32767, 65535, 31071, 62143, 24287, 48575, 97151, 94303, 88607]; n = 88607
|
n = (1 + h[-1] * 2) % p
|
h = [0, 1, 3, 7, 15, 31, 63, 127, 255, 32767, 65535, 31071, 62143, 24287, 48575, 97151, 94303, 88607]; n = -6; p = -11
|
e = [0, 0, 2, 0]; f = 2; x = 2
|
f = f - e[x]
|
e = [0, 0, 2, 0]; f = 0; x = 2
|
h = 16
|
h = h + 1
|
h = 17
|
a = 1; p = [2, 5, 100]
|
a = p[0]
|
a = 2; p = [2, 5, 100]
|
l = 7; p = 3
|
l = p
|
l = 3; p = 3
|
i = 9; j = 0; q = [[1, 1, 1, 1], [0, 0, 0, 0], [1, 1, 1, 1], [0, 0, 1, 1], [1, 1, 3, 4], [0, 0, 0, 0], [0, 0, 0, 0]]; x = 3
|
x = q[i][j - 1] if j >= 1 else 0
|
i = 9; j = 0; q = [[1, 1, 1, 1], [0, 0, 0, 0], [1, 1, 1, 1], [0, 0, 1, 1], [1, 1, 3, 4], [0, 0, 0, 0], [0, 0, 0, 0]]; x = 0
|
p = 10; x = 2
|
x = x * 2 % p
|
p = 10; x = 4
|
i = 1; s = 'aaabbbbcccddd'; u = {0, 1}; z = 2
|
u.add(z * (ord(s[i]) - 96))
|
i = 1; s = 'aaabbbbcccddd'; u = {0, 1, 2}; z = 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.