#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a) for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a) scanf(in64,&a)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define SZ(a) ((int)a.size())
#define PP(n,m,a) puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int s[20];
void init()
{
MM(s,0);
for(int i=2;i<=12;i++)
{
s[i] = s[i-1] + a[i-1];
}
return ;
}
int n,m;
int temp;
int main()
{
init();
cin>>n>>m;
if(m<1 && m>12)
{
cout<<"Impossible"<<endl;
return 0;
}
if(n>a[m])
{
cout<<"Impossible"<<endl;
return 0;
}
temp = s[m] + n - 1;
temp %= 7;
temp += 1;
cout<<temp<<endl;
return 0;
}
SGU 115 Calendar
最新推荐文章于 2018-05-03 20:53:14 发布