Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

30 days has September,
April, June and November
All the rest have 31
And February’s great with 28
And Leap Year’s February’s fine with 29

The Gregorian calendar, the current standard calendar in most part of the world, adds a 29^th day to February in all years evenly divisible by 4, except for centennial years (those ending in -00) which are not evenly divisible by 400. Thus 1600, 2000 and 2400 are leap years but 1700, 1800, 1900, 2100, 2200 and 2300 are not.

In this problem, we are concerned with dates. You will be given a date and an integer K. You have to find the date in the calendar after K days from the given date.

Input

The first line of input is an integer T(T<50) that represents the number of test cases. Each case contains two lines. The first line is a date in the format yyyy-month-dd. year is an integer in the range [1900, 3000], month is a string from the set {January, February, March, April, May, June, July, August, September, October, November and December} and dd is an integer in the range [01,31]. The second line contains an integer K(0<K<10000).

The input date will be a valid one.

Output

For each input, output the case number followed by the date after K days in the same format as that of input. Look at the sample for exact format.

ProblemSetter: Sohel Hafiz

import java.util.Scanner;
import java.util.Calendar;
import java.util.GregorianCalendar;

public class Main {
    static String[] month = { "January", "February", "March", "April", "May",
            "June", "July", "August", "September", "October", "November",
            "December" };

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int t = cin.nextInt();
        int cases = 0;
        String a, b, c, s;
        while (t-- != 0) {
            s = cin.next();
            int pos1 = s.indexOf('-', 0);
            int pos2 = s.indexOf('-', pos1 + 1);
            a = s.substring(0, pos1);
            b = s.substring(pos1 + 1, pos2);
            c = s.substring(pos2 + 1);
            int dd = cin.nextInt(), monthnum = 0;
            for (int i = 0; i < 12; i++)
                if (month[i].equals(b))
                    monthnum = i;
            GregorianCalendar date = new GregorianCalendar(Integer.parseInt(a),
                    monthnum, Integer.parseInt(c));
            date.add(Calendar.DATE, dd);
            System.out.printf("Case %d: %d-%s-%02d\n", ++cases,
                    date.get(Calendar.YEAR), month[date.get(Calendar.MONTH)],
                    date.get(Calendar.DATE));

        }
    }
}