HDOJ1491 Octorber 21st

Octorber 21st

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4943    Accepted Submission(s): 3042

Problem Description

HDU's 50th birthday, on Octorber 21st, is coming. What an exciting day!! As a student of HDU, I always want to know how many days are there between today and Octorber 21st.So, write a problem and tell me the answer.Of course, the date I give you is always in 2006.

 

Input

The input consists of T test cases. The number of T is given on the first line of the input file.Following T lines, which represent dates, one date per line. The format for a date is "month day" where month is a number between 1 (which indicates January) and 12 (which indicates December), day is a number between 1 and 31.All the date in the input are in 2006, you can assume that all the dates in the input are legal(合法).

 

Output

For each case, if the date is before Octorber 21st, you should print a number that between the date and Octorber 21st.If the day is beyond Octorber 21st, just print "What a pity, it has passed!".If the date is just Octorber 21st, print"It's today!!".

 

Sample Input

  
  

   
   7
10 20
10 19
10  1
10 21
9   1
11 11
12 12
  
  

 

Sample Output

  
  

   
   1
2
20
It's today!!
50
What a pity, it has passed!
What a pity, it has passed!
  
  

 十月二十一号是2006年的第294天，计算一下给定的日期是第几天，然后判断一下就OK。

import java.util.Scanner;

public class Main{
	private static Scanner scanner;
	public static void main(String[] args) {
		int d = 294;
		scanner = new Scanner(System.in);
		int cases = scanner.nextInt();
		while(cases-->0){
			int month = scanner.nextInt();
			int day = scanner.nextInt();
			int s = count(month, day);
			if(d == s){
				System.out.println("It's today!!");
			}else if(d > s){
				System.out.println(d-s);
			}else {
				System.out.println("What a pity, it has passed!");
			}
		}
	}
	public static int count(int month,int day){
		int arr[] = {31,28,31,30,31,30,31,31,30,31,30,31};
		int sum = 0;
		for (int i = 0; i < month-1; i++) {
			sum += arr[i];
		}
		sum += day;
		return sum;
	}
}