Good Bye 2015

一周特定日糖果储蓄计划：2016年全年糖果总数预测

最新推荐文章于 2017-03-09 20:19:26 发布

原创最新推荐文章于 2017-03-09 20:19:26 发布 · 265 阅读

0 ·

CC 4.0 BY-SA版权

code 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一只名为Limak的小北极熊如何通过在2016年的特定日子储蓄糖果来展示其责任感。通过分析Limak选择的计划，我们计算了他一年中总共能保存多少糖果。具体而言，如果Limak选择在一周的某一天或一个月的某一天进行糖果储蓄，我们将探讨一年中他能积累多少糖果。

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

Input

30 of month

Output

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

#include <bits/stdc++.h>
using namespace std ;

int main()
{
    int day ;
    string str,str0,s="week";
    cin >> day >> str0 >> str ;
    
    if(!str.compare(s))   //week
        {
            if(day == 6)
                cout << "53" <<endl;
            else if(day ==5)
                cout << "53"<<endl;
            else
                cout << "52" << endl;

        }
   if(!str.compare("month")) 
    {
        if(day<=29)
            cout << "12"<<endl;
        else if(day<=30)
            cout << "11"<<endl;
        else  if(day ==31)
            cout << "7"<<endl;

    }
    return 0;

}