An Easy Task

Super_gxw

于 2019-04-05 19:15:07 发布

阅读量237

点赞数

分类专栏： ACM 文章标签： ACM练习

本文链接：https://blog.csdn.net/Super_gxw/article/details/89046634

版权

ACM 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem Description

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.

Sample Input

Sample Output

2108
1904
43236

#include <bits/stdc++.h>
using namespace std;
int main()
{
	vector <int> v;
	for(int i=1;i<=100000;i++)
	{
		if(i%400==0||(i%4==0&&i%100!=0))
			v.push_back(i);
	}
	int n;
	cin>>n;
	while(n--)
	{
		int y,m,t;
		cin>>y>>m;
		for(int i=0;i<v.size();i++)
		{
			if(v[i]>=y)
			{
				t=i;
				break;
			}	
		}
		cout<<v[t+m-1]<<endl;
	}
	return 0;
}