[Add] solved_Algo

CJW/1021.py

@@ -0,0 +1,51 @@
+from collections import deque
+import sys
+
+dq = deque()
+N,M = map(int,sys.stdin.readline().split())
+dq.extend([i for i in range(1,N+1)])
+
+target_list = list(map(int,input().split()))
+
+cnt=0
+while target_list:
+    right_cnt=0
+    left_cnt=0
+
+    while target_list[0] != dq[0]:
+        dq.rotate(1)
+        right_cnt+=1
+    dq.rotate(-right_cnt)
+
+    while target_list[0] != dq[0]:
+        dq.rotate(-1)
+        left_cnt+=1
+
+    if right_cnt < left_cnt:
+        dq.rotate(left_cnt+right_cnt)
+    cnt+=min(right_cnt, left_cnt)
+    dq.remove(target_list[0])
+    target_list.pop(0)
+
+print(cnt)
+
+
+'''
+1) 리스트 내포
+#1  a,b,c,d = [int(x) for x in input().split()]
+#2  a,b,c,d = map(int,input().split())
+#3  a,b,c,d = [int(x) for x in stdin.readline().rstrip().split()]
+stdout.write(str(a*b*c*d))
+'''
+
+'''
+2) List가 empty인지 확인
+list1 = []
+list2 = [1,2,3]
+
+if not list1:
+    print("list1 is empty")  #list1 is empty
+if list2:
+    print("list2 is not empty") #list2 is not empty
+
+'''

CJW/1085.py

@@ -0,0 +1,9 @@
+x,y,w,h = map(int, input().split())
+
+w-=x
+h-=y
+if(w>=x):
+    w=x
+if(h>=y):
+    h=y
+print(min(w,h))

CJW/1181.py

@@ -0,0 +1,8 @@
+import sys
+
+n=int(sys.stdin.readline())
+my_list = [sys.stdin.readline().strip() for i in range(n)]
+
+my_list.sort()
+my_list.sort(key=lambda i:len(i))
+print(my_list)

CJW/14244.py

@@ -0,0 +1,12 @@
+n,m = map(int,input().split())
+
+if m == 2:
+    for i in range(n - 1):
+        print(i, i + 1)
+
+else: 
+    print("0 1")
+    for i in range(2, m + 1):
+        print(1, i)
+    for j in range(m, n - 1):
+        print(j, j + 1)

CJW/2346.py

@@ -0,0 +1,18 @@
+from collections import deque
+import sys
+
+N = int(sys.stdin.readline())
+dq = deque(map(int, input().split()))
+ballon_list = []
+
+dq_game = dq.copy()
+while dq_game:
+    target = dq_game[0]
+    print(target)
+    dq_game.rotate(-target)
+    ballon_list.append((dq_game.index(target))+1)
+    dq_game.remove(target)    
+    print(dq_game)
+
+print(*ballon_list)
+

CJW/9372.py

@@ -0,0 +1,39 @@
+from collections import deque
+
+t = int(input())
+
+def bfs(start, cnt_plane):
+    dq= deque()
+    dq.append(start)
+    visited[start] = True
+
+    while dq:
+        if visited.count(True) == n :
+            return cnt_plane
+
+        current_node = dq.popleft()
+
+        for node in graph[current_node]:
+            if visited[node]==False :
+                dq.append(node)
+                visited[node] = True
+                cnt_plane +=1
+
+
+
+for i in range(t):
+    #국가의 수n 비행기의 종류 m
+    n, m = map(int,input().split())
+    visited = [False]*(n+1)
+
+    graph = [[] for i in range(n+1)]
+
+    for j in range(m):
+        x,y = map(int,input().split())
+        graph[x].append(y)
+        graph[y].append(x)
+
+    print(bfs(1,0))
+
+
+