HDU1076

An Easy Task

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

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
3
2005 25
1855 12
2004 10000

Sample Output
2108
1904
43236

Hint

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

Author
Ignatius.L

利用周期加速 400年一个循环 你懂的
水题又WA了好几次 心好累

#include "cstring"
#include "string.h"
#include "cstdio"
#include "iostream"


using namespace std;

int ans[500];

int main()
{
    int n;
    int newcount = 0;
    for (int i = 1; i <= 400; i++)
    {
        if ((i % 4 == 0 && (i % 100) != 0) || i % 400 == 0)
        {
            newcount++;
            ans[i] = newcount;
        }
        else
            ans[i] = newcount;

    }

    while (scanf("%d", &n)!=EOF)
    {
        while (n--)
        {
            int th;
            int year;
            scanf("%d %d", &year, &th);
            int originleapyear = (year / 400)*ans[400] + ans[(year % 400)];
            int temp = th / ans[400];
            int nowyear = year + 400 * temp;
            int count = 97 * (temp-1);
            for (int i = nowyear-400; i <= nowyear+400; i++)
            {
                if (count == th)
                {
                    printf("%d\n", i - 1);
                    break;
                }

                if ((i % 4 == 0 && (i % 100) != 0) || i % 400 == 0)
                {
                    count++;
                }
            }
        }

    }
}