CF899B.Months and Years
普及-
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Everybody in Russia uses Gregorian calendar. In this calendar there are 31 days in January, 28 or 29 days in February (depending on whether the year is leap or not), 31 days in March, 30 days in April, 31 days in May, 30 in June, 31 in July, 31 in August, 30 in September, 31 in October, 30 in November, 31 in December.
A year is leap in one of two cases: either its number is divisible by 4, but not divisible by 100, or is divisible by 400. For example, the following years are leap: 2000, 2004, but years 1900 and 2018 are not leap.
In this problem you are given n (1 ≤ n ≤ 24) integers _a_1, _a_2, ..., a__n, and you have to check if these integers could be durations in days of n consecutive months, according to Gregorian calendar. Note that these months could belong to several consecutive years. In other words, check if there is a month in some year, such that its duration is _a_1 days, duration of the next month is _a_2 days, and so on.
俄罗斯所有人都使用公历(格里高利历)。在该历法中,1月有31天,2月有28天或29天(取决于该年是否为闰年),3月有31天,4月有30天,5月有31天,6月有30天,7月有31天,8月有31天,9月有30天,10月有31天,11月有30天,12月有31天。
某一年为闰年的条件是满足以下两种情况之一:
- 该年份能被4整除,但不能被100整除;
- 或该年份能被400整除。
例如,2000年和2004年是闰年,而1900年和2018年不是闰年。
本题中,你将得到 $ n ( 1 \leq n \leq 24 $)个整数 $ a_1, a_2, \dots, a_n $,你需要判断这些整数是否可能对应公历中连续 $ n $ 个月的天数(以天为单位)。注意:这 $ n $ 个月可以跨越若干个连续的年份。换言之,请判断是否存在某个年份中的某个月,使得该月的天数为 $ a_1 $ 天,其后一个月的天数为 $ a_2 $ 天,依此类推。
输入格式
The first line contains single integer n (1 ≤ n ≤ 24) — the number of integers.
The second line contains n integers _a_1, _a_2, ..., a__n (28 ≤ a__i ≤ 31) — the numbers you are to check.
第一行包含一个整数 n(1 ≤ n ≤ 24)—— 整数的个数。
第二行包含 n 个整数 a1, a2, ..., an(28 ≤ ai ≤ 31)—— 你需要检查的数字。
输出格式
If there are several consecutive months that fit the sequence, print "YES" (without quotes). Otherwise, print "NO" (without quotes).
You can print each letter in arbitrary case (small or large).
如果存在若干个连续的月份满足该序列,则输出 "YES"(不带引号);否则输出 "NO"(不带引号)。
你可以以任意大小写形式输出每个字母(小写或大写)。
输入输出样例
输入#1
4 31 31 30 31
输出#1
Yes
输入#2
2 30 30
输出#2
No
输入#3
5 29 31 30 31 30
输出#3
Yes
输入#4
3 31 28 30
输出#4
No
输入#5
3 31 31 28
输出#5
Yes
说明/提示
In the first example the integers can denote months July, August, September and October.
In the second example the answer is no, because there are no two consecutive months each having 30 days.
In the third example the months are: February (leap year) — March — April – May — June.
In the fourth example the number of days in the second month is 28, so this is February. March follows February and has 31 days, but not 30, so the answer is NO.
In the fifth example the months are: December — January — February (non-leap year).
在第一个例子中,这些整数可以表示七月、八月、九月和十月。
在第二个例子中,答案为“否”,因为不存在两个月份连续且每个月均有 30 天。
在第三个例子中,对应的月份为:二月(闰年)— 三月 — 四月 — 五月 — 六月。
在第四个例子中,第二个月的天数为 28,因此该月为二月。二月之后是三月,而三月有 31 天,并非 30 天,故答案为 NO。
在第五个例子中,对应的月份为:十二月 — 一月 — 二月(平年)。
输入解题思路,AI测评打分。不知道怎么写?