package level_2;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class SW_1976 {
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st;
int T = Integer.parseInt(br.readLine());
for (int test_case = 1; test_case <= T; test_case++) {
int[] arr = new int[4];
st = new StringTokenizer(br.readLine());
for (int n = 0; n < 4; n++) {
arr[n] = Integer.parseInt(st.nextToken());
}
int hour = arr[0] + arr[2];
int min = arr[1] + arr[3];
if (min >= 60) {
min = min % 60;
hour += 1;
}
if (hour > 12)
hour -= 12;
bw.write("#" + test_case + " " + hour + " " + min + "\n");
}
bw.flush();
bw.close();
}
}
'알고리즘 풀이 > SWEA' 카테고리의 다른 글
[SWEA][JAVA] 1961. 숫자 배열 회전 (0) | 2022.01.16 |
---|---|
[SWEA][JAVA] 1966. 숫자를 정렬하자 (0) | 2022.01.16 |
[SWEA][JAVA] 1974. 스도쿠 검증 (0) | 2022.01.16 |
[SWEA][JAVA] 1979. 어디에 단어가 들어갈 수 있을까 (0) | 2022.01.16 |
[SWEA][JAVA] 1983 .조교의 성적 매기기 (0) | 2022.01.15 |