code
stringlengths 14
580
| varname
stringlengths 1
25
| vartype
stringclasses 13
values |
|---|---|---|
l = [-3, 9, -1, 4, 2, 31]
for i, l1 in enumerate(l):
for j in range(i + 1, len(l)):
if l1 + l[j] == 0:
pairs_sum_to_zero = True
pairs_sum_to_zero = False | j | int |
l = [-3, 9, -1, 4, 2, 31]
for i, l1 in enumerate(l):
for j in range(i + 1, len(l)):
if l1 + l[j] == 0:
pairs_sum_to_zero = True
pairs_sum_to_zero = False | l | list |
l = [-3, 9, -1, 4, 2, 31]
for i, l1 in enumerate(l):
for j in range(i + 1, len(l)):
if l1 + l[j] == 0:
pairs_sum_to_zero = True
pairs_sum_to_zero = False | l1 | int |
l = [-3, 9, -1, 4, 2, 31]
for i, l1 in enumerate(l):
for j in range(i + 1, len(l)):
if l1 + l[j] == 0:
pairs_sum_to_zero = True
pairs_sum_to_zero = False | pairs_sum_to_zero | bool |
a, h = 2, 2
triangle_area = a * h / 2.0 | a | int |
a, h = 2, 2
triangle_area = a * h / 2.0 | h | int |
a, h = 2, 2
triangle_area = a * h / 2.0 | triangle_area | float |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4]) | _ | int |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4]) | n | int |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4]) | results | list |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4])
results.pop(0)
| _ | int |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4])
results.pop(0)
| n | int |
n = 12
results = [0, 0, 2, 0]
if n < 4:
fib4 = results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4])
results.pop(0)
| results | list |
l = [8, 1, 3, 9, 9, 2, 7]
l = sorted(l) | l | list |
l = [8, 1, 3, 9, 9, 2, 7]
l = sorted(l)
if len(l) % 2 == 1: | l | list |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]: | i | int |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]: | text | str |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False
is_palindrome = True | i | int |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False
is_palindrome = True | is_palindrome | bool |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False
is_palindrome = True | text | str |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False | i | int |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False | is_palindrome | bool |
text = 'xywzx'
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
is_palindrome = False | text | str |
text = 'xywzx'
for i in range(len(text)): | i | int |
text = 'xywzx'
for i in range(len(text)): | text | str |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p
modp = ret | i | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p
modp = ret | modp | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p
modp = ret | n | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p
modp = ret | p | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p
modp = ret | ret | int |
n, p = 30, 5
ret = 1 | n | int |
n, p = 30, 5
ret = 1 | p | int |
n, p = 30, 5
ret = 1 | ret | int |
n, p = 30, 5
ret = 1
for i in range(n): | i | int |
n, p = 30, 5
ret = 1
for i in range(n): | n | int |
n, p = 30, 5
ret = 1
for i in range(n): | p | int |
n, p = 30, 5
ret = 1
for i in range(n): | ret | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p | i | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p | n | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p | p | int |
n, p = 30, 5
ret = 1
for i in range(n):
ret = (2 * ret) % p | ret | int |
text = "abcdef\nghijklm"
remove_vowels = "".join([s for s in text if s.lower() not in ["a", "e", "i", "o", "u"]]) | remove_vowels | str |
text = "abcdef\nghijklm"
remove_vowels = "".join([s for s in text if s.lower() not in ["a", "e", "i", "o", "u"]]) | text | str |
l, t = [1, 20, 4, 10], 21
for e in l:
if e >= t:
below_threshold = False
below_threshold = True | below_threshold | bool |
l, t = [1, 20, 4, 10], 21
for e in l:
if e >= t:
below_threshold = False
below_threshold = True | e | int |
l, t = [1, 20, 4, 10], 21
for e in l:
if e >= t:
below_threshold = False
below_threshold = True | l | list |
l, t = [1, 20, 4, 10], 21
for e in l:
if e >= t:
below_threshold = False
below_threshold = True | t | int |
l, t = [1, 20, 4, 10], 21
for e in l: | e | int |
l, t = [1, 20, 4, 10], 21
for e in l: | l | list |
l, t = [1, 20, 4, 10], 21
for e in l: | t | int |
x, y = 0, 1
add = x + y | add | int |
x, y = 0, 1
add = x + y | x | int |
x, y = 0, 1
add = x + y | y | int |
s0, s1 = 'eabcdzzzz', 'dddzzzzzzzddddabc'
same_chars = set(s0) == set(s1) | s0 | str |
s0, s1 = 'eabcdzzzz', 'dddzzzzzzzddddabc'
same_chars = set(s0) == set(s1) | s1 | str |
s0, s1 = 'eabcdzzzz', 'dddzzzzzzzddddabc'
same_chars = set(s0) == set(s1) | same_chars | bool |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1 | b | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1 | brackets | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1 | depth | int |
brackets = "<><><<><>><>>><>"
depth = 0 | brackets | str |
brackets = "<><><<><>><>>><>"
depth = 0 | depth | int |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets: | b | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets: | brackets | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets: | depth | int |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1
else:
depth -= 1
if depth < 0:
correct_bracketing = False
correct_bracketing = depth == 0 | b | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1
else:
depth -= 1
if depth < 0:
correct_bracketing = False
correct_bracketing = depth == 0 | brackets | str |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1
else:
depth -= 1
if depth < 0:
correct_bracketing = False
correct_bracketing = depth == 0 | correct_bracketing | bool |
brackets = "<><><<><>><>>><>"
depth = 0
for b in brackets:
if b == "<":
depth += 1
else:
depth -= 1
if depth < 0:
correct_bracketing = False
correct_bracketing = depth == 0 | depth | int |
l = [4, 1, 1, 0]
if l == sorted(l) or l == sorted(l, reverse=True):
monotonic = True
monotonic = False | l | list |
l = [4, 1, 1, 0]
if l == sorted(l) or l == sorted(l, reverse=True):
monotonic = True
monotonic = False | monotonic | bool |
l = [4, 1, 1, 0]
if l == sorted(l) or l == sorted(l, reverse=True):
monotonic = True | l | list |
l = [4, 1, 1, 0]
if l == sorted(l) or l == sorted(l, reverse=True):
monotonic = True | monotonic | bool |
l = [4, 1, 1, 0]
if l == sorted(l) or l == sorted(l, reverse=True): | l | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | common | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | e1 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | e2 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | l1 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | l2 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
common = sorted(list(ret)) | ret | set |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2: | e1 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2: | e2 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2: | l1 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2: | l2 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2: | ret | set |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2: | e1 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2: | e2 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2: | l1 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2: | l2 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2: | ret | set |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1) | e1 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1) | e2 | int |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1) | l1 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1) | l2 | list |
l1, l2 = [4, 3, 2, 8], [3, 2, 4]
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1) | ret | set |
n = 330
def is_prime(k):
if k < 2:
largest_prime_factor = False
for i in range(2, k - 1):
if k % i == 0:
largest_prime_factor = False
largest_prime_factor = True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
largest_prime_factor = largest | is_prime | function |
n = 330
def is_prime(k):
if k < 2:
largest_prime_factor = False
for i in range(2, k - 1):
if k % i == 0:
largest_prime_factor = False
largest_prime_factor = True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
largest_prime_factor = largest | j | int |
n = 330
def is_prime(k):
if k < 2:
largest_prime_factor = False
for i in range(2, k - 1):
if k % i == 0:
largest_prime_factor = False
largest_prime_factor = True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
largest_prime_factor = largest | largest | int |
n = 330
def is_prime(k):
if k < 2:
largest_prime_factor = False
for i in range(2, k - 1):
if k % i == 0:
largest_prime_factor = False
largest_prime_factor = True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
largest_prime_factor = largest | largest_prime_factor | int |
n = 330
def is_prime(k):
if k < 2:
largest_prime_factor = False
for i in range(2, k - 1):
if k % i == 0:
largest_prime_factor = False
largest_prime_factor = True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
largest_prime_factor = largest | n | int |
n = 100
sum_to_n = sum(range(n + 1)) | n | int |