-
Notifications
You must be signed in to change notification settings - Fork 13
/
SherlockDate.java
69 lines (58 loc) · 1.98 KB
/
SherlockDate.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
* Problem Link - https://www.hackerearth.com/problem/algorithm/sherlock-and-date/
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
class SherlockDate {
public static void main(String args[] ) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(System.out);
String months[] = {"January", "February", "March", "April", "May", "June", "July", "August",
"September", "October", "November", "December"};
int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int testCases = Integer.parseInt(reader.readLine());
while(testCases-- > 0) {
String inputLine[] = reader.readLine().split(" ");
int d = Integer.parseInt(inputLine[0]);
String month = inputLine[1];
int year = Integer.parseInt(inputLine[2]);
if(d == 1) {
if(month.equals("January")) {
year--;
writer.write("31 December " + year + "\n");
} else {
int index = 0;
for(int i=0;i<12;i++) {
if(months[i].equals(month)) {
index = i;
break;
}
}
index--;
int f = days[index];
if(isLeapYear(year) && month.equals("March")) {
f++;
}
writer.write(f + " " + months[index] + " " + year + "\n");
}
} else {
d--;
writer.write(d + " " + month + " " + year + "\n");
}
}
reader.close();
writer.flush();
writer.close();
}
public static boolean isLeapYear(int year) {
if(year % 4 == 0) {
if(year % 100 == 0) {
if(year % 400 == 0) {
return true;
} else return false;
} else return true;
}else return false;
}
}