'오답'

Author: seongdong2

.vscode/launch.json

@@ -1,15 +1,15 @@
-{
-    // Use IntelliSense to learn about possible attributes.
-    // Hover to view descriptions of existing attributes.
-    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
-    "version": "0.2.0",
-    "configurations": [
-        {
-            "name": "Python: Current File",
-            "type": "python",
-            "request": "launch",
-            "program": "${file}",
-            "console": "integratedTerminal"
-        }
-    ]
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "Python: Current File",
+            "type": "python",
+            "request": "launch",
+            "program": "${file}",
+            "console": "integratedTerminal"
+        }
+    ]
 }

package.json

@@ -1,20 +1,20 @@
-{
-  "name": "dong",
-  "version": "1.0.0",
-  "description": "my node package",
-  "main": "index.js",
-  "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1",
-    "git": "bash ./git.sh"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/seongdong2/codeingtest.git"
-  },
-  "author": "dong",
-  "license": "ISC",
-  "bugs": {
-    "url": "https://github.com/seongdong2/codeingtest/issues"
-  },
-  "homepage": "https://github.com/seongdong2/codeingtest#readme"
-}
+{
+  "name": "dong",
+  "version": "1.0.0",
+  "description": "my node package",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1",
+    "git": "bash ./git.sh"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/seongdong2/codeingtest.git"
+  },
+  "author": "dong",
+  "license": "ISC",
+  "bugs": {
+    "url": "https://github.com/seongdong2/codeingtest/issues"
+  },
+  "homepage": "https://github.com/seongdong2/codeingtest#readme"
+}

그리디 문제/곱하기 혹은 더하기.py

@@ -1,16 +1,14 @@
-s = list(map(int, input()))
-rst = 0
-
-for i in range(len(s)) :
-    if s[i] == 0 or rst == 0:
-        rst += s[i]
-    else :
-        rst *= s[i]
-
-print(rst)
-
-#112 > 
-#11112 
-#1222222
-#2222
-#
+s = list(map(int, input()))
+rst = 0
+
+for i in range(len(s)) :
+    if s[i] == 0 or rst == 0:
+        rst += s[i]
+    else :
+        rst *= s[i]
+
+print(rst)
+
+#아이디어 : 최대한 곱해줘야 크다
+#0일 때 와 앞선 결과가 0일 때, 더하기를 해주고
+#나머지는 곱하기를 해준다

그리디 문제/모험가 길드.py

@@ -1,15 +1,15 @@
-n = int(input())
-array = list(map(int, input().split()))
-array.sort()
-
-
-count = result = 0
-for i in array :
-    result +=1
-    if result == i :
-        count += 1
-        result = 0
-
-    
-
+n = int(input())
+array = list(map(int, input().split()))
+array.sort()
+
+
+count = result = 0
+for i in array :
+    result +=1
+    if result == i :
+        count += 1
+        result = 0
+
+    
+
 print(count)

그리디 문제/문자열뒤집기.py

@@ -0,0 +1,25 @@
+# 전부 0으로 바꾸는 경우와 전부 1로 바꾸는 경우 중에 더 적은 횟수를 가진 경우를 계산한다.
+
+s = list(map(int, input()))
+cnt = 0
+rst1 = 0
+rst2 = 0
+
+for i in range(len(s)) :
+    if s[i] and s[i-1] == 1 : 
+        rst1 += 1
+    elif s[i] and s[i-1] == 0:
+        rst2 += 1
+    else :
+        continue
+        
+for i in range(len(s)) :
+        if s[i-1] :
+            if s[i] != s[i-1] :
+                cnt += 1
+
+
+if rst1 > rst2 :
+    print(cnt)
+else :
+    print(cnt)

연습 예제 모음/117.py

@@ -1,2 +1,2 @@
-c = ord('c')
+c = ord('c')
 print(chr(c+1))

연습 예제 모음/118.py

@@ -1,27 +1,27 @@
-N, M = map(int, input().split())
-d = [[0]*M for i in range(N)]
-
-
-A, B, d = map(int, input().split())
-d[A][B] = 1
-
-array = []
-for i in range(N) :
-    array.append(list(map(int, input().split())))
-
-#북 동 남 서 
-dx = [-1, 0, 1, 0]
-dy = [0, 1, 0, -1]
-
-def t() :
-    global dir
-    dir -= 1
-    if dir == -1 :
-        dir ==3
-
-count = 1 
-
-
-
-    
-
+N, M = map(int, input().split())
+d = [[0]*M for i in range(N)]
+
+
+A, B, d = map(int, input().split())
+d[A][B] = 1
+
+array = []
+for i in range(N) :
+    array.append(list(map(int, input().split())))
+
+#북 동 남 서 
+dx = [-1, 0, 1, 0]
+dy = [0, 1, 0, -1]
+
+def t() :
+    global dir
+    dir -= 1
+    if dir == -1 :
+        dir ==3
+
+count = 1 
+
+
+
+    
+

연습 예제 모음/159.py

@@ -1,13 +1,13 @@
-array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
-array.sort()
-print(array)
-
-for i in range(len(array)) :
-    n = i
-    for j in range(i+1, len(array)):
-        if array[n] > array[j] :
-            n = j
-
-    array[i], array[n] = array[n], array[i]
-
+array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
+array.sort()
+print(array)
+
+for i in range(len(array)) :
+    n = i
+    for j in range(i+1, len(array)):
+        if array[n] > array[j] :
+            n = j
+
+    array[i], array[n] = array[n], array[i]
+
 print(array)        

연습 예제 모음/163.py

@@ -1,10 +1,10 @@
-array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
-
-for i in range(1, len(array)) :
-    for j in range(i, 0, -1) :
-        if array[j] > array[j-1] :
-            array[j] , array[j-1] = array[j-1] , array[j]
-
-
-        else :
+array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
+
+for i in range(1, len(array)) :
+    for j in range(i, 0, -1) :
+        if array[j] > array[j-1] :
+            array[j] , array[j-1] = array[j-1] , array[j]
+
+
+        else :
             break 

연습 예제 모음/168.py

@@ -1,23 +1,23 @@
-array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
-
-def quick(array, start, end):
-    if start >= end :
-        return
-    p = start
-    left = start+1
-    right = end
-    while left <= right :
-        while left <= end and array[left] <= array[p] :
-            left += 1
-        while right >= start and array[right] >= array[start]:
-            right -= 1
-        if left > right :
-            array[right], array[p] = array[right], array[p]
-    else :
-        array[left], array[right] = array[right], array[left]
-
-    quick(array, start, right-1)
-    quick(array, right+1 , end)
-
-quick(array, 0, len(array)-1 )
-print(array)
+array = [7, 5, 9, 0, 4, 1, 6, 2, 4, 8]
+
+def quick(array, start, end):
+    if start >= end :
+        return
+    p = start
+    left = start+1
+    right = end
+    while left <= right :
+        while left <= end and array[left] <= array[p] :
+            left += 1
+        while right >= start and array[right] >= array[start]:
+            right -= 1
+        if left > right :
+            array[right], array[p] = array[right], array[p]
+    else :
+        array[left], array[right] = array[right], array[left]
+
+    quick(array, start, right-1)
+    quick(array, right+1 , end)
+
+quick(array, 0, len(array)-1 )
+print(array)