you participate in a prestigious literary competition. The jury appreciates not only the depth of thought, but also the wealth of the language. To impress, you decided to analyze your essay and find the longest and shortest word in it. This will help you understand how diverse your vocabulary is.
rn task:
Write a program that accepts one line of text (your essay) and finds the longest and shortest word in it.
restrictions:
rn& nbsp;
One line of text (string), which may contain words, gaps and punctuation marks.
The longest word from the text (String). On the next line & mdash; The shortest word from the text (string).
Hello, peace! This is a very, very long word and another word.
Very, very
and
EN
RU
EN
RU
# Заранее определяем строку со знаками препинания, которые нужно удалить
punctuation = '.,!?:;-"()\''
# Получаем строку текста от пользователя
text = input()
# Преобразуем весь текст в нижний регистр для регистронезависимого сравнения
# и разбиваем его на отдельные слова по пробелам
raw_words = text.lower().split()
# Создаем пустой список для хранения очищенных слов
cleaned_words = []
# Используем цикл for для перебора каждого "сырого" слова
for raw_word in raw_words:
# Удаляем знаки препинания с начала и конца каждого слова
word = raw_word.strip(punctuation)
# Если после очистки слово не стало пустым, добавляем его в наш список
if word:
cleaned_words.append(word)
# Проверяем, нашлись ли в тексте какие-либо слова
if not cleaned_words:
# Если список пуст, выводим соответствующее сообщение
print("Слова не найдены.")
else:
# Инициализируем самое длинное и самое короткое слово первым словом из списка
longest_word = cleaned_words[0]
shortest_word = cleaned_words[0]
# Начинаем цикл со второго элемента, так как первый уже взят за основу
for word in cleaned_words[1:]:
# Условие для поиска самого длинного слова
# Оно становится новым самым длинным, если его длина больше
# ИЛИ если длины равны, но оно по алфавиту идет раньше
if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):
longest_word = word
# Условие для поиска самого короткого слова
# Оно становится новым самым коротким, если его длина меньше
# ИЛИ если длины равны, но оно по алфавиту идет раньше
if len(word) < len(shortest_word) or (len(word) == len(shortest_word) and word < shortest_word):
shortest_word = word
# Выводим найденное самое длинное слово
print(longest_word)
# Выводим найденное самое короткое слово на новой строке
print(shortest_word)1 - Read the task and understand what needs to be done
2 - The example shows how the input data will be provided and what output is expected
3 - Write the code considering the input, output, and the task itself.
1 - The “Run” button executes your code only on one set of input data, and you’ll see the result in the output window.
2 - The “Test on All Cases” button runs your code against all test cases. If all tests pass, a banner will appear. If even one test fails, it will be highlighted in red.
To change the input data, click the “Run Test” button next to the input data you want to execute.
1 - Input Data is the window containing the values loaded into your program in place of input()
2 - Program Output is the window showing what your program prints. If it’s green, the output matches the expected result; if red, there are differences.
3 - Expected Output is the reference value used to verify the solution.
1 - Green means the program produced the correct output
2 - Red means the program’s output didn’t match the expected output for this data. The program output and the expected output must be identical, including spaces and punctuation!
If you see this banner, congratulations — everything is correct.
1 - The first 10 tasks are quite easy and contain hints covering only the essential parts of the topic.
2 - The next 10 tasks are medium difficulty. Their hints differ from the easy ones and reveal new aspects of the topic.
3 - The hardest tasks have no hints. Often, they include additional topics, so sometimes it’s better to move on and return later. Read the hints carefully — they offer new ways to solve already familiar problems.
1 - Each block contains a “Theory” section.
2 - It always includes a detailed video.
3 - There is also a detailed guide with all the necessary theory and code examples.
1 - Click the “Report an Error / Social Media” button
2 - Here you can describe the error you encountered.
3 - You’ll also find our social media links here — follow us and help us improve.
🎉 Congratulations! 🎉
You did an excellent job with the task! It was a challenging problem, but you found the correct solution. You are one step closer to mastering programming! Keep up the good work, because every stage you pass makes you even stronger.
AD
Advertisement
Running your code...