fix .

Author: bsp

Day1/Average LEVEL1/Day1/AverageDay1/Average renamed to LEVEL1/Day1/Average

@@ -1,13 +1,13 @@
-# 2. 직사각형 별찍기
-
-n, m = map(int, input().strip().split(' '))
-
-for i in range(m):
-    for j in range(n):
-        print('*', end = '')
-    print()
-print()
-
-answer = ('*' * n + '\n') * m
-print(answer)
-
+# 2. 직사각형 별찍기
+
+n, m = map(int, input().strip().split(' '))
+
+for i in range(m):
+    for j in range(n):
+        print('*', end = '')
+    print()
+print()
+
+answer = ('*' * n + '\n') * m
+print(answer)
+

Day1/Average_sb.py LEVEL1/Day1/Average_sb.pyDay1/Average_sb.py renamed to LEVEL1/Day1/Average_sb.py

@@ -1,73 +1,73 @@
-# 19.  시저 암호
-
-def solution(s, n):
-    answer = ''
-
-    for char in s:
-        if char.isalpha():
-            if 65 <= ord(char) <= 90:
-                if ord(char) + n > 90:
-                    answer += chr(ord(char) - 26 + n)
-                else:
-                    answer += chr(ord(char) + n)
-            else:
-                if ord(char) + n > 122:
-                    answer += chr(ord(char) - 26 + n)
-                else:
-                    answer += chr(ord(char) + n)
-        else:
-            answer += ' '
-    return answer
-
-s_1 = 'AB'
-s_2 = 'z'
-s_3 = 'a B z'
-
-n_1 = 1
-n_2 = 1
-n_3 = 4
-
-print(solution(s_1, n_1))
-print(solution(s_2, n_2))
-print(solution(s_3, n_3))
-
-def solution_best(s, n):
-    answer = ''
-    str = list(s)
-    for i in range(len(str)):
-        if str[i].isupper():
-            str[i] = chr((ord(str[i]) - ord('A') + n) % 26 + ord('A'))
-        elif str[i].islower():
-            str[i] = chr((ord(str[i]) - ord('a') + n) % 26 + ord('a'))
-
-    answer = ''.join(str)
-    return answer
-
-print(solution_best(s_1, n_1))
-print(solution_best(s_2, n_2))
-print(solution_best(s_3, n_3))
-# 틀린 풀이
-def solution_error(s, n):
-    answer = ''
-
-    # string을 ascii로 바꾼 리스트
-    str_ascii_lst = [ord(i) for i in s]
-    # print(str_ascii_lst)
-
-    for idx, cost in enumerate(str_ascii_lst):
-        if cost == 32:
-            str_ascii_lst[idx] -= 4
-        str_ascii_lst[idx] += n
-
-    # print(str_ascii_lst)
-    for i in str_ascii_lst:
-        idx = str_ascii_lst.index(i)
-        if 90 < i and i < 97:
-            rest = i - 90
-            str_ascii_lst[idx] = 64 + rest
-        elif 122 < i:
-            rest = i - 122
-            str_ascii_lst[idx] = 96 + rest
-
-    answer = ''.join(chr(i) for i in str_ascii_lst)
+# 19.  시저 암호
+
+def solution(s, n):
+    answer = ''
+
+    for char in s:
+        if char.isalpha():
+            if 65 <= ord(char) <= 90:
+                if ord(char) + n > 90:
+                    answer += chr(ord(char) - 26 + n)
+                else:
+                    answer += chr(ord(char) + n)
+            else:
+                if ord(char) + n > 122:
+                    answer += chr(ord(char) - 26 + n)
+                else:
+                    answer += chr(ord(char) + n)
+        else:
+            answer += ' '
+    return answer
+
+s_1 = 'AB'
+s_2 = 'z'
+s_3 = 'a B z'
+
+n_1 = 1
+n_2 = 1
+n_3 = 4
+
+print(solution(s_1, n_1))
+print(solution(s_2, n_2))
+print(solution(s_3, n_3))
+
+def solution_best(s, n):
+    answer = ''
+    str = list(s)
+    for i in range(len(str)):
+        if str[i].isupper():
+            str[i] = chr((ord(str[i]) - ord('A') + n) % 26 + ord('A'))
+        elif str[i].islower():
+            str[i] = chr((ord(str[i]) - ord('a') + n) % 26 + ord('a'))
+
+    answer = ''.join(str)
+    return answer
+
+print(solution_best(s_1, n_1))
+print(solution_best(s_2, n_2))
+print(solution_best(s_3, n_3))
+# 틀린 풀이
+def solution_error(s, n):
+    answer = ''
+
+    # string을 ascii로 바꾼 리스트
+    str_ascii_lst = [ord(i) for i in s]
+    # print(str_ascii_lst)
+
+    for idx, cost in enumerate(str_ascii_lst):
+        if cost == 32:
+            str_ascii_lst[idx] -= 4
+        str_ascii_lst[idx] += n
+
+    # print(str_ascii_lst)
+    for i in str_ascii_lst:
+        idx = str_ascii_lst.index(i)
+        if 90 < i and i < 97:
+            rest = i - 90
+            str_ascii_lst[idx] = 64 + rest
+        elif 122 < i:
+            rest = i - 122
+            str_ascii_lst[idx] = 96 + rest
+
+    answer = ''.join(chr(i) for i in str_ascii_lst)
     return answer

Day1/README.md LEVEL1/Day1/README.mdDay1/README.md renamed to LEVEL1/Day1/README.md

@@ -1,50 +1,50 @@
-# 41. 삼진법 뒤집기
-
-# 어디가 틀린거지??? 내 풀이 ㅠㅠ
-def solution(n):
-    answer = 0
-
-    Ternary_str = ''
-    while n > 0:
-        Ternary_str += str(n % 3)
-        n //= 3
-
-    cnt = 1
-    for each_chr in reversed(Ternary_str):
-        answer += cnt * int(each_chr)
-        cnt *= 3
-
-    return answer
-
-n_1 = 45
-n_2 = 125
-
-print(solution(n_1))
-print(solution(n_2))
-
-def solution_error(n):
-    answer = 0
-
-    # 3진법 문자열 -> '1200'
-    Ternary_str = ''
-
-    quota, rest = n // 3, n % 3
-    Ternary_str += str(rest)
-
-    if n != 1:
-        # 45 -> '1200' -> '0021'
-        while quota > 3:
-            rest = quota % 3
-            quota //= 3
-            Ternary_str += str(rest)
-        Ternary_str += str(quota)
-
-    # 10진법 리스트 ... '0021' -> [0, 0, 2, 1]
-    Decimal_lst = [int(i) for i in Ternary_str]
-
-    for i in range(len(Decimal_lst)):
-        answer += Decimal_lst[i] * (3 ** (len(Decimal_lst) - i - 1))
-    return answer
-
-# print(solution_error(n_1))
+# 41. 삼진법 뒤집기
+
+# 어디가 틀린거지??? 내 풀이 ㅠㅠ
+def solution(n):
+    answer = 0
+
+    Ternary_str = ''
+    while n > 0:
+        Ternary_str += str(n % 3)
+        n //= 3
+
+    cnt = 1
+    for each_chr in reversed(Ternary_str):
+        answer += cnt * int(each_chr)
+        cnt *= 3
+
+    return answer
+
+n_1 = 45
+n_2 = 125
+
+print(solution(n_1))
+print(solution(n_2))
+
+def solution_error(n):
+    answer = 0
+
+    # 3진법 문자열 -> '1200'
+    Ternary_str = ''
+
+    quota, rest = n // 3, n % 3
+    Ternary_str += str(rest)
+
+    if n != 1:
+        # 45 -> '1200' -> '0021'
+        while quota > 3:
+            rest = quota % 3
+            quota //= 3
+            Ternary_str += str(rest)
+        Ternary_str += str(quota)
+
+    # 10진법 리스트 ... '0021' -> [0, 0, 2, 1]
+    Decimal_lst = [int(i) for i in Ternary_str]
+
+    for i in range(len(Decimal_lst)):
+        answer += Decimal_lst[i] * (3 ** (len(Decimal_lst) - i - 1))
+    return answer
+
+# print(solution_error(n_1))
 # print(solution_error(n_2))