Binary Journey

출처: 프로그래머스 코딩 테스트 연습, https://programmers.co.kr/learn/challenges import heapq def solution(jobs): answer = 0 end = 0 index = 0 start = -1 hq = [] while len(jobs) > index: for job in jobs: if start < job[0]

출처: https://swexpertacademy.com/ T = int(input()) for i in range(T, -1, -1): print(i, end = ' ')

출처: https://swexpertacademy.com/ T = int(input()) for i in range(T + 1): print(2 ** i, end=' ')

출처: https://swexpertacademy.com/ A, B = map(int, input().split()) if A - B == -2 or A - B == 1: print("A") else: print("B")

출처: https://swexpertacademy.com/ SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com T = int(input()) for i in range(1, T + 1): if T % i == 0: print(i, end=' ')

출처: https://swexpertacademy.com/ a, b = map(int, input().split()) print(a + b) print(a - b) print(a * b) print(a // b)

출처: https://swexpertacademy.com/ T = int(input()) print(T * (T+1) // 2)

출처: https://swexpertacademy.com/main/solvingProblem/ for i in range(5): result = '' for j in range(5): if i == j: result += '#' else: result += '+' print(result)

출처: https://swexpertacademy.com/ T = int(input()) print("#" * T)

출처: https://swexpertacademy.com/ p, k = map(int, input().split()) if p < k: print(p - k + 1000) else: print(p - k + 1)