杭电acm--1076

最新推荐文章于 2017-07-24 20:42:34 发布

原创最新推荐文章于 2017-07-24 20:42:34 发布 · 634 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

84 篇文章

订阅专栏

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.

Input

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).

Output

For each test case, you should output the Nth leap year from year Y.

#include<iostream>
using namespace std;

void main()
{
	int n, year, m;
	int count = 0;
	cin >> n;
	while (n--)
	{
		count = 0;
		cin >> year >> m;
		if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))
		{
			count = 1;
		}
		while (count < m)
		{
			year++;
			if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))
			{
				count++;
			}
		}
		cout << year << endl;
		

	}

	system("pause");
}