zoukankan      html  css  js  c++  java
  • Good Bye 2015 A

    A. New Year and Days
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Today is Wednesday, the third day of the week. What's more interesting is that tomorrow is the last day of the year 2015.

    Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016.

    Limak wants to prove how responsible a bear he is. He is going to regularly save candies for the entire year 2016! He considers various saving plans. He can save one candy either on some fixed day of the week or on some fixed day of the month.

    Limak chose one particular plan. He isn't sure how many candies he will save in the 2016 with his plan. Please, calculate it and tell him.

    Input

    The only line of the input is in one of the following two formats:

    • "x of week" where x (1 ≤ x ≤ 7) denotes the day of the week. The 1-st day is Monday and the 7-th one is Sunday.
    • "x of month" where x (1 ≤ x ≤ 31) denotes the day of the month.
    Output

    Print one integer — the number of candies Limak will save in the year 2016.

    Sample test(s)
    Input
    4 of week
    Output
    52
    Input
    30 of month
    Output
    11
    Note

    Polar bears use the Gregorian calendar. It is the most common calendar and you likely use it too. You can read about it on Wikipedia if you want to – https://en.wikipedia.org/wiki/Gregorian_calendar. The week starts with Monday.

    In the first sample Limak wants to save one candy on each Thursday (the 4-th day of the week). There are 52 Thursdays in the 2016. Thus, he will save 52 candies in total.

    In the second sample Limak wants to save one candy on the 30-th day of each month. There is the 30-th day in exactly 11 months in the 2016 — all months but February. It means that Limak will save 11 candies in total.

    Say goodbye 2016通了一次宵 出了 A  C 题

    题意    输入 x of week (1 ≤ x ≤ 7) 输出2016年有多少星期x

              x of month (1 ≤ x ≤ 31)  输出2016年有多少x号

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int n;
    char a[10],b[10];
    int main()
    {
      scanf("%d%s%s",&n,a,b);
      if(strcmp(b,"month")==0)
      {
          if(n<=29)
          printf("12
    ");
          else
          {
              if(n==30)
                printf("11
    ");
              if(n==31)
                printf("7
    ");
          }
      }
      if(strcmp(b,"week")==0)
      {
          if(n<=4||n==7)
            printf("52
    ");
          else
            printf("53
    ");
      }
        return 0;
    }
    

      

  • 相关阅读:
    asm createdisk时提示没有权限
    webkit 模拟点击 winform
    .net中的反射(转载)
    wpf——三维学习1
    3dmax导出到blend或者vs中
    地理坐标系与投影坐标系
    Arcgis与CityEngine安装破解
    忘记Windows7登陆密码解决办法
    wpf的UserControl用户控件怎么添加到Window窗体中
    postgres索引创建、 存储过程的创建以及在c#中的调用
  • 原文地址:https://www.cnblogs.com/hsd-/p/5092751.html
Copyright © 2011-2022 走看看