SWEA_D3_7510_상원이의 연속 합

06월 28일 in Category / Algorithm

SWEA

7510. 상원이의 연속 합

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Solution {
	static int T, S, E, M, s, e, m;
	static int tmp;
	static StringTokenizer st;

	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

		T = Integer.parseInt(in.readLine().trim());
		for (int test_case = 1; test_case <= T; test_case++) {
			st = new StringTokenizer(in.readLine());

			S = Integer.parseInt(st.nextToken());
			E = Integer.parseInt(st.nextToken());
			M = Integer.parseInt(st.nextToken());

			tmp = S;
			while (true) {
				e = tmp % 24;
				m = tmp % 29;

				e = e == 0 ? 24 : e;
				m = m == 0 ? 29 : m;

				if(E==e && M==m) {
					break;
				}

				tmp += 365;
			}

			System.out.println("#" + test_case + " " + tmp);

		}
	}
}