Programming [Python] (411) 썸네일형 리스트형 #74 백준 파이썬 [11727] 2xn 타일링 2 https://www.acmicpc.net/problem/11727 #Solution def squares(n): answer = 0 temp_n1 = 1 temp_n2 = 3 for i in range(1, n+1): if i == 1: answer += 1 elif i == 2: answer += 2 else: answer = temp_n1 * 2 + temp_n2 temp_n1 = temp_n2 temp_n2 = answer return answer answer = squares(int(input())) print(answer % 10007) #73 백준 파이썬 [9095] 1, 2, 3 더하기 https://www.acmicpc.net/problem/9095 #Solution def plus_123(n): if n == 1: return 1 if n == 2: return 2 if n == 3: return 4 else: return plus_123(n-1) + plus_123(n-2) + plus_123(n-3) test = int(input()) for num in range(test): answer = plus_123(int(input())) print(answer) #72 백준 파이썬 [4153] 직각삼각형 https://www.acmicpc.net/problem/4153 #Solution import sys for line in sys.stdin: a, b, c = map(int, line.split()) if a**2 == b**2 + c**2 or b**2 == a**2 + c**2 or c**2 == a**2 + b**2: if a == b == c == 0: break else: print("right") pass else: print("wrong") #71 백준 파이썬 [11399] ATM https://www.acmicpc.net/problem/11399 #Solution num_ppl = int(input()) waiting_time = list(map(int, input().split())) answer = 0 waiting_time.sort() for i in range(num_ppl): answer += waiting_time[i] * (num_ppl-i) print(answer) #70 백준 파이썬 [2869] 달팽이는 올라가고 싶다 https://www.acmicpc.net/problem/2869 #Solution A, B, V = map(int, input().split()) min_days = (V - A) / (A - B) if min_days == round(min_days): print(int(min_days + 1)) else: print(round(min_days+1.5)) #69 백준 파이썬 [1712] 손익분기점 https://www.acmicpc.net/problem/1712 #Solution f_cost,v_cost,price = map(int, input().split()) num_sales = 0 if v_cost < price: num_sales = f_cost // (price - v_cost) print (num_sales+1) else: print(-1) #68 백준 파이썬 [15596] 정수 N개의 합 https://www.acmicpc.net/problem/15596 #Solution def solve(num_list): result = 0 for num in num_list: result += num return result #67 백준 파이썬 [10872] 팩토리얼 https://www.acmicpc.net/problem/10872 #Solution num = int(input()) result = 1 temp = 1 while temp 이전 1 ··· 40 41 42 43 44 45 46 ··· 52 다음
