분류 전체보기 (49) 썸네일형 리스트형 [백준 5218 ] 알파벳 거리 import sys n=int(sys.stdin.readline().rstrip()) for _ in range(n): a,b=sys.stdin.readline().rstrip().split() print("Distances: ", end="") for i in range(len(a)): k=ord(b[i])-ord(a[i]) if k [백준 9935] 문자열 폭발 import sys s=sys.stdin.readline().rstrip() bomb=sys.stdin.readline().rstrip() stack=[] for i in s: stack.append(i) if i==bomb[-1] : temp="" for j in stack[len(bomb)*(-1):]: temp+=j if temp==bomb: del stack[len(bomb)*(-1):] if len(stack)==0: print("FRULA") else: print(*stack, sep="") [백준 1181] 단어 정렬 import sys n=int(sys.stdin.readline().rstrip()) a=[] for _ in range(n): l=sys.stdin.readline().rstrip() a.append((len(l),l)) a=list(set(a)) a=sorted(a, key = lambda x : (x[0],x[1])) for i in a: print(i[1]) [백준 11651] 좌표 정렬하기 2 n=int(input()) lst=[tuple(map(int, input().split())) for _ in range(n)] lst=sorted(lst, key = lambda x : (x[1], x[0])) for i in range(n): print(lst[i][0], lst[i][1]) [백준 2108] 통계학 def Most(b): N=[0]*8001 for i in b: N[i+4000]=N[i+4000]+1 Max=max(N) c=[] for i in range(8001): if N[i]==Max: c.append(i-4000) c=sorted(c) if len(c)==1: return(c[0]) else : return(c[1]) n=int(input()) a=[int(input()) for _ in range(n)] print(round(sum(a)/len(a))) print(sorted(a)[int((n-1)/2)]) print(Most(a)) print(max(a)-min(a)) [백준 1018] 체스판 다시 칠하기 def NofRepaint(M,x,y): c=0 for i in range(8): for j in range(8): if int(M[x+i][y+j])!=(i+j)%2: c+=1 a=c c=0 for i in range(8): for j in range(8): if int(M[x+i][y+j])==(i+j)%2: c+=1 b=c return min(a,b) m,n=map(int, input().rstrip().split()) M=[] for i in range(m): M.append(input().rstrip().replace("B",'0').replace("W",'1')) Min=m*n for p in range(m-7): for q in range(n-7): temp=NofRepaint(M,p,q) .. [백준 11729] 하노이 탑 이동 순서 def Hanoi(n,a,b): c=list({1,2,3}-{a,b})[0] if n!=1 : Hanoi(n-1,a,c) print(a,b) if n!=1 : Hanoi(n-1,c,b) n=int(input()) print(2**n -1) if n [백준 8447] 별 찍기 - 10 def SierpinskiCarpet(n): a=["" for _ in range(n)] if n!=3: c=" "*int(n/3) b=SierpinskiCarpet(int(n/3)) else : b="*" c=" " k=0 for i in b: a[k]=i*3 k+=1 for i in b: a[k]=i+c+i k+=1 for i in b: a[k]=i*3 k+=1 return a n=int(input()) M=[] M=SierpinskiCarpet(n) for i in M: print(i) 이전 1 2 3 4 5 ··· 7 다음