19-20 동계 모각코 동아리 7회차 결과

package bj;

import java.util.*;

public class bj_14500 {
	//int cnt = 3;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int max = -9999;
		int[][] a = new int[n][m];
		int sum = 0;
		int result = -9999;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
				max = Math.max(a[i][j], max);
			}
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (max == a[i][j]) {
					sum = findT(a, i, j, n, m);
					result = Math.max(sum, result);
				}
			}
		}
		System.out.println(result);

	}

	static int findT(int[][] a, int n, int m, int r, int c) {
		int sum = 0;
		int max = -9999;
		int cnt = 3;
		while (cnt-- > 0) {
			if (n - 1 > 0 && n + 1 < r && m - 1 > 0 && m + 1 < c) {
				max = Math.max(Math.max(Math.max(a[n - 1][m], a[n + 1][m]), a[n][m - 1]), a[n][m + 1]);
				cnt--;
				if (max == a[n - 1][m]) {
					sum += findT(a, n - 1, m, r, c);
				} else if (max == a[n + 1][m]) {
					sum += findT(a, n + 1, m, r, c);
				} else if (max == a[n][m - 1]) {
					sum += findT(a, n, m - 1, r, c);
				} else if (max == a[n][m + 1]) {
					sum += findT(a, n, m + 1, r, c);
				}

			} else if (n + 1 < r && m - 1 > 0 && m + 1 < c) {
				max = Math.max(Math.max(a[n + 1][m], a[n][m - 1]), a[n][m + 1]);
				if (max == a[n + 1][m]) {
					sum += findT(a, n + 1, m, r, c);
				} else if (max == a[n][m - 1]) {
					sum += findT(a, n, m - 1, r, c);
				} else if (max == a[n][m + 1]) {
					sum += findT(a, n, m + 1, r, c);
				}
			} else if (n - 1 > 0 && n + 1 < r && m + 1 < c) {
				max = Math.max(Math.max(a[n - 1][m], a[n + 1][m]), a[n][m + 1]);
				if (max == a[n - 1][m]) {
					sum += findT(a, n - 1, m, r, c);
				} else if (max == a[n + 1][m]) {
					sum += findT(a, n + 1, m, r, c);
				} else if (max == a[n][m + 1]) {
					sum += findT(a, n, m + 1, r, c);
				}
			}
		}
		return sum;

	}
}

package bj;

import java.util.*;

public class bj_6064 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);

		int T = sc.nextInt();

		while (T-- > 0) {
			int m = sc.nextInt();
			int n = sc.nextInt();
			int x = sc.nextInt()-1;
			int y = sc.nextInt()-1;
			boolean ok = false;
			if (x == y) {
				System.out.println(x);
			} else {

				for (int i = x; i<m*n; i+=m) {
					if (i % n == y) {
						System.out.println(i+1);
						ok = true;
						break;
					}
				}
				if(!ok){
					System.out.println(-1);
				}
			}
		}
	}

}