code
stringlengths
3
6.57k
range(a, 1000)
is_palindrome(n)
cand.append(n)
print(max(cand)
p5()
NumberTheory.PrimeNumbers()
defaultdict(int)
range(1, 21)
pn.factorize(i)
items()
max(res[p], c)
res.items()
pow(p, c)
print(ans)
p6()
np.arange(101)
np.cumsum(a**2)
a.cumsum()
print(a[100] ** 2 - b[100])
p7()
NumberTheory.PrimeNumbers()
print(sorted(nt)
p8()
int(d)
list(n)
range(988)
range(13)
max(res, x)
print(res)
p9()
range(1, 997)
range(a, 998 - a)
print(a * b * c)
p10()
NumberTheory.PrimeNumbers(2 * 10**6 + 1)
print(sum(pn)
p11()
print(grid)
__init__(self)
__call__(self)
print(1)
ALDS1_12_A()
map(int, sys.stdin.read()
split()
GeometryTopology.Graph(n)
range(n - 1)
range(i + 1, n)
g.add_edge(i, j, weight=a[i * n + j])
g.add_edge(j, i, weight=a[i * n + j])
g.kruskal()
g.prim()
g.boruvka()
print(d)
GRL_3_C()
map(int, sys.stdin.readline()
split()
GeometryTopology.Graph(n)
range(m)
g.add_edge(*map(int, sys.stdin.readline()
split()
g.scc()
map(int, sys.stdin.read()
split()
zip(*[iter(uv)
print(int(r[u] == r[v])
Directed_MST()
map(int, sys.stdin.read()
split()
GeometryTopology.Graph(n)
zip(*[iter(abc)
g.add_edge(a, b, weight=c)
g.prim(src=s, return_parent=True)
print(d)
print(*p)
Manhattan_MST()
map(int, sys.stdin.read()
split()
GeometryTopology.Graph(n)
AtCoder.ABC179.f()
AtCoder.ABC060.d()
AtCoder.ABC081.d()
AtCoder.ARC106.d()
YosupoJudge.Directed_MST()
FE(core.experiment)
pg (pyvisa.resources.gpib.GPIBInstrument)
scope (pyvisa.resources.gpib.GPIBInstrument)
scopetype (str)
TDS620B (``'620B'``)
TDS6604 (``'6604'``)
run_function (function)
__init__(self, pg, scope, scopetype="6604", run_function=preset_run_function)
super()
__init__()
B (corresponding to the correct scope you are using)
checks(self, params)
initialization ({})
run_function ({})
initialization ({})
run_function ({})
initialization ({})