2015.CCF计算机软件能力认证试题第二题

// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 200005
const double eps = 1e-8;
using namespace std;
inline ll read()
{
	char ch = getchar(); ll s = 0, w = 1;
	while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
	while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
	return s * w;
}
inline void write(ll x)
{
	if (x < 0)putchar('-'), x = -x;
	if (x > 9)write(x / 10);
	putchar(x % 10 + 48);
}
ll a[15]={31,28,31,30,31,30,31,31,30,31,30,31},b[15]={31,29,31,30,31,30,31,31,30,31,30,31};
inline bool judge(ll x)
{
     return (x%400==0||(x%4==0&&x%100))?1:0;
}
int main()
{
	ll y=read(),d=read();
	ll ans1=0,ans2=0;
	if(judge(y))
    {
        for(rg i=0;i<12;i++)
        {
            if(d-b[i]>=0)
            {
                d-=b[i];
                ans1++;
                if(d==0)
                {
                    cout<<ans1<<endl<<b[ans1-1]<<endl;
                    return 0;
                }
            }
            else
            {
                ans2=d;
                cout<<ans1+1<<endl<<ans2<<endl;
                return 0;
            }
        }
        cout<<ans1<<endl<<b[ans1-1]<<endl;
                return 0;
    }
    else
    {
        for(rg i=0;i<12;i++)
        {
            if(d-a[i]>=0)
            {
                d-=a[i];
                ans1++;
                   if(d==0)
                {
                    cout<<ans1<<endl<<a[ans1-1]<<endl;
                    return 0;
                }
            }
            else
            {
                ans2=d;
                cout<<ans1+1<<endl<<ans2<<endl;
                return 0;
            }
        }
        cout<<ans1<<endl<<a[ans1-1]<<endl;
                return 0;
    }
	return 0;
}