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;
    }
    

      

  • 相关阅读:
    Linux系统运维之MYSQL数据库集群部署(主从复制)
    Linux系统运维之负载均衡Tengine
    Linux系统运维之subversionEdge部署
    Linux系统运维之Hadoop、Hive、Flume数据处理
    CoIDE在STM32系列单片机中的使用实践
    软硬件调试九法:第三条规则 不要想而要看
    《产品经理》读书笔记
    <读书笔记> 代码整洁之道
    关于鼠标手的症状和恢复方法
    <读书笔记>软件调试之道 :从大局看调试-理想的调试环境
  • 原文地址:https://www.cnblogs.com/hsd-/p/5092751.html
Copyright © 2011-2022 走看看