[1491] 나선

문제:
https://www.acmicpc.net/problem/1491

1491번: 나선

코드:

import java.util.*;

public class Main {
	public static int n;
	public static int m;
	public static int x = 0;
	public static int y = 0;
	public static int [] dx = new int[]{0,-1,0,1};
	public static int [] dy = new int[]{1,0,-1,0};
	
	public static boolean inRange(int x, int y) {
		return (0 <= x && x < m) &&  (0 <= y && y < n);
	}
    public static void main(String[] args) {
        
    	Scanner sc = new Scanner(System.in);
    	n = sc.nextInt();
    	m = sc.nextInt();
    	x = m-1;
    	y = 0;
    	int [][] arr = new int[m][n];
    	int dirNum = 0;
    	arr[m-1][0] = 1;
    	
    	for(int i=2;i<=n*m;i++) {
    		int nx = x+dx[dirNum];
    		int ny = y+dy[dirNum];
    			
    		if(!inRange(nx,ny) || arr[nx][ny] != 0) {
    			dirNum = (dirNum+1)%4;
    		}
    		
    		x= x+dx[dirNum];
			y= y+dy[dirNum];
			arr[x][y] = i;
    	}
 
    	for(int i=0;i<m;i++) {
    		for(int j=0;j<n;j++) {
    			if(arr[i][j] == n*m) {
    				System.out.println(j+" "+(m-1-i));
    			}
    		}
    	}
    }	
}