you & mdash; The chief engineer of the Chronos project, and your team is on the verge of the greatest discovery & mdash; creating a time machine. Everything is ready for the first jump, but there was only one critical aspect of security. The main problem you have to solve, & mdash; This is a prevention of temporary paradoxes. The easiest and most dangerous paradox & mdash; Arrive at a time in time & nbsp; to the moment of departure. This can violate a causal relationship and lead to catastrophic consequences for the whole universe.
rnYour task & mdash; Write a program for the on -board computer of time machines. The program should request the date of departure (day, month, year) and the date of arrival (day, month, year), and then make the verdict: is it possible to travel, or it will create an unacceptable paradox.
rnThe on-board computer always requests the data in strict order: first three numbers for the date of departure (day, month, year), and then three numbers for the date of arrival of the arrival of the arrival (Day, month, year).
six lines in a row. Each line contains one whole number (integer).
rnOne line (string) containing the verdict of the on-board computer: "Traveling is possible" or "Paradox! Travel is impossible".
15
5
2025
16
5
2025
Travel is possible
EN
RU
EN
RU
# Запрашиваем данные для даты отправления
# d1 - день отправления
d1 = int(input())
# m1 - месяц отправления
m1 = int(input())
# y1 - год отправления
y1 = int(input())
# Запрашиваем данные для даты прибытия
# d2 - день прибытия
d2 = int(input())
# m2 - месяц прибытия
m2 = int(input())
# y2 - год прибытия
y2 = int(input())
# Начинаем иерархическую проверку дат
# Сначала проверяем год прибытия относительно года отправления
if y2 > y1:
# Если год прибытия больше, путешествие точно возможно
print("Путешествие возможно")
elif y2 < y1:
# Если год прибытия меньше, путешествие точно невозможно
print("Парадокс! Путешествие невозможно")
else: # y2 == y1, годы равны, нужно проверять месяц
# Теперь проверяем месяц прибытия относительно месяца отправления
if m2 > m1:
# Если месяц прибытия больше (в том же году), путешествие возможно
print("Путешествие возможно")
elif m2 < m1:
# Если месяц прибытия меньше (в том же году), путешествие невозможно
print("Парадокс! Путешествие невозможно")
else: # m2 == m1, и месяцы равны, нужно проверять день
# Наконец, проверяем день прибытия относительно дня отправления
if d2 >= d1:
# Если день прибытия больше или равен (в том же месяце и году), путешествие возможно
print("Путешествие возможно")
else: # d2 < d1
# Если день прибытия меньше, путешествие невозможно
print("Парадокс! Путешествие невозможно")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...