zoukankan      html  css  js  c++  java
  • Codeforces 899 B.Months and Years

    B. Months and Years
     
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 a1, a2, ..., an, and you have to check if these integers could be durations in days of nconsecutive 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 a1 days, duration of the next month is a2 days, and so on.

    Input

    The first line contains single integer n (1 ≤ n ≤ 24) — the number of integers.

    The second line contains n integers a1, a2, ..., an (28 ≤ ai ≤ 31) — the numbers you are to check.

    Output

    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).

    Examples
    input
    4
    31 31 30 31
    output
    Yes

    input
    2
    30 30
    output
    No

    input
    5
    29 31 30 31 30
    output
    Yes

    input
    3
    31 28 30
    output
    No

    input
    3
    31 31 28
    output
    Yes

    Note

    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).

    代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cmath>
     4 using namespace std;
     5 const int N=2*1e5+10;
     6 int a[N];
     7 int month[300]={31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,
     8 31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,};
     9 int ans[N];
    10 int main(){
    11     int n;
    12     cin>>n;
    13     for(int i=1;i<=n;i++){
    14         scanf("%d",&a[i]);
    15     }
    16     for(int i=0;i<=150;i++){
    17         if(month[i]==a[1]){
    18             int flag1=0;
    19             for(int j=1;j<=n;j++){
    20                 if(month[i+j-1]!=a[j]){
    21                     flag1=1;
    22                     break;
    23                 }
    24             }
    25             if(flag1==0){
    26                 cout<<"YES"<<endl;
    27                 return 0;
    28             }
    29         }
    30     }
    31     cout<<"NO"<<endl;
    32 }
  • 相关阅读:
    jxl 单元格画斜线
    阿里云 tomcat 配置 注意
    java 的 数据库连接测试类 (SQL server)
    关于使用jackson.jar解析JSON时,大写JSON key值发生报错的问题
    JS配置文件动态加载CSS,js和定义请求路径
    SQL SERVER 2008升级SQL SERVER 2008 R2或者10.00.1600升级10.50.1600
    IDEA 启动运行的tomcat服务器项目,只能使用localhost访问的解决方法:
    舞会
    01序列
    交错01串
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9702985.html
Copyright © 2011-2022 走看看