source Code/BAEKJOON

BAE/<JOON> | 1차원 배열

1. [avg_program_1546.py] tc = int(input()) score = list(map(int,input().split())) score.sort() max_score = score[-1] sum = 0 for s in score : s = s/max_score*100 sum = sum + s print(sum / tc) 2. [max_arr_2562.py] num_list = [] for i in range(9): num = int(input()) num_list.append(num) small = 0 for n in num_list: if small < n: small = n print(small) print(num_list.index(small) + 1) 3. [OX_sum_89..

BAE/<JOON> | 반복문

1. [case_sum_11021.py] tc = int(input()) sum = 0 for case in range(1, tc+1) : a, b = map(int, input().split()) sum = a+b print(f'Case #{case}: {sum}') print('Case #%d: %d' %(case,sum)) 2. [list_10871.py] : tc가 주어지면 tc만큼 list를 입력 해야되는데 적든/많든 상관없이 실행됨 (인터넷도 동일하게 설명되어 있음) tc, num = map(int,input().split()) list_num = list(map(int,input().split())) # list_num = [] small_num = [] # for case in range ..

BAE/<JOON> | 조건문

1. [alarm_2844] # 2884 hour, minute = map(int, input().split()) alarm_h = 0 alarm_m = 0 if hour == 0 : if minute >= 45: alarm_m = minute - 45 print(hour, alarm_m) else: alarm_m = 60 - (45-minute) alarm_h = 23 print(alarm_h, alarm_m) else: if minute >= 45: alarm_m = minute - 45 print(hour, alarm_m) else: alarm_m = 60 - (45-minute) alarm_h = hour - 1 print(alarm_h, alarm_m) 2. [oven_alarm_2525] # ..

BAE/<JOON> | 입력과 사칙연산

1. [특수기호 출력] print("\'") print('\"') print('\\') 2. [사칙연산] 무조건 int형 선언 a,b = map(int, input().split()) print(a+b) 3. [킹, 퀸, 룩, 비숍, 나이트, 폰] a=[1,1,2,2,2,8] b = list(map(int,input().split())) for i in range(6) : print(a[i]-b[i], end=' ') 4. [곱하기 과정 출력] A = int(input()) B = input() print(A * int(B[2])) print(A * int(B[1])) print(A * int(B[0])) print(A * int(B))