목록Python (215)
가오리의 코딩일기
from collections import deque n, m = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(int, input()))) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(x, y): queue = deque() queue.append((x, y)) while queue: x, y = queue.popleft() for i in range(4): nx = x+dx[i] ny = y+dy[i] if nx = n or ny = m: continue if graph[nx][ny] == 0: continue if graph[nx]..
n = int(input()) graph = [] house = [] for _ in range(n): graph.append(list(map(int, input()))) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def dfs(x, y): if x = n or y = n: return False if graph[x][y] == 1: global count count += 1 graph[x][y] = 0 for i in range(4): nx = x + dx[i] ny = y + dy[i] dfs(nx, ny) return True return False count = 0 result = 0 for i in range(n): for j in r..
import sys sys.setrecursionlimit(10000) # 재귀 한도 풀어주기 def dfs(start): visited[start] = True node = graph[start] if not visited[node]: dfs(node) testCase = int(sys.stdin.readline()) for _ in range(testCase): n = int(sys.stdin.readline()) graph = [0] + list(map(int, sys.stdin.readline().split())) visited = [True] + [False] * n result = 0 for i in range(1, n+1): if not visited[i]: dfs(i) result += 1..
import sys from collections import deque def bfs(start): queue = deque([start]) visited[start] = True while queue: node = queue.popleft() for i in graph[node]: if not visited[i]: queue.append(i) visited[i] = True n,m = map(int, sys.stdin.readline().split()) graph = [ [] for _ in range(n+1)] for _ in range(m): u, v = map(int, sys.stdin.readline().split()) graph[u].append(v) graph[v].append(u) vis..
💡 간단한 HTTP API를 구축하는 과정 🧩 app.py 더보기 from flask import Flask app = Flask(__name__) """ POST: 클라이언트가 보낸 데이터를 받는 데에 사용 GET: 데이터를 다시 돌려주는 데에만 사용 /shop : 새로운 shop을 생성하거나 shop 목록을 보여준다 /shop/smith-flower-shop : shop들 중, smith-flower-shop이라는 이름을 가진 것을 보여준다 /shop/smith-flower-shop/item : smith-flower-shop에 새로운 item을 생성하거나 smith-flower-shop에 있는 item들 목록을 보여준다 """ # POST /shop : name이라는 데이터를 받아서 새로운 shop..
import sys string = list(input()) stringList = [] n = int(input()) for i in range(n): command = sys.stdin.readline().split() if command[0] == "L" and string: stringList.append(string.pop()) elif command[0] == "D" and stringList: string.append(stringList.pop()) elif command[0] == "B" and string: string.pop() elif command[0] == "P": string.append(command[1]) print("".join(string + list(reversed(st..
n, k = map(int, input().split()) result = [] numberList = [i for i in range(1, n+1)] number = 0 for i in range(n): number += (k-1) if number >= len(numberList): number %= len(numberList) result.append(str(numberList[number])) numberList.pop(number) print("", sep="")
import math a, b = map(int, input().split()) print("1"*math.gcd(a, b))
import math testCase = int(input()) for i in range(testCase): numberList = list(map(int, input().split())) result = 0 for j in range(1, len(numberList)): for k in range(j+1, len(numberList)): result += math.gcd(numberList[j], numberList[k]) print(result)