Datasets:
celinelee
/
python_fn_calls

Dataset card Data Studio Files
xet
 Community
1
code
stringlengths
3
6.57k
range(1 << h)
range(1 << w)
range(h)
range(w)
print(tot)
d()
map(int, sys.stdin.read()
split()
a.sort(reverse=True)
sum(a[1 : 1 + (n - 2)
print(res)
e()
map(int, sys.stdin.read()
split()
len(plus)
len(minus)
plus (*minus,)
map(abs, minus)
minus.sort(reverse=True)
plus.sort(reverse=True)
len(minus)
range(0, len(minus)
cand.append(minus[i] * minus[i + 1] % MOD)
len(plus)
range(0, len(plus)
cand.append(plus[i] * plus[i + 1] % MOD)
cand.sort(reverse=True)
print(res)
print(0)
sorted(map(abs, a)
range(k)
print(res)
a()
print("Yes" if int(sys.stdin.readline()
rstrip()
a()
b()
c()
d()
int(sys.stdin.readline()
rstrip()
print(1)
print(0)
np.eye(3, k=-1, dtype=np.int64)
np.array([0, 0, 1])
print(Algebra.dot(Algebra.matrix_pow(c, s - 2)
a()
sys.stdin.readline()
rstrip()
print(s + "s" if s[-1] != "s" else s + "es")
b()
map(int, sys.stdin.read()
split()
np.array(d)
reshape(n, 2)
np.equal(d[0], d[1])
astype(int)
d.copy()
print("Yes" if (dd >= 3)
any()
c()
int(sys.stdin.readline()
rstrip()
np.arange(1, n + 1)
sum()
NumberTheory.find_divisors(n)
print(res)
d()
map(int, sys.stdin.read()
split()
np.array(lr)
reshape(k, -1)
njit((i8, i8[:], i8[:])
solve(n, l, r)
np.zeros(n * 2, dtype=np.int64)
range(n - 1)
print(res[n - 1])
solve(n, l, r)
e()
map(int, sys.stdin.readline()
split()
range(m)
np.zeros(m, dtype=np.int64)
range(m + 1)
print(s)
divmod(n - i, l)
print(s + q * loop.sum()
sum()
a()
map(int, sys.stdin.readline()
split()
print(n - a + b)
b()
map(int, sys.stdin.read()
split()
np.absolute(np.array(x)
print(x.sum()
print(np.sqrt((x**2)
sum()
print(x.max()