QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 512 MB Total points: 100

#3484. 火星之窗

Statistics

你是一位古怪的亿万富翁,热衷于向火星发送各种东西。在理想世界中,你会一直向火星发送东西,但你的工程师告诉你,当地球和火星距离较近时,发送效率最高。

你的工程师计算出,最佳发射窗口每 26 个月出现一次,其中一个窗口出现在 2018 年 4 月。他们还告诉你,到那时他们还没有准备好任何大型成品火箭,所以你必须等待以后的发射窗口。

由于你的火箭科学家显然懒得在为时已晚之前告诉你最佳发射窗口,你必须自己跟踪这些窗口。编写一个程序,确定在给定的任何一年中是否存在最佳发射窗口。

图片由欧洲航天局提供,采用 cc by-sa 协议

输入格式

输入仅包含一行,为一个整数 $y$ ($2018 \le y \le 10000$),即你感兴趣的年份。

输出格式

如果年份 $y$ 中存在最佳发射窗口,则输出 “yes”,否则输出 “no”。

样例

样例输入 1

2018

样例输出 1

yes

样例输入 2

2019

样例输出 2

no

样例输入 3

2020

样例输出 3

yes

样例输入 4

2028

样例输出 4

no

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.