Sgu 115

115. Calendar

time limit per test: 0.25 sec. memory limit per test: 4096 KB

 

First year of new millenium is gone away. In commemoration of it write a program that finds the name of the day of the week for any date in 2001.

 

Input

Input is a line with two positive integer numbers N and M, where N is a day number in month M. N and M is not more than 100.

 

Output

Write current number of the day of the week for given date (Monday – number 1, … , Sunday – number 7) or phrase “Impossible” if such date does not exist.

 

Sample Input

21 10

Sample Output

7

---

Author	: Michael R. Mirzayanov
Resource	: PhTL #1 Training Contests
Date	: January 2002

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff 
#define mod 1000000007
#define ll long long
#define maxn 100025
#define pi acos(-1.0)
int n, m, d;
int f [] = { 0, 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int main(){
    for (int i = 1; i <= 12; i++)f[i] += f[i - 1];
    int flag = 1;
    scanf("%d%d", &d, &m);
    if (m <= 0 || m > 12 || d <= 0 || d > 31)flag = 0;
    if (m == 2 && d > 28 || ((m == 4 || m == 6 || m == 9 || m == 11) && d > 30))flag = 0;
    printf(flag?"%d\n":"Impossible\n", (d + f[m]-1)%7+1);
    return 0;
}