Created
May 31, 2015 20:36
-
-
Save joffilyfe/2769c4c43ceed3cd028e to your computer and use it in GitHub Desktop.
Questão da maratona de programação olímpica (POP) - Transformar as palavras repetidas de uma entrada em #
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Funcoes | |
def appendWord(line, vector): | |
l = line.split() | |
for i in l: | |
vector.append(i) | |
def subWord(word): | |
w = "" | |
for c in range(len(word)): | |
w += "#" | |
return w | |
# Variaveis | |
palavras = [] | |
frases = [] | |
palavrasRepetidas = [] | |
# Main | |
while True: | |
try: | |
linha = raw_input() | |
appendWord(linha, palavras) | |
frases.append(linha) | |
except EOFError: | |
break | |
# Procurando palavras repetidas e salvando-as | |
for palavra in palavras: | |
if palavras.count(palavra) >= 2 and len(palavra) > 3: | |
if palavrasRepetidas.count(palavra) == 0: | |
palavrasRepetidas.append(palavra) | |
# Substituindo repetidas | |
for palavra in palavrasRepetidas: | |
for i, frase in enumerate(frases): | |
if (frases[i].find(palavra) >= 0): | |
frases[i] = frases[i].replace(palavra, subWord(palavra)) | |
# Mostrando resultado | |
for frase in frases: | |
print frase | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment