def test_grid_search(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
R, C = input().strip().split(' ')
R, C = [int(R), int(C)]
G = []
G_i = 0
for G_i in range(R):
G_t = str(input().strip())
G.append(G_t)
r, c = input().strip().split(' ')
r, c = [int(r), int(c)]
P = []
P_i = 0
for P_i in range(r):
P_t = str(input().strip())
P.append(P_t)
print(grid_search(P, G))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_grid_search(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
R, C = input().strip().split(' ')
R, C = [int(R), int(C)]
G = []
G_i = 0
for G_i in range(R):
G_t = str(input().strip())
G.append(G_t)
r, c = input().strip().split(' ')
r, c = [int(r), int(c)]
P = []
P_i = 0
for P_i in range(r):
P_t = str(input().strip())
P.append(P_t)
print(grid_search(P, G))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_running_time(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
ar = [int(i) for i in input().strip().split()]
print(running_time(ar))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_counting_sort3(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
ar = [int(input().strip().split()[0]) for x in range(m)]
print(" ".join(repr(e) for e in list(counting_sort3(ar))))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_bigger_is_greater(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
for i in range(m):
print(bigger_is_greater(input()))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_quick_sort3(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
ar = [int(i) for i in input().strip().split()]
quick_sort3(ar, 0, len(ar)-1)
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_quick_sort2(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
ar = [int(i) for i in input().strip().split()]
print(" ".join(repr(x) for x in quick_sort2(ar)))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_make_anagram(capsys):
in_path = BASE_DIR + "tests/data/practice/hackerrank/algorithms/string/anagram_sample.in"
out_path = BASE_DIR + "tests/data/practice/hackerrank/algorithms/string/anagram_sample.out"
with open_to_stdin(in_path):
n = int(input())
for i in range(n):
# print(input())
print(make_anagram(input()))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_utopian_tree(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
n = int(input().strip())
print(utopian_tree(n))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_utopian_tree(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
n = int(input().strip())
print(utopian_tree(n))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_correctness_invariant(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
m = int(input().strip())
ar = [int(i) for i in input().strip().split()]
insertion_sort3(ar)
print(" ".join(map(str, ar)))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_insertion_sort2(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
n = input()
l = list(map(int, input().split()))
insertion_sort2(l)
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_fibonacci_modified(capsys):
scenarios = [scenario1, scenario7]
in_path = BASE_DIR + "tests/data/practice/hackerrank/algorithms/dynamic_programming/fibonacci_modified_sample.in"
out_path = BASE_DIR + "tests/data/practice/hackerrank/algorithms/dynamic_programming/fibonacci_modified_sample.out"
with open_to_stdin(in_path):
data = list(map(int, input().split(' ')))
print(fib_modified(data))
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_decent_number(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
n = int(input().strip())
dn = decent_number(n)
if dn:
print(dn)
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_decent_number(capsys, in_data, out_data):
in_path = BASE_DIR + in_data
out_path = BASE_DIR + out_data
with open_to_stdin(in_path):
t = int(input().strip())
for a0 in range(t):
n = int(input().strip())
dn = decent_number(n)
if dn:
print(dn)
out, err = capsys.readouterr()
expected = open(out_path, "r").read()
assert out == expected
def test_open_to_stdin():
in_path = BASE_DIR + "tests/data/practice/hackerrank/algorithms/implementation/grid_search_sample.in"
with open_to_stdin(in_path) as f:
while f:
print("line: %s" % input())
