코딩/백준 [ALGORITHM](65)
-
백준 [ALGORITHM] - 너의 평점은 (25206)
lst = []data = { 'A+': 4.5, 'A0': 4.0, 'B+': 3.5, 'B0': 3.0, 'C+': 2.5, 'C0': 2.0, 'D+': 1.5, 'D0': 1.0, 'F' : 0.0}tot_score = 0for n in range(0,20): n = input() parts = n.split() if parts[-1] == 'P': continue else: temp = float(parts[1]) tot_score += temp score = temp * data[parts[-1]] lst.append(score)average = sum(lst) ..
2024.06.04 -
백준 [ALGORITHM] - 그룹 단어 체커 (1316)
def check_func(word): flag = True checked = set() save_chars = '' for char in word: if char in checked and char != save_chars: flag = False checked.add(char) save_chars = char return flagn = int(input())cnt = 0for i in range(n): flag = check_func(input()) if flag == True: cnt += 1print(cnt)
2024.06.02 -
백준 [ALGORITHM] - 최댓값 (2566)
lst = []addr_x, addr_y = 0, 0 for i in range(9): row = input().split() row = [int(num) for num in row] lst.append(row)maximum = lst[0][0]for i in range(len(lst)): for j in range(len(lst[i])): if maximum
2024.05.23 -
백준 [ALGORITHM] - 안녕 (1535)
def dp(health, enjoy): health = list(map(int, health)) enjoy = list(map(int, enjoy)) dp = [0] * 101 for h, e in zip(health, enjoy): if h >= 100: continue for i in range(99, h - 1, -1): dp[i] = max(dp[i], dp[i - h] + e) print(max(dp))n = int(input())health = input().split()enjoy = input().split()dp(health, enjoy)
2024.05.19 -
백준 [ALGORITHM] - 사이클 단어 (1544)
def checker(lst): save_board = {} for word in lst: found = False for i in range(len(word)): rotated_word = word[i:] + word[:i] if rotated_word in save_board: found = True break if not found: save_board[word] = 0 print(len(save_board))if __name__ == '__main__': n = int(input()) lst = [input(..
2024.05.17 -
백준 [ALGORITHM] - 학생 번호 (1235)
def solver(id): k = 1 while True: find_k = set() for i in id: find_k.add(i[-k:]) if len(find_k) == len(id): return k k += 1n = int(input())id = [input() for _ in range(n)]print(solver(id))
2024.05.15