Merge pull request #797 from DosImpact/master

소수찾기

Author: sangmandu

BOJ/1261.알고스팟/dosimpact.py

@@ -0,0 +1,39 @@
+import sys
+import math
+from typing import *
+import itertools
+from collections import deque
+
+
+# 알고스팟
+# N,M 빈방 - 가중치 0, 벽 1
+
+M, N = map(int, input().split())
+graph: List[List[int]] = [list(map(int, list(input()))) for _ in range(N)]
+check: List[List[int]] = [[-1 for _ in range(M)] for _ in range(N)]
+
+
+def inRange(x: int, y: int):
+    return x >= 0 and y >= 0 and x < N and y < M
+
+
+dx, dy = [0, 0, 1, -1], [1, -1, 0, 0]
+q = deque()
+q.append((0, 0))  # 0,0 으로 들어옴
+check[0][0] = 0
+
+while q:
+    x, y = q.popleft()
+    for k in range(4):
+        nx, ny = x+dx[k], y+dy[k]
+        if inRange(nx, ny) and check[nx][ny] == -1:
+            if graph[nx][ny] == 0:
+                check[nx][ny] = check[x][y]
+                q.appendleft((nx, ny))
+                continue
+            if graph[nx][ny] == 1:
+                check[nx][ny] = check[x][y] + 1
+                q.append((nx, ny))
+                continue
+
+print(check[N-1][M-1])

BOJ/4195.친구네트워크/dosimpact.py

@@ -0,0 +1,59 @@
+import sys
+
+sys.setrecursionlimit(10**6)
+input = sys.stdin.readline
+
+T = int(input())
+
+for _ in range(T):
+    F = int(input())
+    names = dict()
+    names_cnt = 0
+    # 이름 > 번호로 변경
+    parent = [i for i in range(F*2+1)]
+    childNum = [1 for i in range(F*2+1)]
+
+    def getNumber(name: str):
+        global names_cnt
+        if name in names:
+            return names[name]
+        else:
+            names[name] = names_cnt
+            names_cnt += 1
+            return names[name]
+
+    def getP(x: int):
+        if parent[x] == x:
+            return x
+        parent[x] = getP(parent[x])
+        return parent[x]
+
+    def union(x: int, y: int):
+        px, py = getP(x), getP(y)
+        if px == py:
+            return
+        if px > py:
+            parent[px] = py
+            childNum[py] += childNum[px]
+        else:
+            parent[py] = px
+            childNum[px] += childNum[py]
+
+    for _ in range(F):
+        u, v = input().strip().split()
+        un, vn = getNumber(u), getNumber(v)
+        union(un, vn)
+        pn = getP(un)
+        print(childNum[pn])
+        # print(f"childNum : {childNum} u,v ={u} {v} , un vn = {un} {vn} ")
+
+"""
+1
+6
+Fred Barney
+Betty Wilma
+Barney Betty
+Fred Barney
+Barney Betty
+Betty Wilma
+"""

programmers/난이도별/level01.소수찾기/dosimpact.py

@@ -0,0 +1,23 @@
+# 토스 체
+
+
+def solution(n: int):
+    # check -1 이면 검사 안한것
+    check = [-1 for i in range(0, n + 1)]
+    pc = 0  # prime count
+    pn = []  # prime array
+
+    # 2,3,....n
+    for i in range(2, n + 1):
+        if check[i] == -1:
+            pc += 1
+            pn.append(i)
+            # 5*5 =25 , 30, 35 ,... n
+            for j in range(i * i, n + 1, i):
+                check[j] = 1
+    # print(f"Primse is {pn}")
+    return pc
+
+
+print(solution(10))
+print(solution(5))

programmers/난이도별/level01.신규 아이디_추천/dosimpact.py

@@ -0,0 +1,53 @@
+import sys
+import math
+from typing import *
+
+sys.setrecursionlimit(10**6)
+input = sys.stdin.readline
+
+#  규칙에 맞지 않는 아이디를 입력했을 때 아이디와 유사하면서 규칙에 맞는 아이디를 추천해주는
+
+
+# 아이디의 길이는 3자 이상 15자 이하여야 합니다.
+#  알파벳 소문자, 숫자, 빼기(-), 밑줄(_), 마침표(.) 문자만 사용
+#  단, 마침표(.)는 처음과 끝에 사용할 수 없으며 또한 연속으로 사용할 수 없습
+
+
+def solution(new_id: str):
+    new_id = list(new_id)
+    new_id = list(map(lambda x: (x).lower() if (x).isupper() else x, new_id))
+    print(new_id)  # 1
+
+    def ST2(ch: str):
+        if ch.isalnum() or ch == '-' or ch == '_' or ch == '.':
+            return True
+        return False
+    new_id = list(filter(ST2, new_id))
+    print(new_id)  # 2
+
+    new_id_parsed = [new_id[0]]
+    for i in range(1, len(new_id)):
+        if new_id_parsed[-1] == '.' and new_id[i] == '.':
+            continue
+        new_id_parsed += [new_id[i]]
+    new_id = new_id_parsed
+
+    print(new_id)  # 3
+    if new_id and new_id[0] == '.':
+        new_id.pop(0)
+    if new_id and new_id[-1] == '.':
+        new_id.pop(len(new_id)-1)
+    print(new_id)  # 4
+    if len(new_id) == 0:
+        new_id += ['a']
+    if len(new_id) >= 16:
+        new_id = new_id[:15]
+        if new_id[-1] == '.':
+            new_id.pop(len(new_id)-1)
+
+    if len(new_id) == 2:
+        new_id += [new_id[-1]]
+    if len(new_id) == 1:
+        new_id += [new_id[-1]]*2
+
+    return "".join(new_id)