code
stringlengths
14
580
varname
stringlengths
1
25
vartype
stringclasses
13 values
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False
w
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1
i
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1
j
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1
q
list
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1
w
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1 will_it_fly = True
i
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1 will_it_fly = True
j
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1 will_it_fly = True
q
list
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1 will_it_fly = True
w
int
q, w = [3, 2, 3], 9 if sum(q) > w: will_it_fly = False i, j = 0, len(q)-1 while i<j: if q[i] != q[j]: will_it_fly = False i+=1 j-=1 will_it_fly = True
will_it_fly
bool
arr = [0, 1] ans = 0
ans
int
arr = [0, 1] ans = 0
arr
list
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]:
ans
int
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]:
arr
list
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]:
i
int
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]: ans += 1
ans
int
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]: ans += 1
arr
list
arr = [0, 1] ans = 0 for i in range(len(arr) // 2): if arr[i] != arr[len(arr) - i - 1]: ans += 1
i
int
arr = [0, 1] ans = 0 for i in range(len(arr) // 2):
ans
int
arr = [0, 1] ans = 0 for i in range(len(arr) // 2):
arr
list
arr = [0, 1] ans = 0 for i in range(len(arr) // 2):
i
int
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st)
l1
int
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st)
l2
int
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st)
lst1
list
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st)
lst2
list
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st)
st
str
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
l1
int
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
l2
int
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
lst1
list
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
lst2
list
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
st
str
lst1, lst2 = [], ['this'] l1 = 0 for st in lst1: l1 += len(st) l2 = 0 for st in lst2: l2 += len(st) if l1 <= l2: total_match = lst1
total_match
list
a = 10 def is_prime(n): for j in range(2,n): if n%j == 0: is_multiply_prime = False is_multiply_prime = True for i in range(2,101):
a
int
a = 10 def is_prime(n): for j in range(2,n): if n%j == 0: is_multiply_prime = False is_multiply_prime = True for i in range(2,101):
i
int
a = 10 def is_prime(n): for j in range(2,n): if n%j == 0: is_multiply_prime = False is_multiply_prime = True for i in range(2,101):
is_prime
function
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1
n
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1
power
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1
x
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x): power = power * n
n
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x): power = power * n
power
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x): power = power * n
x
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x):
n
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x):
power
int
x, n = 16, 2 if (n == 1): is_simple_power = (x == 1) power = 1 while (power < x):
x
int
a = 1 a = abs(a) iscube = int(round(a ** (1. / 3))) ** 3 == a
a
int
a = 1 a = abs(a) iscube = int(round(a ** (1. / 3))) ** 3 == a
iscube
bool
a = 1 a = abs(a)
a
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)): if num[i] in primes:
i
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)): if num[i] in primes:
num
str
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)): if num[i] in primes:
primes
tuple
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)): if num[i] in primes:
total
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0
num
str
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0
primes
tuple
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0
total
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)):
i
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)):
num
str
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)):
primes
tuple
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D') total = 0 for i in range(0, len(num)):
total
int
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D')
num
str
num = "112233445566778899AABBCCDDEEFF00" primes = ('2', '3', '5', '7', 'B', 'D')
primes
tuple
decimal = 32 decimal_to_binary = "db" + bin(decimal)[2:] + "db"
decimal
int
decimal = 32 decimal_to_binary = "db" + bin(decimal)[2:] + "db"
decimal_to_binary
str
string = 'kittens' l = len(string)
l
int
string = 'kittens' l = len(string)
string
str
n = 4 if n == 1: starts_one_ends = 1 starts_one_ends = 18 * (10 ** (n - 2))
n
int
n = 4 if n == 1: starts_one_ends = 1 starts_one_ends = 18 * (10 ** (n - 2))
starts_one_ends
int
n = 4 if n == 1: starts_one_ends = 1
n
int
N = 963 solve = bin(sum(int(i) for i in str(N)))[2:]
N
int
N = 963 solve = bin(sum(int(i) for i in str(N)))[2:]
solve
str
lst = [4, 0, 6, 7] add = sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0])
add
int
lst = [4, 0, 6, 7] add = sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0])
lst
list
s = '' anti_shuffle = ' '.join([''.join(sorted(list(i))) for i in s.split(' ')])
anti_shuffle
str
s = '' anti_shuffle = ' '.join([''.join(sorted(list(i))) for i in s.split(' ')])
s
str
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]
coords
list
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]
lst
list
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]
x
int
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x] get_row = sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])
coords
list
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x] get_row = sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])
get_row
list
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x] get_row = sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])
lst
list
lst, x = [], 1 coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x] get_row = sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])
x
int
array = [2, 4, 3, 0, 1, 5, 6] sort_array = [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0)
array
list
array = [2, 4, 3, 0, 1, 5, 6] sort_array = [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0)
sort_array
list
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d:
c
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d:
d
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d:
out
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d:
s
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d: out += d[(d.index(c)+2*2) % 26]
c
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d: out += d[(d.index(c)+2*2) % 26]
d
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d: out += d[(d.index(c)+2*2) % 26]
out
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz' out = '' for c in s: if c in d: out += d[(d.index(c)+2*2) % 26]
s
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz'
d
str
s = 'hi' d = 'abcdefghijklmnopqrstuvwxyz'
s
str
lst = [1, 0**0] lst = sorted(set(lst)) next_smallest = None if len(lst) < 2 else lst[1]
lst
list
lst = [1, 0**0] lst = sorted(set(lst)) next_smallest = None if len(lst) < 2 else lst[1]
next_smallest
NoneType
lst = [1, 0**0] lst = sorted(set(lst))
lst
list
S = "I love It !" import re sentences = re.split(r'[.?!]\s*', S) is_bored = sum(sentence[0:2] == 'I ' for sentence in sentences)
S
str
S = "I love It !" import re sentences = re.split(r'[.?!]\s*', S) is_bored = sum(sentence[0:2] == 'I ' for sentence in sentences)
is_bored
int
S = "I love It !" import re sentences = re.split(r'[.?!]\s*', S) is_bored = sum(sentence[0:2] == 'I ' for sentence in sentences)
re
module
S = "I love It !" import re sentences = re.split(r'[.?!]\s*', S) is_bored = sum(sentence[0:2] == 'I ' for sentence in sentences)
sentences
list
S = "I love It !" import re sentences = re.split(r'[.?!]\s*', S)
S
str