From 680847ab41367943ee12d88634ac966c61ea40f0 Mon Sep 17 00:00:00 2001
From: monsileI <hansaem900d@kakao.com>
Date: Thu, 23 Jun 2022 20:26:34 +0900
Subject: [PATCH] =?UTF-8?q?=EB=8B=AC=ED=8C=BD=EC=9D=B4=20=EB=AC=B8?=
 =?UTF-8?q?=EC=A0=9C=20-=20=EB=B0=B1=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Basic_Of_Algorithm/src/test/snail.java | 109 +++++++++++++++++++++++++
 1 file changed, 109 insertions(+)
 create mode 100644 Basic_Of_Algorithm/src/test/snail.java

diff --git a/Basic_Of_Algorithm/src/test/snail.java b/Basic_Of_Algorithm/src/test/snail.java
new file mode 100644
index 0000000..17833e0
--- /dev/null
+++ b/Basic_Of_Algorithm/src/test/snail.java
@@ -0,0 +1,109 @@
+package test;
+
+import java.io.*;
+
+public class snail {
+	
+	public static void main(String[] args) throws IOException {
+		
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int n = Integer.parseInt(br.readLine());
+		int t = Integer.parseInt(br.readLine());
+		solve1(n,t); // 바깥쪽에서 안쪽
+		solve2(n,t); // 안쪽에서 바깥쪽
+		
+	}
+
+	// 바깥쪽에서 안쪽으로 돌기
+	static void solve1(int n, int t) {
+		int[][] map = new int[n][n];
+		int value = n*n;
+		int x=0,y=0;
+		int time=0;
+		int limit =n;
+		while(value>0) {
+			x=time;
+			for(int i=y; i<limit; i++) {
+				map[i][x] = value--;
+			}
+			
+			y=limit-1;
+			for(int i=x+1; i<limit; i++) {
+				map[y][i] = value--;
+			}
+			
+			x=limit-1;
+			for(int i=y-1; i>=time; i--) {
+				map[i][x] = value--;
+			}
+			
+			y=time;
+			for(int i=x-1; i>time; i--) {
+				map[y][i] = value--;
+			}
+			time++;
+			limit--;
+			y=time;
+		}
+		
+		StringBuilder sb = new StringBuilder();
+		int tx=0, ty=0;
+		for(int i=0; i<n; i++) {
+			for(int j=0; j<n; j++) {
+				if(t==map[i][j]) {
+					ty=i+1;
+					tx=j+1;
+				}
+				sb.append(map[i][j] +" ");
+			}
+			sb.append("\n");
+		}
+		sb.append(ty+" "+tx);
+		System.out.println(sb.toString());
+	}
+
+	// 안쪽에서 바깥쪽으로 돌기
+	static void solve2(int n, int t){
+		int[][] map = new int[n][n];
+		int value =1;
+		
+		int x = n/2, y=n/2;
+		
+		int limit =1;
+		while(true) {
+			for(int i=0; i<limit; i++) {
+				map[y--][x] = value++;
+			}
+			if(value-1 == n*n) break;
+			for(int i=0; i<limit; i++) {
+				map[y][x++] = value++;
+			}
+			
+			limit++;
+			for(int i=0; i<limit; i++) {
+				map[y++][x] = value++;
+			}
+			
+			for(int i=0; i<limit; i++) {
+				map[y][x--] = value++;
+			}
+			limit++;
+		}
+		
+		StringBuilder sb = new StringBuilder();
+		int tx=0, ty=0;
+		for(int i=0; i<n; i++) {
+			for(int j=0; j<n; j++) {
+				if(t==map[i][j]) {
+					ty=i+1;
+					tx=j+1;
+				}
+				sb.append(map[i][j] +" ");
+			}
+			sb.append("\n");
+		}
+		sb.append(ty+" "+tx);
+		System.out.println(sb.toString());
+	}
+	
+}