Beakjoon&프로그래머스2911 [백준/파이썬] 31533번 Furiosa AI 영상 처리 가속 -Codea = int(input())n, m = map(int, input().split())if n > m: n, m = m, nn /= aprint(n * 2 if n * 2 2025. 7. 5. [백준/파이썬] 23899번 알고리즘 수업 - 선택 정렬 5 -Codedef selection_sort(arr, arr2): arr_len = len(arr) if arr == arr2: return 1 for i in range(arr_len - 1, 0, -1): max_idx = i for j in range(i): if arr[j] > arr[max_idx]: max_idx = j arr[i], arr[max_idx] = arr[max_idx], arr[i] if arr == arr2: return 1 return 0n = int(input())nums1 = list(map(int, input().split(.. 2025. 7. 4. [백준/파이썬] 23367번 Dickensian Dictionary -Codeleft = "qwertasdfgzxcvb"right = "yuiophjklnm"line = input()flag = True if line[0] in left else Falsefor i in range(1, len(line)): if (flag and line[i] not in right) or (not flag and line[i] not in left): print("no") exit() flag = not flagprint("yes") 2025. 7. 3. [백준/파이썬] 17011번 Cold Compress -Codefor _ in range(int(input())): line = input() res = "" now = line[0] cnt = 1 for el in line[1:]: if el != now: res += str(cnt) + " " + now + " " now = el cnt = 1 continue cnt += 1 res += str(cnt) + " " + now print(res) 2025. 7. 2. [백준/파이썬] 8794번 Poniedziałki -Codefrom math import ceilfor _ in range(int(input())): n, m, l = map(int, input().split()) # 월요일이 아닌경우 월요일로 만들기 if l > 1: n -= m - l + 1 # 소수점 올림 print(ceil(n / m)) 2025. 7. 1. [백준/파이썬] 30236번 증가 수열 -Codefor _ in range(int(input())): n = int(input()) temp = [i for i in range(1, n + 1)] li = list(map(int, input().split())) for i in range(n): if temp[i] == li[i]: temp[i] += 1 for j in range(i + 1, n): if temp[j - 1] >= temp[j]: temp[j] += (temp[j - 1] - temp[j]) + 1 print(temp[-1]) 2025. 6. 30. 이전 1 2 3 4 ··· 486 다음
