杭电oj-1076-An Easy Task
来源:互联网 发布:csi网络犯罪调查有罗素 编辑:程序博客网 时间:2024/05/02 04:23
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
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.
这道题的意思是给你一个数T,代表有T组测试数据,每组测试数据有两个整数,分别代表当前的年份m以及第n个闰年,让你计算从当前年份开始第n个闰年的年份y是多少。
思路:这一题咋一看感觉没啥思路,因为像2100年这样非闰年的数没有什么办法判断出来。因此只能一年一年的判断到最后一个闰年的年份,所幸此题数据不大,可暴力强过。
代码如下:
#include <stdio.h>
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int a,b;
scanf("%d %d",&a,&b);
int i=0;
//判断当前年份是否为闰年
if((a%4==0&&a%100!=0)||(a%400==0))
i=1;
//暴力判断是否为闰年
while(i!=b)
{
a+=1;
if((a%4==0&&a%100!=0)||(a%400==0))
i++;
}
printf("%d\n",a);
}
return 0;
}
0 0
- 杭电OJ--1076 An Easy Task
- 杭电oj-1076-An Easy Task
- 杭电oj-An Easy Task
- 杭电1076 An Easy Task
- 杭电acm 1076 An Easy Task
- 杭电 HDU 1076 An Easy Task
- 杭电1076 An Easy Task
- 贪心算法—杭电1076 An Easy Task
- hdu-oj 1076 An Easy Task
- 杭电OJ(HDU)-ACMSteps-Chapter Two-《An Easy Task》《Buildings》《decimal system》《Vowel Counting》
- 杭电oj An easy problem
- 【杭电-oj】-2055-An easy problem
- 1076 An Easy Task
- 1076 An Easy Task
- 1076 An Easy Task
- [1076]:An Easy Task
- 1076 An Easy Task
- 杭电1047 An Easy Task - java 解读
- windows 进程通信(使用DDE)
- mysql安装下载配置
- Linux下安装Nginx
- poj 1363Rails
- 高斯传记资料(2012-12-01 20:54:55)
- 杭电oj-1076-An Easy Task
- 黑马程序员---String字符串小结
- iOS(5)线程是什么?进程是什么?二者有什么区别和联系?
- c# 数据加密
- 进程调度
- 如何选择AFNetworking版本
- Swift(七、函数)
- windows的cmd窗口进入指定文件夹(即目录)和cmd默认窗口大小设置
- 导入android源码有错,R.java文件不能自动生成解决方法 http://caizi12.iteye.com/blog/975125