시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 512 MB | 139 | 84 | 64 | 61.538% |
You are an eccentric billionaire with an affinity for sending stuff to Mars. In an ideal world you would send stuff to Mars all the time, but your engineers tell you that it is most efficient to do it when Earth and Mars are somewhat close to each other.
Your engineers have calculated that optimal launch windows occur once every 26 months, and that one of them occurs in April 2018. They also tell you that they will not have any Big Finished Rockets by then, so you will have to wait for a later launch window.
Since your rocket scientists apparently can not be bothered to tell you about the optimal launch windows before it is too late, you have to keep track of that yourself. Write a program that determines if there is an optimal launch window in any given year.
The only line of input contains an integer y (2018 ≤ y ≤ 10000), the year you are interested in.
Output “yes” if there is an optimal launch window in the year y, otherwise output “no”.
2018
yes
2019
no
2020
yes
2028
no
Contest > KTH Challenge > KTH Challenge 2018 E번