[UPD] Implementation Solution 수정

Author: tony9402

solution/implementation/10994/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/67887b7c21504d718bfffa859b209589
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/1212/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/9aebf3cefd45466aa4c24dae72837024
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/1212/main.py

@@ -1,4 +1,10 @@
-# print(bin(int(input(),8))[2:]) 짧은 풀이
+# Authored by : tony9402
+# Co-authored by : -
+# Link : http://boj.kr/7d0d2bcb568d4c3d86770e520838ef65
+import sys
+
+def input():
+    return sys.stdin.readline().rstrip()
 
 def change(num, first = False):
     ret = ''

solution/implementation/1244/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/f13978d7e3b8455c846f5825c6eca041
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/12933/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/542de8e26b06406182f52af66cda1fc8
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/14467/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/88f56047b85749c39427398cd19c31e9
 #include<bits/stdc++.h>
 
 using namespace std;
@@ -8,7 +11,6 @@ int main(){
     ios::sync_with_stdio(false);
     cin.tie(0);
 
-    // 초기화
     for(int i=0;i<=100;i++) used[i] = -1;
 
     int n; cin >> n;

solution/implementation/16926/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/b4aa5eb711ac44259b6e1d3b8a03ca59
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/17413/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/fe8c559fa57643e4a5b072a35a619f89
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/1913/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/9270997d7a5549b28187cb244dc0c62b
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/20053/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/ea1f7df70f5449f18d7cd9dc06640bb7
 #include<bits/stdc++.h>
 
 using namespace std;
@@ -9,7 +12,7 @@ int main(){
     int t; cin >> t;
     while(t--){
         int n; cin >> n;
-        int max_value = -1'000'001, min_value = 1'000'001;
+        int max_value = -1000001, min_value = 1000001;
         for(int i=0;i<n;i++){
             int x; cin >> x;
             if(max_value < x) max_value = x;

solution/implementation/20207/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/495000f668564c6c9a71fa59b0380aae
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/20291/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/76369f4f8225439084adb5f553cecae8
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/20436/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/07f3319d2d85433d8a9df15316fca395
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/20546/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/a30111114ee042f983774cf658e84fb9
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/2578/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/6a874bc16cbc470eb3338e2ec945f180
 #include<bits/stdc++.h>
 
 using namespace std;
@@ -9,24 +12,20 @@ bool bingo() {
     int line = 0;
 
     bool bingo = true;
-    // check x-axis & y-axis
     for(int i=0;i<5;i++){
-        // check x-axis
         bingo = true;
         for(int j=0;j<5;j++){
-            bingo &= used[i][j]; // 모든 곳이 체크 되어야 true
+            bingo &= used[i][j];
         }
         if(bingo) line ++;
 
-        // check y-axis
         bingo = true;
         for(int j=0;j<5;j++){
             bingo &= used[j][i];
         }
         if(bingo) line ++;
     }
 
-    // 대각선
     bingo = true;
     for(int i=0;i<5;i++){
         bingo &= used[i][i];

solution/implementation/2753/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/a5fabcbae0604daabb17802f9323c69f
 #include<bits/stdc++.h>
 
 using namespace std;

solution/implementation/4396/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/a6ba32f17093473f9e0f5f3dee9f7ced
 #include<bits/stdc++.h>
 
 using namespace std;
@@ -10,7 +13,6 @@ int main(){
     ios::sync_with_stdio(false);
     cin.tie(0);
 
-    // Input
     int n; cin >> n;
     board.resize(n); push.resize(n);
     for(int i=0;i<n;i++) cin >> board[i];

solution/implementation/5597/main.cpp

@@ -1,3 +1,6 @@
+// Authored by : tony9402
+// Co-authored by : -
+// Link : http://boj.kr/2fdc4dd328f9417b8b9f64e2ed0640be
 #include<bits/stdc++.h>
 
 using namespace std;