def f(floor, num): flr = [i for i in range(1, num+1)] for i in range(floor): for j in range(1, num): flr[j] += flr[j-1] return flr[-1] t = int(input()) for _ in range(t): floor = int(input()) num = int(input()) print(f(floor, num))
import sys from collections import Counter n = int(sys.stdin.readline()) arr = [int(sys.stdin.readline()) for _ in range(n)] def mean(num): return round(sum(num)/len(num)) def median(num): num.sort() return num[len(num)//2] def mode(num): mode_dict = Counter(num) # 딕셔너리로 데이터 등장 횟수 저장 m = mode_dict.most_common() # 등장한 횟수를 내림차순으로 정리 if len(num) > 1: if m[0][1] == m[1][1]: mod = m[1][0] else: mod =..
import sys def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, int(num**0.5)+1): if num % i == 0: return False return True m, n = map(int, sys.stdin.readline().split()) s = '' for i in range(m, n+1): if prime(i): s += (str(i) + '\n') print(s)
import sys k, n = map(int, sys.stdin.readline().split()) lan = [int(sys.stdin.readline()) for _ in range(k)] start, end = 1, max(lan) while start = n: start = mid + 1 else: end = mid - 1 print(end)
n, k = map(int, input().split()) p = list(range(1, n+1)) ans = [] i = k-1 while len(ans) < n-1: ans.append(p.pop(i)) i = (i + k-1) % len(p) ans.append(p[0]) print('')
import sys from collections import deque n = int(sys.stdin.readline()) q = deque() for i in range(n): q.append(i + 1) while len(q) > 1: q.popleft() q.append(q.popleft()) print(q.pop())
n = int(input()) arr = list(map(int, input().split())) def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, num): if num % i == 0: return False return True cnt = 0 for a in arr: if prime(a): cnt += 1 print(cnt)
from sys import stdin, stdout n = int(stdin.readline()) arr1 = list(map(int, input().split())) arr1.sort() m = int(sys.stdin.readline()) arr2 = list(map(int, input().split())) for i in arr2: start = 0 end = n-1 target = i ans = 0 while start
import sys n = int(sys.stdin.readline()) stack = list() for i in range(n): cmd = sys.stdin.readline().split() if cmd[0] == 'push': stack.append(cmd[1]) elif cmd[0] == 'pop': if not stack: print('-1') else: print(stack.pop()) elif cmd[0] == 'size': print(len(stack)) elif cmd[0] == 'empty': if not stack: print('1') else: print('0') elif cmd[0] == 'top': if not stack: print('-1') else: print(stack[..
n = int(input()) for i in range(n): sentence = list(input()) cnt = 0 for s in sentence: if s == '(': cnt += 1 elif s == ')': cnt -= 1 if cnt 0: print('NO') elif cnt == 0: print('YES')
0. helloworld 현재 날짜와 시간은 : 1. comment test JSP 주석 테스트 2. error test / error Error 테스트 페이지 처리중 문제가 발생했습니다. 관리자에게 문의해주세요.. 빠른시일내 복구하겠습니다. 3. include test / menu / news / shopping include 지시어 테스트 [게임] [쇼핑] [뉴스] [최신 뉴스] 2013.00.00 : 자바 웹 프로그래밍 전면 개정판 출간 !!! 2013.00.00 : 스프링프레임워크 적용 확산. [쇼핑정보] 최신 인기 상품 정보 입니다. 1. 최신 스마트폰 2. 10.1인치 최신 태블릿 PC 2021.03.08 - [Class/웹서버프로그래밍] - 2021.03.08 수업 방식, Hello JSP!
n = int(input()) card = list(map(int, input().split())) m = int(input()) have = list(map(int, input().split())) dic = dict() for c in card: if c not in dic: dic[c] = 1 else: dic[c] += 1 for h in have: if h in dic: print(str(dic[h]), end = " ") else: print("0", end = " ")
n = int(input()) arr = [] for i in range(n): x, y = map(int, input().split()) arr.append([x, y]) arr.sort() for i in range(n): print(arr[i][0], arr[i][1])
r,c,w = map(int, input().split()) dp = [[0 for col in range(50)] for row in range(50)] dp[1][1] = 1 for i in range(0,31): for j in range(0,i+1): if j==1 | j==i: dp[i][j] = 1 else: dp[i][j] = dp[i-1][j-1]+dp[i-1][j] ans = 0 for i in range(w): for j in range(i+1): ans += dp[r+i][c+j] print(ans)
n, k = map(int, input().split()) s = list(map(int, input().split())) multi = [0 for i in range(n)] cnt = 0 for i in range(k): noEmpty = False for j in range(n): if multi[j] == s[i] or multi[j] == 0: noEmpty = True multi[j] = s[i] break if noEmpty: continue else: a = 0 for j in range(n): if try: if a < s[i + 1:].index(multi[j]): a = s[i + 1:].index(multi[j]) b = j except: a = -1 b = j break multi..
