• CodeForces760A


    A. Petr and a calendar

    time limit per test:2 seconds
    memory limit per test:256 megabytes
    input:standard input
    output:standard output

    Petr wants to make a calendar for current month. For this purpose he draws a table in which columns correspond to weeks (a week is seven consequent days from Monday to Sunday), rows correspond to weekdays, and cells contain dates. For example, a calendar for January 2017 should look like on the picture:

    Petr wants to know how many columns his table should have given the month and the weekday of the first date of that month? Assume that the year is non-leap.

    Input

    The only line contain two integers m and d (1 ≤ m ≤ 12, 1 ≤ d ≤ 7) — the number of month (January is the first month, December is the twelfth) and the weekday of the first date of this month (1 is Monday, 7 is Sunday).

    Output

    Print single integer: the number of columns the table should have.

    Examples

    input

    1 7

    output

    6

    input

    1 1

    output

    5

    input

    11 6

    output

    5

    Note

    The first example corresponds to the January 2017 shown on the picture in the statements.

    In the second example 1-st January is Monday, so the whole month fits into 5 columns.

    In the third example 1-st November is Saturday and 5 columns is enough.

     1 //2017.01.31
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 int mouth[15] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
     9 
    10 int main()
    11 {
    12     int m, d;
    13     while(cin>>m>>d)
    14     {
    15         int ans = (mouth[m]-(7-d+1)-1)/7+1+1;
    16         cout<<ans<<endl;
    17     }
    18 
    19     return 0;
    20 }
  • 相关阅读:
    Day 9 作业题(完成)
    Day 9 函数的初识1
    Day 8 集合与文件的操作
    Day 7 深copy和浅Copy
    Day6 ,周期末考试试题
    Day 6 编码的进阶
    Day5 作业(完成)
    Day 5 字典的操作
    Day4 作业
    Day 4 list 列表的使用方法
  • 原文地址:https://www.cnblogs.com/Penn000/p/6358853.html
Copyright © 2020-2023  润新知