알고리즘254 백준-10818번(최소,최대)-python 백준-10818번(최소,최대)-python i=int(input()) arr=[] arr[0:i]=map(int,input().split()) arr.sort() print(arr[0],arr[i-1]) 2023. 11. 23. 백준-2577번(숫자의 개수)-python 백준-2577번(숫자의 개수)-python a=int(input()) b=int(input()) c=int(input()) d=a*b*c e=str(d) li=[0,0,0,0,0,0,0,0,0,0] for x in e: for y in range(10): if int(x)==y: li[y]+=1 continue for _ in li: print(_) 2023. 11. 23. 백준-2562번(최댓값)-python 백준-2562번(최댓값)-python arr=[] for x in range(9): arr.append(int(input())) raa=sorted(arr) print(raa[8]) print(arr.index(raa[8])+1) 2023. 11. 23. 백준-2439번(별찍기-2)-python 백준-2439번(별찍기-2)-python i=int(input()) for x in range(1,i+1): a="*"*x print(a.rjust(i)) 2023. 11. 23. 백준-2438번(별찍기-1)-python 백준-2438번(별찍기-1)-python i=int(input()) for x in range(1,i+1): print("*"*x) 2023. 11. 23. 백준-1110번(더하기사이클)-python 백준-1110번(더하기사이클)-python def hap(x,y): return x+y i=int(input()) c = [[0 for j in range(2)] for i in range(i)] d=[] for a,b in c: a,b=map(int,input().split()) d.append(hap(a,b)) for i in d: print(i) 2023. 11. 23. 이전 1 ··· 38 39 40 41 42 43 다음