From f9eeb5044a659c2959f199e459785e2dd9b82e33 Mon Sep 17 00:00:00 2001
From: Hoyoung Jung <honux77@gmail.com>
Date: Mon, 3 Jun 2019 15:48:06 +0900
Subject: [PATCH] BOJ 1913 snail

---
 190530/honux/1913-snail.cpp | 56 +++++++++++++++++++++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 190530/honux/1913-snail.cpp

diff --git a/190530/honux/1913-snail.cpp b/190530/honux/1913-snail.cpp
new file mode 100644
index 0000000..9983edf
--- /dev/null
+++ b/190530/honux/1913-snail.cpp
@@ -0,0 +1,56 @@
+#include <stdio.h>
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <map>
+
+using namespace std;
+int dr[] = { -1, 0, 1, 0 };
+int dc[] = { 0, 1, 0, -1 };
+
+
+int main() {
+	int n;
+	scanf("%d", &n);
+	vector <vector <int>> m(n);
+	map<int, pair<int, int>> nmap;
+	for (int i = 0; i < n; i++) {
+		m[i].resize(n);
+	}
+
+	int num = 1;
+	int row = n / 2;
+	int col = row;
+	double w = 1;
+	m[row][col] = num;
+	int vec = 0;
+
+	bool loop = true;
+	while (loop) {
+		for (int i = 0; i < (int) w; i++) {
+			num++;
+			if (num > n * n) {
+				loop = false;
+				break;
+			}
+			row += dr[vec];
+			col += dc[vec];
+			m[row][col] = num;
+			nmap[num] = make_pair(row + 1, col + 1);
+		}
+		vec = (vec + 1) % 4;
+		w += 0.5;
+	}
+
+	for (auto v : m) {
+		for (auto n : v) {
+			printf("%d ", n);
+		}
+		printf("\n");
+	}
+
+	int x;
+	scanf("%d", &x);
+	printf("%d %d\n", nmap[x].first, nmap[x].second);
+	return 0;
+}