Codeup 1289 - 가장 큰 운동장 http://codeup.kr/problem.php?id=1289 Codeup 1289 - 가장 큰 운동장 largest = 0for i in range(0, 3): h, v = map(int, input().split()) if largest Codeup 1288 - nCr (Tiny) http://codeup.kr/problem.php?id=1288 Codeup 1288 - nCr (Tiny) xn, r = map(int, input().split())def factorial(n): if n == 1 or n == 0: return 1 else: return n * factorial(n-1)print(int(factorial(n) / (factorial(r) * factorial(n-r)))) Codeup 1287 - 구구단을 *로 출력하기 http://codeup.kr/problem.php?id=1287 Codeup 1287 - 구구단을 *로 출력하기 while True: n = int(input()) if 1 Codeup 1286 - 최댓값, 최솟값 http://codeup.kr/problem.php?id=1286 Codeup 1286 - 최댓값, 최솟값 numbers = []for i in range(0, 5): number = input() numbers.append(int(number))numbers.sort()print(numbers[len(numbers) - 1])print(numbers[0]) Codeup 1285 - 계산기 2 http://codeup.kr/problem.php?id=1285 Codeup 1285 - 계산기 2 expression = input()result = 0symbol = ''lastNumber = 0lsatSymbol = ''lastIndex = 0isFirst = Truefor i in range(0, len(expression)): if expression[i] in ('+', '-', '*', '/', '='): symbol = expression[i] number = int(expression[lastIndex:i]) lastIndex = i+1 if isFirst: isFirst = False result += int(number) lastNumber = number lsatSymbol =.. Codeup 1284 - 암호 해독 http://codeup.kr/problem.php?id=1284 Codeup 1284 - 암호 해독 import mathn = int(input())a = []index = 0sq = int(math.sqrt(float(n)))for i in range(0, 30): a.append(0)for i in range(2, sq+1): while n % i == 0: n /= i a[index] = i index += 1if n != 1: a[index] = n index += 1if index == 2: print(int(a[0]), int(a[1]))else: print('wrong number') Codeup 1283 - 주식 투자 http://codeup.kr/problem.php?id=1283 Codeup 1283 - 주식 투자 a = int(input())b = int(input())variabilities = list(map(int, input().split()))final_money = afor variability in variabilities: if variability Codeup 1282 - 제곱수 만들기 http://codeup.kr/problem.php?id=1282 Codeup 1282 - 제곱수 만들기 import mathn = int(input())k = 0for i in range(1, n): if math.sqrt(n - i) % 1 == 0: k = i n = int(math.sqrt(n - 1)) breakprint(k, n) 이전 1 ··· 17 18 19 20 21 22 23 ··· 36 다음