전체 글(140)
-
백준 [ALGORITHM] - 수들의 합2 (2003)
N, M = map(int, input().split())A = list(map(int, input().split()))start = 0end = 0current_sum = 0count = 0while end M: current_sum -= A[start] start += 1 else: count += 1 current_sum -= A[start] start += 1print(count)
2024.12.05 -
백준 [ALGORITHM] - 2차원 배열의 합 (2167)
N, M = map(int, input().split())address = []for _ in range(N): temp_num = list(map(int, input().split())) address.append(temp_num)prefix_sum = [[0] * (M + 1) for _ in range(N + 1)]for i in range(1, N + 1): for j in range(1, M + 1): prefix_sum[i][j] = ( address[i-1][j-1] + prefix_sum[i-1][j] + prefix_sum[i][j-1] - prefix_sum[i-1][j-1] ..
2024.12.05 -
백준 [ALGORITHM] - 계산기 프로그램 (5613)
import operatordef calc_operator(operators, values): op = operators.pop() b = values.pop() a = values.pop() values.append(ops[op](a, b))ops = { '+' : operator.add, '-' : operator.sub, '*' : operator.mul, '/' : lambda x, y: x // y, }calc_data = []while True: input_data = input() if input_data == '=': try: values = [] opera..
2024.11.21 -
[Write-up] Haf.world - Who am i??
보호되어 있는 글입니다.
2024.09.09 -
[Write-up] Haf.world - The Hidden Path to the Flag
보호되어 있는 글입니다.
2024.09.09 -
백준 [ALGORITHM] - ROT13 (4446)
while True: vowel = ['a', 'i', 'y', 'e', 'o', 'u'] letters = ['b', 'k', 'x', 'z', 'n', 'h', 'd', 'c', 'w', 'g', 'p', 'v', 'j', 'q', 't', 's', 'r', 'l', 'm', 'f'] result = [] try: lst = list(input()) for i in range(len(lst)): char = lst[i] if char.lower() in vowel: if char.isupper(): temp = vowel.index(char.lower())..
2024.09.09