-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminTimeStamp.java
More file actions
59 lines (47 loc) · 1.65 KB
/
minTimeStamp.java
File metadata and controls
59 lines (47 loc) · 1.65 KB
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
package hemant.code.problems;
import java.util.Arrays;
import java.util.Scanner;
public class minTimeStamp {
public static void main(String[] args) {
int h1;
int h2;
int s1;
int s2;
int m1;
int m2;
Scanner sc = new Scanner(System.in);
int[] numbers = new int[6];
for(int i=0;i<numbers.length;i++)
{
numbers[i]=sc.nextInt();
}
Arrays.sort(numbers);
if(numbers[0]==0&&numbers[1]==0&&numbers[2]==0&&numbers[3]==0)
{
s2 = numbers[5];
s1 = numbers[4];
h2 = numbers[1];
m1 = numbers[2];
m2 = numbers[3];
h1 = numbers[0];
System.out.println("minimum date is " + h1 + h2 + ":" + m1 + m2 + ":" + s1 + s2 );
}
else if(!(numbers[1]==0&&numbers[2]==0&&numbers[3]==0&&numbers[0]==0)) {
s2 = numbers[5];
m2 = numbers[4];
if (numbers[3] < 6 && numbers[2] < 6) {
m1 = numbers[2];
s1 = numbers[3];
if ((numbers[0] == 2 && numbers[1] < 4) || (numbers[0] == 1 || numbers[0] == 0)) {
h2 = numbers[1];
h1 = numbers[0];
System.out.println("minimum date is " + h1 + h2 + ":" + m1 + m2 + ":" + s1 + s2);
}
}
}
else
{
System.out.println("Date not possible");
}
}
}