hdu 1076 An Easy Task
来源:互联网 发布:ug编程自学能学会吗 编辑:程序博客网 时间:2024/05/29 18:47
An Easy Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19908 Accepted Submission(s): 12725
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.
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).
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
2108190443236HintWe call year Y a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1097 1061 1013 1032 1170
Y 开始以后的第N个闰年
闰年为能被4整除不能被100整除 或者被400整除
#include <stdio.h>int main(){int ncase;scanf("%d",&ncase);while(ncase--){int year,n;scanf("%d %d",&year,&n);for(int i=year;;i++){if((i%4==0&&i%100)||i%400==0)n--;if(n==0){printf("%d\n",i);break;}}}return 0;}
1 0
- hdu 1076 An Easy Task
- HDU 1076 An Easy Task
- HDU 1076 An Easy Task
- Hdu 1076 - An Easy Task
- HDU 1076 An Easy Task
- hdu 1076 An Easy Task
- hdu 1076 An Easy Task
- HDU 1076 An Easy Task
- hdu-1076-An Easy Task
- hdu 1076 An Easy Task
- HDU 1076An Easy Task
- hdu 1076 An Easy Task
- hdu 1076 An Easy Task
- HDU 1076 An Easy Task
- hdu 1076 An Easy Task
- HDU 1076 An Easy Task
- HDU 1076 An Easy Task
- hdu 1076 an easy task
- Hbase总结(十)Hhase性能调优
- git上传新项目到git地址
- Xilinx中的xapp1052理解
- C语言 位运算
- OpenCV第一课
- hdu 1076 An Easy Task
- 两种创建对象的方法
- mysql基础(三)
- Educational Codeforces Round 12 D. Simple Subset
- 观察者模式
- 机器学习之单变量线性回归(Linear Regression with One Variable)
- /*外接矩形部分*/
- 诡异的Android开发中EditText键盘弹出后被遮盖的bug
- 【Linux C 王者归来】【第四章】【指针与字符串】