2021.01.28

Author: seono

python/plat3/1017.py

@@ -0,0 +1,53 @@
+import sys
+input = sys.stdin.readline
+
+prime_num = [True]*2000
+prime_num[0],prime_num[1]=False,False
+def getprime():
+    next_num = 2
+    while next_num<=1000:
+        if prime_num[next_num]:
+            n = next_num*2
+            while n<2000:
+                prime_num[n]=False
+                n+=next_num
+        next_num+=1
+getprime()
+N = int(input())
+arr = list(map(int,input().split()))
+
+#각 숫자끼리 연결시 소수되는 경우 네트워크
+#첫번째 숫자와 연결되는 숫자 각각 빼면서 이분탐색
+
+adj = [[] for _ in range(N)]
+for idx in range(N-1):
+    j = arr[idx]
+    for idx2 in range(idx+1,N):
+        i = arr[idx2]
+        if prime_num[i+j]:
+            adj[idx].append(idx2)
+            adj[idx2].append(idx)
+ans = []
+def dfs(idx):
+    global n
+    visited[idx]=True
+    for nx in adj[idx]:
+        if nx==n or nx==0:continue
+        if p[nx]==-1 or (not visited[p[nx]] and dfs(p[nx])):
+            p[nx]=idx
+            return True
+    return False
+
+for n in adj[0]:
+    p = [-1]*N
+    #0,n제외
+    tmp = 0
+    for i in range(1,N):
+        visited=[False]*N
+        if i==n:continue
+        if dfs(i):tmp+=1
+    if tmp==N-2:ans.append(arr[n])
+if ans:
+    print(' '.join(map(str,sorted(ans))))
+else:
+    print(-1)

python/plat3/1201.py

@@ -0,0 +1,64 @@
+import sys
+input = sys.stdin.readline
+
+
+def sol():
+    N, M, K = map(int,input().split())
+    if N-M+1<K:
+        return [-1]
+    else:
+        if M>=K:
+            arr = [n for n in range(N-M+1,N+1)]
+            #남은수 N-M
+            N-=M
+            #증가수열 K-1개 더만들기
+            K-=1
+            if K==0:
+                if N==0:
+                    return arr
+                else:
+                    return [-1]
+            num = N//K
+            if num>M:
+                return [-1]
+            #길이는 num(남은 수 N / K)
+            while N:
+                tmp = []
+                for _ in range(num):
+                    tmp.append(N)
+                    N-=1
+                K-=1
+                if K==0:
+                    while N:
+                        tmp.append(N)
+                        N-=1
+                arr.extend(tmp[::-1])
+                tmp = []
+            return arr
+        else:
+            arr = [n for n in range(K,0,-1)]
+            M-=1
+            #감소수열 M개 더만들기
+            if M==0:
+                if N==K:
+                    return arr
+                else:
+                    return [-1]
+            num = (N-K)//M
+            if num>K:
+                return [-1]
+            i = K+1
+            while i<=N:
+                tmp = []
+                for _ in range(num):
+                    tmp.append(i)
+                    i+=1
+                M-=1
+                if M==0:
+                    while i<=N:
+                        tmp.append(i)
+                        i+=1
+                arr.extend(tmp[::-1])
+                tmp = []
+            return arr
+print(' '.join(map(str, sol())))

python/plat3/2873.py

@@ -0,0 +1,97 @@
+import sys
+input = sys.stdin.readline
+
+N, M = map(int,input().split())
+arr = [list(map(int,input().split())) for _ in range(N)]
+ans = ""
+def findminyx():
+    m_list = []
+    for y,t in enumerate(arr,1):
+        for x,num in enumerate(t,1):
+            m_list.append([num,y,x])
+    for _,y,x in sorted(m_list):
+        if (y%2)^(x%2):
+            return y,x
+if N%2:
+    for i in range(N-1):
+        if i%2==0:
+            ans+='R'*(M-1)
+        else:
+            ans+='L'*(M-1)
+        ans+="D"
+    ans+='R'*(M-1)
+elif M%2:
+    for i in range(M-1):
+        if i%2==0:
+            ans+='D'*(N-1)
+        else:
+            ans+='U'*(N-1)
+        ans+="R"
+    ans+="D"*(N-1)
+else:
+    y,x = findminyx()
+    if y%2==0:
+        #1~x-1까지
+        for i in range(x-1):
+            if i%2==0:
+                ans+='D'*(N-1)+'R'
+            else:
+                ans+='U'*(N-1)+'R'
+        #현재 1,x
+        #1~y-1까지
+        for i in range(y-2):
+            if i%2==0:
+                ans+='R'*(M-x)+'D'
+            else:
+                ans+='L'*(M-x)+'D'
+        if y==N:
+            for i in range(M-x):
+                if i%2==0:ans+='RD'
+                else:ans+='RU'
+        else:
+            ans+='R'*(M-x)+'D'+'L'*(M-x-1)+'D'
+            for i in range(N-y-1):
+                if i%2==0:ans+="LD"
+                else:ans+="RD"
+            ans+='R'
+            for i in range(M-x-1):
+                if i%2==0:ans+='R'+'U'*(N-y-1)
+                else:ans+='R'+'D'*(N-y-1)
+    #x가 짝
+    else:
+        #print('hi')
+        for i in range(y-1):
+            if i%2==0:ans+='R'*(M-1)+'D'
+            else:ans+='L'*(M-1)+'D'
+        for i in range(x-2):
+            if i%2==0:ans+='D'*(N-y)+'R'
+            else:ans+='U'*(N-y)+'R'
+        if x==M:
+            for i in range(N-y):
+                if i%2==0:ans+='DR'
+                else:ans+='DL'
+        else:
+            ans+='D'*(N-y)+'R'+'U'*(N-y-1)+'R'
+            for i in range(M-x-1):
+                if i%2==0:ans+='UR'
+                else:ans+='DR'
+            ans+='D'
+            for i in range(N-y-1):
+                if i%2==0:ans+='D'+'L'*(M-x-1)
+                else:ans+='D'+'R'*(M-x-1)
+print(ans)
+
+# def check(s):
+#     y,x=0,0
+#     visited = [[0]*M for _ in range(N)]
+#     visited[0][0]=1
+#     res = arr[y][x]
+#     for c in s:
+#         if c=='R':x+=1
+#         elif c=='L':x-=1
+#         elif c=='U':y-=1
+#         else:y+=1
+#         res+=arr[y][x]
+#         visited[y][x]=1
+#     print('\n'.join(map(str,visited)))
+# check(ans)