学长只能帮你到这儿了00-HDU1076
来源:互联网 发布:云计算特征 编辑:程序博客网 时间:2024/05/01 15:29
An Easy Task
Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9868 Accepted Submission(s): 6104
Problem Description
Ignatius was born in a leap year, so he want to know whenhe could hold his birthday party. Can you tell him?
Given a positive integers Y which indicate the start year, and a positiveinteger 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 ofthe input is a single integer T which is the number of test cases. T test casesfollow.
Each test case contains two positive integers Y and N(1<=N<=10000).
Output
For each test case, you should output the Nth leap yearfrom year Y.
Sample Input
3
2005 25
1855 12
2004 10000
Sample Output
2108
1904
43236
Hint
We call yearY a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.
#include <stdio.h>
#include <stdlib.h>
int main()
{
long t,y,n,k;
scanf("%d",&t);
for(k=0;k<t;k++){
scanf("%d%d", &y, &n);
if(y%4==0 && y%100 != 0 || y%400 == 0)n--;
while(n>0){
y++;
if(y%4==0 && y%100 != 0 || y%400 == 0)n--;
}
printf("%d\n",y);
}
}
- 学长只能帮你到这儿了00-HDU1076
- 学长只能帮你到这儿了00-HDU1000
- 学长只能帮你到这儿了00-HDU2550
- 学长只能帮你到这儿了00-HDU3188
- 学长只能帮你到这儿了00-HDU2560
- 学长只能帮你到这儿了00-HDU1064
- 学长只能帮你到这儿了01-HDU2000
- 学长只能帮你到这儿了01-HDU2012
- 学长只能帮你到这儿了01-HDU2018
- 学长只能帮你到这儿了01-HDU2026
- 学长只能帮你到这儿了01-HDU2008
- 学长只能帮你到这儿了01-HDU2019
- 学长只能帮你到这儿了01-HDU2032
- 学长只能帮你到这儿了01-HDU2025
- 学长只能帮你到这儿了01-HDU2021
- 学长只能帮你到这儿了01-HDU2042
- 【腾讯潜规则】师兄只能帮你到这了
- 研一上学期各门考试吐槽---师兄只能帮你到这里了
- 关于LINUX shell环境设置命令set 和 shopt
- cocos2d-x中继承CCMenu定义自己的MyMenu,这个是解决优先级的问题
- 学长只能帮你到这儿了00-HDU1064
- Git使用技巧篇
- 回文Hash
- 学长只能帮你到这儿了00-HDU1076
- MySQL编码latin1转utf8
- OpenCV中的HOG+SVM物体分类
- 学长只能帮你到这儿了01-HDU2000
- CCTableView 与 CCMenu巧妙结合
- 昌平南邵那怎么去?!!
- VFS中dentry管理
- 作为在校计算机专业的大学生,你在学什么语言?
- 学长只能帮你到这儿了01-HDU2012