Telefonica Code Challenge 2

telefonica-challenge

Enunciado:

Solución:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
cases = int(input())
for case in range(cases):
	(num_poke, rows, cols) = map(int, input().split())

	# Get all the pokemons
	pokemons = [input().strip() for p in range(num_poke)]

	# Be sure all the input is in just one single string without spaces nor linebreaks
	text = ""
	for l in range(rows):
		text += str(input().strip().replace(" ", ""))
	
	while True:
		has_found = False

		for pokemon in pokemons:

			# Remove pokemon if found in the text
			find_straight = text.find(pokemon)
			if find_straight != -1:
				text = text[:find_straight] + text[find_straight+len(pokemon):]
				has_found = True

			# Remove pokemon if found reversed in the text
			find_reverse = text.find(pokemon[::-1])
			if find_reverse != -1:
				text = text[:find_reverse] + text[find_reverse+len(pokemon):]
				has_found = True

		# If it hasn't found anything after checking all pokemons, we are done
		if not has_found:
			break

	print(f'Case #{case+1}: {text}')