#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
void solve(int now,int n)
{
if(!n)
{
printf("%d\n",now);
return;
}
solve(now+4*n,(now+4*n)/100-now/100-(now+4*n)/400+now/400);
}
int main()
{
int t,n,now;
scanf("%d",&t);
while(t--&&scanf("%d%d",&now,&n)!=EOF)
{
int nownow=now;
now=now-now%4;
if(now%100==0&&now%400)
now-=4;
if(now==nownow)
n--;
solve(now,n);
}
return 0;
}
hdu 1076 简单处理+递归
最新推荐文章于 2018-01-07 20:11:46 发布