当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1076：An Easy Task

题目描述
Ignatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?

Given a positive integers Y which indicate the start year, and a positive integer N, your task is to tell the Nth leap year from year Y.

Note: if year Y is a leap year, then the 1st leap year is year Y.
输入解释
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains two positive integers Y and N(1<=N<=10000).
输出解释
For each test case, you should output the Nth leap year from year Y.
输入样例 
3
2005 25
1855 12
2004 10000
输出样例 
2108
1904
43236
提示
We call year Y a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.
来自杭电HDUOJ的附加信息
Author Ignatius.L
Recommend
该题目是Virtual Judge题目，来自 杭电HDUOJ
源链接： HDU-1076
最后修改于 2020-10-25T22:41:58+00:00 由爬虫自动更新
共提交 395 次
通过率 53.16%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)