노트

n = int(input()) lst = list(map(int,input().split())) cnt = 0 while len(lst) > 0: temp = set(sorted(lst)) for t in temp: del lst[lst.index(t)] cnt += 1 print(cnt)

보호되어 있는 글입니다.

n, a, b = map(int,input().split()) hakgi = [list(map(int,input().split())) for _ in range(10)] if b >= 130 and a >= 66: print("Nice") else: for i in range(8-n): a += hakgi[i][0] * 3 b += hakgi[i][0] * 3 score = 6 - hakgi[i][0] if score = 130 and a >= 66: print("Nice") else: print("Nae ga wae")

n = int(input()) parent = [int(input()) for _ in range(n)] high = [0 for i in range(n)] for i in range(n): if parent[i]==-1: continue high[i]=high[parent[i]-1]+1 for i in range(n): print(high[i])

n = int(input()) s = [list(map(int,input().split())) for _ in range(n)] dp = [0 for i in range(n+1)] for i in range(n): for j in range(i+s[i][0],n+1): if dp[j]

import sys from collections import deque def bfs(v): queue = deque([v]) visited[v] = 1 while queue: target = queue.popleft() for i in graph[target]: if not visited[i]: visited[i] = visited[target] + 1 queue.append(i) n, m = map(int, sys.stdin.readline().split()) graph = [[] for _ in range(n + 1)] for i in range(m): a, b = map(int, sys.stdin.readline().split()) graph[a].append(b) graph[b].append(..

import math T = int(input()) for _ in range(T): n, m = map(int, input().split()) bridge = math.factorial(m) // (math.factorial(n) * math.factorial(m - n)) print(bridge)

import sys sys.setrecursionlimit(10**6) input = sys.stdin.readline # dfs 함수 def dfs(graph, v, visited): visited[v] = True for i in graph[v]: if not visited[i]: dfs(graph, i, visited) n, m = map(int, input().split()) graph = [[] for _ in range(n+1)] for i in range(m): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u) count = 0 visited = [False] * (n+1) for i in range(1, n+1):..