杭电 1076(水题 暴力)

来源:互联网 发布:mmd威风堂堂动作数据 编辑:程序博客网 时间:2024/05/17 23:47

An Easy Task

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14543    Accepted Submission(s): 9295


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
32005 251855 122004 10000
 

Sample Output
2108190443236
Hint
We call year Y a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.
 

Author
Ignatius.L

代码如下:

#include<stdio.h>int main(){    int n,y,t,i,j;    scanf("%d",&t);    while(t--)    {        scanf("%d%d",&y,&n);        for(i=0;i<n;i++)        {            for(j=y;;j++)            {                if(j%400==0||j%4==0&&j%100!=0)                {                    y=++j;                    break;                }            }        }        printf("%d\n",y-1);    }    return 0;}



0 0
原创粉丝点击