[UPD] Add Implementation Solution

Author: tony9402

implementation/README.md

@@ -16,7 +16,6 @@
 
 [백준 문제집](https://www.acmicpc.net/workbook/view/6783)
 
-
 |          순번          |        추천 문제         |        문제 이름         |         난이도          |        풀이 링크         |
 | :-----: | :-----: | :-----: | :-----: | :-----: |
 | 00 |  :heavy_check_mark:  | <a href="http://boj.kr/1212" target="_blank">8진수 2진수</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/2.svg"/> | <a href="./../solution/implementation/1212">바로가기</a> |
@@ -32,7 +31,7 @@
 | 10 |  :heavy_check_mark:  | <a href="http://boj.kr/1244" target="_blank">스위치 켜고 끄기</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> | <a href="./../solution/implementation/1244">바로가기</a> |
 | 11 |  :heavy_check_mark:  | <a href="http://boj.kr/10994" target="_blank">별 찍기 - 19</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> | <a href="./../solution/implementation/10994">바로가기</a> |
 | 12 |  :heavy_check_mark:  | <a href="http://boj.kr/20291" target="_blank">파일 정리</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> | <a href="./../solution/implementation/20291">바로가기</a> |
-| 13 |  :heavy_check_mark:  | <a href="http://boj.kr/20436" target="_blank">ZOAC 3</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> |                      |
+| 13 |  :heavy_check_mark:  | <a href="http://boj.kr/20436" target="_blank">ZOAC 3</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> | <a href="./../solution/implementation/20436">바로가기</a> |
 | 14 |  :heavy_check_mark:  | <a href="http://boj.kr/16926" target="_blank">배열 돌리기 1</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/7.svg"/> | <a href="./../solution/implementation/16926">바로가기</a> |
 | 15 |  :heavy_check_mark:  | <a href="http://boj.kr/17413" target="_blank">단어 뒤집기 2</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/8.svg"/> | <a href="./../solution/implementation/17413">바로가기</a> |
 | 16 |  :heavy_check_mark:  | <a href="http://boj.kr/2615" target="_blank">오목</a> | <img height="25px" width="25px=" src="https://static.solved.ac/tier_small/8.svg"/> |                      |

implementation/list.md

@@ -15,7 +15,7 @@
 1,별 찍기 - 19,10994,s4,./../solution/implementation/10994
 ,할아버지는 유명해!,5766,s4,
 1,파일 정리,20291,s4,./../solution/implementation/20291
-1,ZOAC 3,20436,s4,
+1,ZOAC 3,20436,s4,./../solution/implementation/20436
 1,단어 뒤집기 2,17413,s3,./../solution/implementation/17413
 1,오목,2615,s3,
 ,이진수 덧셈,2729,s3,

solution/implementation/20436/main.cpp

@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+const string qwerty[3] = {"qwertyuiop", "asdfghjkl", "zxcvbnm"};
+const string OnlyLeft  = "qwertasdfgzxcv";
+int X[33], Y[33];
+
+bool isLeft(char x){ return OnlyLeft.find(x) != string::npos; }
+int dist(char a, char b){return abs(Y[a-'a']-Y[b-'a']) + abs(X[a-'a']-X[b-'a']); }
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+
+    for(int i=0;i<3;i++){
+        for(int j=0;j<(int)qwerty[i].size();j++){
+            Y[qwerty[i][j] - 'a'] = i;
+            X[qwerty[i][j] - 'a'] = j;
+        }
+    }
+
+    char L, R; cin >> L >> R;
+    string word; cin >> word;
+
+    int answer = 0;
+    for(auto &w: word){
+        if(isLeft(w)) {
+            answer += dist(L, w) + 1;
+            L = w;
+        }
+        else {
+            answer += dist(R, w) + 1;
+            R = w;
+        }
+    }
+    cout << answer;
+
+    return 0;
+}
+

solution/implementation/2615/main.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+const int dy[] = {-1,1,0,0,-1,-1,1,1};
+const int dx[] = {0,0,-1,1,-1,1,-1,1};
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+
+    const int N = 19;
+
+    for(int i=0;i<N;i++){
+        for(int j=0;j<N;j++){
+            
+        }
+    }
+
+    return 0;
+}