HDOJ An Easy Task 1076
来源:互联网 发布:js 新建date对象 编辑:程序博客网 时间:2024/05/29 12:55
An Easy Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16761 Accepted Submission(s): 10697
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: 1061 1170 1064 1071 1161
水题,还以为会超时呢。。
水题,还以为会超时呢。。
#include<stdio.h>bool leap(int y){ if((y%4==0&&y%100!=0)||(y%400==0)) return true; else return false;}int main(){ int t,y,b,i,s; scanf("%d",&t); while(t--){ scanf("%d%d",&y,&b); i=0,s=1; if(!leap(y)) s=0; while(1){ y++; if(leap(y))s++; if(s==b)break; } printf("%d\n",y); } return 0;}
0 0
- HDOJ 1076 An Easy Task
- HDOJ 1076 An Easy Task
- HDOJ-1076 An Easy Task
- HDOJ 1076 An Easy Task
- hdoj 1076 An Easy Task
- HDOJ An Easy Task 1076
- hdoj 1076 An Easy Task(有关闰年)
- hdoj.1076 An Easy Task 20140811
- [hdoj试题]An Easy Task
- 1076 An Easy Task
- 1076 An Easy Task
- 1076 An Easy Task
- [1076]:An Easy Task
- 1076 An Easy Task
- HDOJ 1076 An Easy Task (第n个闰年)
- HDOJ 1076 An Easy Task(闰年计算)
- [HDOJ]An Easy Task解题报告
- hdu 1076 An Easy Task
- Could not load java.net.BindException mysql驱动加载两次后报错的做法
- Letter Combinations of a Phone Number
- java程序员修炼之道(1)
- 使用@synchronized(self)
- 如何清除一个被占用的tty端口
- HDOJ An Easy Task 1076
- C. Swaps CodeForces 134C
- poj 1753 Flip Game(高斯消元 开关问题)
- 5.4
- 负载平衡
- 二叉树的计数javascript
- VS2010配置Boost安装环境
- matlab话二维图代码
- acm-poj1068解题报告