여행과 독서와 프로그래밍

def solution(n, lost, reserve): can = [] erase = [] answer = n - len(lost) lost = sorted(lost) reserve = sorted(reserve) for i in lost: if i in reserve: erase.append(i) answer += 1 for i in erase: lost.remove(i) reserve.remove(i) for i in reserve: can.append([i - 1, i + 1]) for i in lost: index = 0 for j in can: if (i in j): del can[0:index + 1] answer += 1 break index += 1 return answer 뭔가 많이 비..

알고리즘 공부 2021. 3. 16. 14:02

import sys global compressesion compressesion = [] n = int(sys.stdin.readline()) user_input = [] for i in range(n): user_input.append(sys.stdin.readline().split()) def compression_possible(data): zero = [] one = [] zero_sample = ['0'*(len(data))] one_sample = ['1'*(len(data))] for i in range(len(data)): zero.append(zero_sample) one.append(one_sample) if zero == data : return 1 elif one == data :..

알고리즘 공부 2020. 11. 3. 22:05

while True: list_char = input().rstrip() stack = [] new = [] answer = True if list_char == '.': break for word in list_char: new.extend(word) for i in new: if i == '(' or i == '[': stack.append(i) elif i == ']': if not stack or stack[-1] != '[': answer = False print('no') break stack.pop() elif i == ')': if not stack or stack[-1] != '(': answer = False print('no') break stack.pop() if answer and..

알고리즘 공부 2020. 10. 22. 10:39

a = list(map(int,input().split())) solution = [] re_solution = 0 for i in range(a[0]): solution.append(int(input())) for i in range(len(solution)): shage = (a[1] // solution[a[0] - 1 - i]) a[1] -= (shage * solution[a[0] - 1 - i]) re_solution += shage if a[1]

카테고리 없음 2020. 9. 23. 15:16

def func(user_input): a = [1,1,1,2,2] for i in range(user_input): if(len(a)-1 < i): a.append(a[i-1] + a[i- 5]) print(a[i]) user_input = int(input()) for i in range(user_input): func(int(input()))

카테고리 없음 2020. 9. 14. 16:24

a = int(input()) solution = [] for i in range(a): n = int(input()) if n == 0: solution.append([1,0]) elif n == 1: solution.append([0,1]) elif n == 2: solution.append([1,1]) elif n > 2: zero = 1 zero_tempt = 1 pre_zoro_tempt = 0 for _ in range(n-1): p_zero = zero zero = zero_tempt + pre_zoro_tempt zero_tempt = zero pre_zoro_tempt = p_zero solution.append([p_zero,zero]) for i in range(a): print(so..

알고리즘 공부 2020. 9. 10. 10:44

def fibo(n): if n = 1: i = 1 num = 1 temp = 0 while num

알고리즘 공부 2020. 7. 24. 17:42