Binary Journey

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

출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): a, b = map(int, input().split()) div, mod = divmod(a, b) print(f'#{test_case} {div} {mod}')

출처: https://swexpertacademy.com/ print(input().upper())

출처: https://swexpertacademy.com/ input 값을 받는 거였네..? T = input() alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" for t in T: print(alphabet.find(t) + 1, end = ' ')

출처: https://swexpertacademy.com/ 날짜 검증 day = [-99, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] T = int(input()) for test_case in range(1, T + 1): YYYYMMDD = input() YYYY = YYYYMMDD[:4] MM = YYYYMMDD[4:6] DD = YYYYMMDD[6:] mm = int(MM) dd = int(DD) if (mm == 0 or mm > 12) or (dd == 0 or dd > day[mm]): print(f'#{test_case} -1') else: print(f'#{test_case} {YYYY}/{MM}/{DD}')

출처: https://swexpertacademy.com/ T = int(input()) answer = 0 while T > 0: div, mod = divmod(T, 10) answer += mod T = div print(answer)

출처: https://swexpertacademy.com/ SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com T = int(input()) numbers = list(map(int, input().split())) numbers.sort() print(numbers[T//2])

출처: https://swexpertacademy.com/ SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com T = int(input()) for test_case in range(1, T + 1): numbers = list(map(int, input().split())) print(f'#{test_case} {max(numbers)}')

출처: https://swexpertacademy.com/ 입력된 두 수를 비교하여 부등호로 나타내기 T = int(input()) for test_case in range(1, T + 1): a, b = input().split() c = int(a) - int(b) result = '=' if c == 0 else '>' if c > 0 else '

출처: https://swexpertacademy.com/ T = int(input()) for take in range(1, T + 1): _sum = 0 numbers = list(map(int, input().split())) for number in numbers: if number % 2: _sum += number print(f'#{take} {_sum}')