# n = int(input()) # aaa = [] # for i in range(n): # a = 0 # err = 0 # cnt = 0 # x = input() # for j in range(len(x) // 2): # if x[j] != x[-1-j]: # a = 1 # err = j # break # if a == 0: # print(0) # aaa.append(0) # continue # else: # y = list(x) # z = list(x) # y.pop(err) # # print(y) # z.pop(-1-err) # # print(z) # for j in range(len(x) // 2): # if y[j] != y[-1-j]: # # print('y ' + y[j], y[-1-j]) # cnt += 1 # break # for j in range(len(x) // 2): # if z[j] != z[-1-j]: # # print('z ' + z[j], z[-1-j]) # cnt += 1 # if cnt == 2: a = 2 # cnt = 0 # break # print(a) # aaa.append(a) # # for i in range(len(aaa)): # # print(aaa[i], end=' ') n = int(input()) weight = list(map(int, input().split())) sum = 0 for i in range(n): sum += weight[i] memo = [0 for _ in range(sum)] memo[-1] = 1 #???????????????? sum = 0 for i in range(n): if memo[i] == 0: sum += 1 for i in range(n): print(i, memo[i]) print(sum)

n = int(input()) check = [0 for _ in range(26)] for i in range(n): x = input() if len(x) % 2 == 0 and x[0:int(len(x)/2)] == ''.join(reversed(x[int(len(x)/2):len(x)])): # 회문인지 확인 print(0) continue elif len(x) % 2 != 0 and x[0:int(len(x)/2)] == ''.join(reversed(x[int(len(x)/2):len(x)])): # 회문인지 확인 print(0) continue else: # 유사 회문인지 확인 if len(x[1:len(x)]) % 2 == 0 and x[0:int(len(x)/2)] == ''.join(reversed(x[int(len(x)/2):len(x)])): print(1) continue elif len(x[1:len(x)]) % 2 != 0 and x[0:int(len(x)//2)+1] == ''.join(reversed(x[int(len(x)//2+2):len(x)])): print(1) continue for i in range(len(x)-1): a = x[0:i+1] + '' + x[i+2:len(x)] if len(a) # x = 'summuus' # print(x[1:len(x)]) # for i in range(len(x)-1): # print(x[0:i+1] + '' + x[i+2:len(x)])

# --> # 1 2 3 4 5 6 # 10 3 7 4 12 2 # 0 1 1 2 0 1 # <<나를 볼수 있는 소의 합>> # 스택 : 나를 볼 수 있는 소만 남겨둬 # n = int(input()) # stack = [] # sum = 0 # for i in range(n): # a = int(input()) # while True: # if len(stack) != 0 and stack[-1] <= a: # stack.pop() # else: break # sum += len(stack) # stack.append(a) # print(sum) # import sys # sum = 0 # 일주일 간 근무 시간의 합 # money = 0 # for i in range(5): # a,b = map(float, input().split()) # x = (b - a)-1 # if x <= 0: # continue # elif x <= 4: # sum += x # else: # sum += 4 # money=sum*10000 # if sum >= 15: # print("%0.0f"%(money * 0.95)) # sys.exit() # elif sum <= 5: # print("%0.0f"%(money * 1.05)) # sys.exit() # print("%0.0f"%money) n = int(input()) for i in range(n): x = input() if len(x) % 2 == 0: if list(x[0 : len(x)/2]) == list(x[len(x)/2 : -1]).reverse: pass

# n = int(input()) # arr = [0 for _ in range(n)] # for i in range(n): # arr[i] = int(input()) # sum = int(0) # for k in range(n): # for a in range(k, -1, -1): # if a <= 0 or arr[k] <= arr[a]: break # elif arr[k] > arr[a]: # for a in range(k, n): # if a >= (n - 1) or arr[k] <= arr[a]: # break # elif arr[k] > arr[a]: # sum += 1 # print(sum) # n = int(input()) # arr = [0 for _ in range(n)] # for i in range(n): # arr[i] = int(input()) # arr.reverse() # sum = 0 # max = -1 # for i in range(n): # if arr[i] > max: # max = arr[i] # sum += 1 # print(sum) # n = int(input()) # stack = [] # # arr = [] # for i in range(n): # a = int(input()) # while len(stack)!=0 and stack[-1]<=a : # stack.pop() # stack.append(a) # print(len(stack)) n = int(input())

# life_map = [list(map(int, input().split())) for _ in range(25)] # next_map = [[0 for i in range(25)] for j in range(25)] # dx = [0, 1, 1, 1, 0, -1, -1, -1] # dy = [-1, -1, 0, 1, 1, 1, 0, -1] # def plus(arr, i, j): # # for a in range(i-1, i+2): # # for b in range(j-1, j+2): # # print(arr[a][b], end = ' ') # # print() # sum = 0 # for k in range(8): # p = i + dy[k] # q = j + dx[k] # if 24 < p or p < 0 or 24 < q or q < 0: # continue # if arr[p][q] == 1: sum += 1 # return sum # for i in range(25): # for j in range(25): # data = plus(life_map, i, j) # if life_map[i][j] == 0 and data == 3: # next_map[i][j] = 1 # elif life_map[i][j] == 1 and 4 <= data <= 1: # next_map[i][j] = 0 # elif life_map[i][j] == 1 and data == 2 or data == 3: # next_map[i][j] = 1 # for i in range(25): # for j in range(25): # print(next_map[i][j], end = ' ') # print() # mx, my = map(int, input().split()) # x, y, z = map(int, input().split()) # life_map = [list(map(int, input().split())) for _ in range(my)] # bb = int(input()) # next_map = [[0 for i in range(mx)] for j in range(my)] # dx = [0, 1, 1, 1, 0, -1, -1, -1] # dy = [-1, -1, 0, 1, 1, 1, 0, -1] # def plus(arr, i, j): # # for a in range(i-1, i+2): # # for b in range(j-1, j+2): # # print(arr[a][b], end = ' ') # # print() # sum = 0 # for k in range(8): # p = i + dy[k] # q = j + dx[k] # if my < p or p < 0 or mx < q or q < 0: # continue # if arr[p][q] == 1: sum += 1 # return sum # for aa in range(bb): # for i in range(my): # for j in range(mx): # data = plus(life_map, i, j) # if life_map[i][j] == 0 and data == x: # next_map[i][j] = 1 # elif life_map[i][j] == 1 and data >= y: # next_map[i][j] = 0 # elif life_map[i][j] == 1 and data == z: # next_map[i][j] = 1 # for cc in range(my): # for dd in range(mx): # life_map[cc][dd] = next_map[cc][dd] # next_map[cc][dd] = 0 # for i in range(my): # for j in range(mx): # print(next_map[i][j], end = ' ') # print() # list = [] # list.append() # list.pop() # len(list)

# def f(): # print(3.1415926535897) # f() # def f(): # print('*') # f() # def f(): # print('**') # f() # a = int(input()) # def f(a): # if a == 0: print('zero') # else: print('non zero') # f(a) # argument 매개변수 들 # def f(a,b,c): # # print('3.140000') # return a # f() # 자유==편리 (x) # 내가 다 알고있어야 자유를 누릴수있어 # 에버랜드 자유이용권 ( t익스->사파리예약->어디밥먹고->예약걸어놓거->락스핀타고) # n = int(input()) # minority = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997] # for i in range(n): # if minority[i] > n: # print('composite') # break # if minority[i] == n: # print('prime') # break # a = input() # a = reversed(a) # print(''.join(a)) # n = int(input()) # arr = list(map(int, input().split())) # tar = int(input()) # if arr[n - 1] < tar: # print(n + 1) # exit() # def lower_bound(n, arr, tar): # for i in range(n): # if arr[i] == tar or arr[i] > tar: # return i + 1 # print(lower_bound(n, arr, tar)) # n = int(input()) # arr = list(map(int, input().split())) # tar = int(input()) # def f(n, arr, tar): # for i in range(n): # if arr[i] == tar: # return i + 1 # return -1 # print(f(n, arr, tar)) life_map = [list(map(int, input().split())) for i in range(25)] next_map = [[int(0) for i in range(25)] for j in range(25)] dx = [0, 1, 1, 1, 0, -1, -1, -1] dy = [-1, -1, 0, 1, 1, 1, 0, -1] def plus(i, j): sum = 0 for i in range(i - 1, i + 2): for j in range(j - 1, j + 2): if 0 <= i <= 24 and 0 <= j <= 24: sum += life_map[i][j] return sum - life_map[i][j] print(plus(23, 23)) # for i in range(25): # for j in range(25): # a = plus(i, j) # if life_map[i][j] == 0: # if a == 3: # next_map[i][j] = 1 # elif life_map[i][j] == 1: # if a >= 4 or a <= 1: # next_map[i][j] = 0 # elif a == 2 or a == 3: # next_map[i][j] = 1 # print() # for i in range(25): # for j in range(25): # print(next_map[i][j], end = ' ') # print()

# list = [list(map(int, input().split())) for _ in range(10)] # arr = [list(map(int, input().split())) for _ in range(10)] # i = int(1) # j = int(1) # arr[1][1] = 9 # while True: # if arr[i][j + 1] == 0 or arr[i][j + 1] == 2: # j += 1 # if arr[i][j] == 2: # arr[i][j] = 9 # break # arr[i][j] = 9 # elif arr[i + 1][j] == 0 or arr[i + 1][j] == 2: # i += 1 # if arr[i][j] == 2: # arr[i][j] = 9 # break # arr[i][j] = 9 # else: break # for i in range(10): # for j in range(10): # print(arr[i][j], end=' ') # print('') n, m, num = map(int, input().split()) arr = [[int(0) for j in range(m)] for i in range(n)] arr1 = [[int(0) for j in range(m)] for i in range(n)] for i in range(num): x1, y1, x2, y2, a = map(int, input().split()) arr[y1][x1] += a arr[x2+1][y2+1] += a arr[x1][y2+1] -= a arr[x2+1][y1] -= a for i in range(n): for j in range(m): print(arr[i][j], end = ' ') print() print() sum = int(0) for i in range(n): for j in range(m): if arr[i][j] != 0 or arr[i][j] == 0: for i1 in range(i + 1): for j1 in range(j + 1): sum += arr[i1][j1] arr1[i][j] = sum sum = 0 # for i in range(n): # for j in range(m): # print(arr[i][j]) # for i1 in range(i + 1): # for j1 in range(j + 1): # sum += arr[i1][j1] # arr1[i][j] = sum # sum = 0 for i in range(n): for j in range(m): print(arr1[i][j], end = ' ') print()

# list = [list(map(int, input().split())) for _ in range(19)] # n = int(input()) # for k in range(1, n + 1): # a,b = map(int, input().split()) # a가 세로, b가 세로 # for i in range(0, 19): # if list[i][b - 1] == 0: list[i][b - 1] = 1 # else: list[i][b - 1] = 0 # if list[a - 1][i] == 0: list[a - 1][i] = 1 # else: list[a - 1][i] = 0 # for i in range(0, 19): # for j in range(0, 19): # print(list[i][j], end=' ') # print('') # list = [[0 for i in range(10)] for j in range(10)] # list[2][3] = 1 # for i in range(0, 10): # for j in range(0, 10): # print(list[i][j], end = ' ') # print('') # my, mx = map(int, input().split()) # n = int(input()) # list = [[0 for i in range(mx)] for j in range(my)] # for k in range(n): # l,d,y,x = map(int, input().split()) # for i in range(0, l): # if d == 0: list[y-1][x-1+i] = 1 # elif d == 1: list[y-1+i][x-1] = 1 # for i in range(0, my): # for j in range(0, mx): # print(list[i][j], end = ' ') # print('') list = [list(map(int, input().split())) for _ in range(10)] i = int(1) j = int(1) list[1][1] = 9 while True: if list[i][j + 1] == 2 or list[i + 1][j] == 2 or list[i][j + 1] == 1 and list[i + 1][j] == 1: break if list[i][j + 1] == 0 and list[i][j + 1]: j += 1 list[i][j] = 9 else: i += 1 list[i][j] = 9 for i in range(0, 10): for j in range(0, 10): print(list[i][j], end=' ') print('')

# n = int(input()) # a = input().split() # for i in range(n): # a[i] = int(a[i]) # d = [] # for i in range(24): # d.append(0) # for i in range(n): # d[a[i]] += 1 # for i in range(1, 24): # print(d[i], end=' ') # n = int(input()) # list = list(map(int, input().split())) # list.reverse() # for i in range(0, len(list)): # print(list[i], end=' ') # n = int(input()) # min = int(100) # list = list(map(int, input().split())) # for i in range(0, len(list)): # if list[i] < min: min = list[i] # print(min) # ==================================================================== # list = [[0 for j in range(20)] for i in range(20)] # for i in range(n) : # list[i] = [0 for _ in range(n)] # ==================================================================== # list =[] # for i in range(n) : # list.append([0 for j in range(n)]) # n = int(input()) # list = [[0 for j in range(20)] for i in range(20)] # for i in range(n) : # a, b = map(int, input().split()) # list[a][b]=1 # for i in range(1, 20): # for j in range(1, 20): # print(list[i][j], end=' ') # print('\n', end = '') # n = int(input()) # list = [[0 for j in range(20)] for i in range(20)] # for i in range(20): # for j in range(20): # print(list[i][j], end=' ') # print('\n', end='') # a = input() # print(a) # a = input() # print(a) # a = input() # print(a.count('love')) # a = input() # print('welcome!',a) # a = input() # for i in range(len(a)): # if a[i] == 't': print(i + 1, end=' ') # a = input() # b = input() # c = input() # if a.strip()[-1] == b[0] and b.strip()[-1] == c[0] and c.strip()[-1] == a[0]: # print('good') # else: print('bad') # a = input() # for i in range(len(a)): # x = int(ord(a[i])) # print(chr(x + 2), end='') # print('') # for i in range(len(a)): # x = int(ord(a[i])) # print(chr((x*7)%80+48),end='') #32 a = input() for i in range(len(a)): x = ord(a[i]) if x >= 48 and x <= 57: print(a[i], end='') elif x > 96: x -= 32 print(chr(x),end='') else: x += 32 print(chr(x),end='')

# a,b,c,d = map(int, input().split()) # e = float(a*b*c*(d/10)/8/1024/1024) # print('%.1f'%(e*10), 'MB') # a,b,c = map(int, input().split()) # e = float(a*b*c/8/1024/1024) # print('%.2f'%e, 'MB') # a = int(input()) # sum = int(0) # i = int(0) # while True: # i += 1 # if (sum + i) >= a: # sum += i # print(sum) # break # sum += i # a = int(input()) # for i in range(1, a + 1): # if i % 3 == 0: continue # print(i,end=' ') # a,b,c = map(int, input().split()) # sum = int(a) # for i in range(1, c): # sum += b # print(sum) # a,b,c = map(int, input().split()) # sum = int(a) # for i in range(1, c): # sum *= b # print(sum) # a,b,d,c = map(int, input().split()) # sum = int(a) # for i in range(1, c): # sum *= b # sum += d # print(sum) # a,b,c = map(int, input().split()) # d = int(2) # while d%a!=0 or d%b!=0 or d%c!=0: # d += 1 # print(d) n = int(input()) d = [0 for i in range(23)] d = list(map(int, input().split())) for i in range(len(d)): print(d[i], end=' ')

# a,b = map(int, input().split()) # print(bool(a) or bool(b)) # a,b = map(int, input().split()) # if a != b: # print(True) # else: # print(False) # a,b = map(int, input().split()) # print(a == b) # a,b = map(int, input().split()) # c = bool(a) # d = bool(b) # print((not c) and (not d)) # a,b = map(int, input().split()) # print(a if(a>b) else b) # a,b,c = map(int, input().split()) # d = (a if(a<b) else b) # print( d if(d<c) else c) # a,b,c = map(int, input().split()) # if a % 2 == 0: print(a) # if b % 2 == 0: print(b) # if c % 2 == 0: print(c) # a,b,c = map(int, input().split()) # if a % 2 == 0: print('even') # else: print('odd') # if b % 2 == 0: print('even') # else: print('odd') # if c % 2 == 0: print('even') # else: print('odd') # a = int(input()) # if a < 0 and a % 2 == 0: print('A') # elif a < 0 and a % 2 != 0: print('B') # elif a > 0 and a % 2 == 0: print('C') # elif a > 0 and a % 2 != 0: print('D') # a = int(input()) # if a >= 90: print('A') # elif a >= 70: print('B') # elif a >= 49 and a <= 69: print('C') # else: print('D') # a = input() # if a == 'A': print('best!!!') # elif a == 'B': print('good!!') # elif a == 'C': print('run!') # elif a == 'D': print('slowly~') # else: print('what?') # a = int(input()) # if a == 12 or a == 1 or a == 2: print('winter') # elif a // 3 == 1: print('spring') # elif a == 6 or a == 7 or a == 8: print('summer') # else: print('fall') # n=10 # # i : 0 ~ n-1 # for i in range(n) : # print(i,end=' ') # print() # a=10 # b=16 # # i : a ~ b-1 # for i in range(a,b) : # print(i,end=' ') # print() # # range(시작값, 종료값+1,간격) # for i in range(b,a,-1) : # if i%2==0 : # print(i,end=' ') # print() # while True : # print('*') # if 어쩌구 : # break # 리스트 -> 고무고무 배열 # list = [] # list.append(5) # list.append('hello') # list.append([10,11]) # print(list) # 리스트 초기화 # list = [0 for i in range(길이)] # list = [i for i in range(10)] # print(list) # list.pop() # print(list) # print(list.pop()) # print(list) # list.reverse() # print(list) # list.sort() # print(list) # print(max(list)) # print(min(list)) # print(list[0:3]) # a = list[1:4] # print(a) # print(list[-1]) # list[len(list)-1] # print(len(list)) # print(list[2:]) # list[2] ~ list마지막까지 # print(list+a) #리스트끼리 합치기 # print(list*3) #리스트 3배하기 # print('--------------------') # print(list) # del list[2] # print(list) # # del list[3:] # # print(list) # list.append(3) # list.append(5) # print(list.index(5)) # list에서 5가 있는 곳의 맨 처음위치를 리턴해줘 # list.insert(0,500) # print(list) # push = append # pop = pop # insert(위치,값) # del list[위치] # list.insert(2,600) # print(list) # list.remove(600) # print(list) # print(list.count(3)) # while True: # a = int(input()) # if a == 0: break; # else: print(a) # a = int(input()) # for i in range(a, 0, -1): # print(i) # a = int(input()) # for i in range(a - 1, -1, -1): # print(i) # a = input() # b = ord(a) # for i in range(ord('a'), b + 1): # print(chr(i)) # a = int(input()) # for i in range(0, a + 1): # print(i) # a = int(input()) # for i in range(0, a + 1): # print(i) # a = int(input()) # sum = int(0) # for i in range(1, a + 1): # if (i % 2 == 0): sum += i # print(sum) # while True: # a = input() # if a == 'q': # print(a) # break # else: print(a) # a = int(input()) # i = int(1) # sum = int(0) # while True: # if (sum + i) >= a: # print(i) # break # sum += i # i += 1 # a,b = map(int, input().split()) # for i in range(1, a + 1, 1): # for j in range(1, b + 1, 1): # print(i,j) a = input() a = int(a,16) +

################################# # // 주석 -> # , 범위주석 범위선택, ctrl+/ # 파이참에서의 실행 ctrl+ shift + F10 # 세미콜론 X, 변수선언 필요없어 # end='\n' 프린트 마지막에 뭘 출력할지, 안 쓰면 줄바꿈 # sep=' ' 중간에 뭘 출력할지, 안 쓰면 공백 # 자료형 # 문장(문자) -> 기본자료형 # 정수 int (c보다 범위가 넓어 ) # 실수 float # input() : 줄바꿈이 들어올때까지 입력받는다 # a, b = map ( int , input().split() ) # print('love'*3) love 3번출력 # print(10/3) 3.3333333 실수 값 출력 # // 몫 # ** 거듭제곱 ################################ #print('\"!@#$%^&*()\'') #print('"C:\\Download\\\'hello\'.py"') #print('print(\"Hello\\nWorld\")') # a = input() #'10 20' # b = input() # a = input() #문장 입력 # b = input() #문장 입력 # print(a+b) # 문장+문장 연결 # a = input() #문장 입력 # a = int(a) # 정수로 형변환 # b = int(input()) #정수 입력 # print(a+b) # 정수 합 출력 # a, b = input().split() #공백으로 구분하여 순서대로 입력 # print(a,b) # a, b = input().split(',') #문장으로 입력받아짐 # a = int(a) # b = int(b) ####################################### # a, b = map ( int , input().split() ) # 공백으로 구분하여 받아서, 정수로 변환해서 입력 ######################################## # print(a+b) # a = input() # b = int(input()) # print(a*b) # 정수 * 정수 -> 곱 계산 ########## 문자열*정수 -> 문자열이 정수번 반복된걸로 바뀜 # 문자열+정수 -> 문자열로합쳐져 # 문자열+문자열 -> " # 정수+정수 -> 합 계산 # 산술연산자 + - * % 그대로쓰기 # 정수 / 정수 -> 실수 # 정수 // 정수 -> 정수몫 # a ** b ->a의 b제곱 # print(10/3) # a = 3.3567 # b = 3.1111 # print(a) # print('%.2f'%a,'%.2f'%b,sep='') # a = input() # print(a) # print(a) # print(a) # a, b = input().split() # print(a+'\n'+b) # a,b = input().split() # print(b, a) # a = input() # print(a, a, a) # a,b = input().split(':') # print(a, b, sep = ':') # a,b,c = input().split('.') # print(c,b,a,sep='-') # a,b = input().split('-') # print(a + '' + b) # a = input() # for i in range(0, 5): # print(a[i]) # a = input() # print(a[0:2], a[2:4], a[4:6]) # a,b,c = input().split(':') # print(b) # a,b = input().split() # print(a+''+b) # a,b = map(int, input().split()) # print(a + b) # a = float(input()) # b = float(input()) # print(a + b) # a = int(input()) # print('%x'%a) # a = int(input()) # print('%X'%a) # a = input() # a = int(a, 16) # print('%o'%a) # a = ord(input()) # print(a) # a = int(input()) # print(chr(a)) # a = int(input()) # print(-a) # 문자-> 아스키코드 ord('a') # 아스키코드->문자 chr(아스키코드) # a = input() # a = ord(a) #a의아스키코드 # a += 1 #a다음문자의 아스키코드 # print(chr(a)) #a다음문자 출력 # a,b = map(int, input().split()) # print(a - b) # a,b = map(float, input().split()) # print(a * b) # a,b = input().split() # b = int(b) # print(a*b) # a = int(input()) # b = input() # print(a*b) # a,b = map(int, input().split()) # print(a**b) # a,b = map(float, input().split()) # print(a**b) # a,b = map(int, input().split()) # print(a//b) # a,b = map(int, input().split()) # print(a%b) # a = float(input()) # print('%.2f'%a) # a,b = map(float, input().split()) # print('%.3f'%(a / b)) # a,b = map(int, input().split()) # print(a + b) # print(a - b) # print(a * b) # print(a // b) # print(a % b) # print('%.2f'%(a / b)) # a,b,c = map(int, input().split()) # d = a + b + c # e = float(d / 3) # print(d) # print('%.2f'%e) # 6048 - 6058 # 6063 - 6070 # 비교연산자 > < >= <= == != # 논리연산자 not and or # 삼항연산자 x if 조건식 else y # if a==0 or b>30 : # print('happy') # print('day') # elif not (b<10) : # print('bad') # else : # a,b = map(int, input().split()) # print(a < b) # a,b = map(int, input().split()) # print(a == b) # a,b = map(int, input().split()) # print(a <= b) # a,b = map(int, input().split()) # print(a != b) # a = int(input()) # print(bool(a)) # a = int(input()) # print(not(bool(a))) # a,b = map(int, input().split()) # print(bool(a) and bool(b))

/** #include <stdio.h> int main() { int n; char str[27] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; return 0; } **/ #include <stdio.h> char nums[101] = {'일', '이', '삼', '사', '오', '육', '칠', '팔', '구'}; char str[10] = {}; int i, j, k, n, m, len = 0; //void f (int p) //{ // for (i = 1 ; i <= p ; i ++) // { // if (str[len - ]) // { // // } // } //} int main() { scanf("%d", &n); m = n; for (int i = 0 ; ; i ++){ if (m == 0) break ; str[i] = m % 10 + 48; m /= 10; len ++; } /// f (len); for (i = 0 ; i < len ; i ++) { printf("%c", str[i]); } return 0; }

/** #include <stdio.h> int main() { int i, j, k, n, m; char str[27] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; scanf("%d", &n); if (n <= 26) { printf("%c", str[n - 1]); return 0; } // if (n == 52) // { // printf("AZ"); // return 0; // } m = n / 26; char x = str[m]; n -= 26 * m; char z = str[n]; printf("%c%c", x - 1, z - 1); return 0; } . **/ /* #include <stdio.h> int main() { int i, j, k, n, m; char str[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; int a = 65, b = 64; scanf("%d", &n); if (n <= 26) { printf("%c", str[n - 1]); return 0; } for (i = 1 ; i <= n ; i ++) { if (b == 90) { b = 64; a ++; //printf("%c%c\n", a - 1, b); } b ++; } printf("%c%c", a - 1, b); return 0; }*/ #include <stdio.h> char str[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; void f(int n) { if (n == 0) return ; f (n / 26); printf("%c", str[n % 26] - 1); } int main() { int n; scanf("%d", &n); if (n == 26) { printf("Z"); return 0; } f (n); return 0; }

/** #include <stdio.h> int a[1000001] = {}; /// 1 3 1 int f (int s, int e, int k) { int mid = (s + e) / 2; /// 2 if (s > e) return -1; if (a[mid] == k) return mid; if (a[mid] > k) return f(s, mid - 1, k); /// 1 1 if (a[mid] < k) return f(mid + 1, e, k); } int main() { int i, j, k, n, m, c = 0; scanf("%d", &n); for (i = 1 ; i <= n ; i ++) scanf("%d", &a[i]); scanf("%d", &m); for (i = 1 ; i <= m ; i ++) { scanf("%d", &k); printf("%d\n", f(1, n, k)); } return 0; } #include <stdio.h> int main() { int i, j, k, n, m; int stack[300001] = {}, top = 0; scanf("%d", &n); for (i = 1 ; i <= n ; i ++) { int x; scanf("%d", &x); if (top == 0 || (stack[top] + x) % 2 != 0) { top ++; stack[top] = x; } } printf("%d", top); return 0; } #include <stdio.h> int main() { int i, j, k, n, m; int arr[100001] = {}; int c[101][101] = {}; int a, b, dif = 1000000001; scanf("%d", &n); for (i = 1 ; i <= n ; i ++) { scanf("%d", &arr[i]); } for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= n ; j ++) { int z; if (c[i][j] != 0) z = c[i][j]; else { z = abs(arr[i] + arr[j]); c[i][j] = z; } if (i != j && z < dif) { a = arr[i]; b = arr[j]; dif = z; ///printf("a : %d\nb : %d\ndif : %d\n", a, b, dif); } } } if (a < b) printf("%d %d", a, b); else printf("%d %d", b, a); return 0; } **/ #include <stdio.h> int main() { int i, j, k, n, m; char str[27] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; scanf("%d", &n); if (n <= 26) { printf("%c", str[n - 1]); return 0; } // if (n == 52) // { // printf("AZ"); // return 0; // } m = n / 26; char x = str[m]; n -= 26 * m; char z = str[n]; printf("%c%c", x - 1, z - 1); return 0; }

/** #include <stdio.h> typedef struct { int x; int y; int h; } q; int i, j, k, n, m, rear = -1, front = -1, cnt = 1; int flag = 0; int arr[1001][1001] = {}; q queue[1000005] = {}; int dir[4][2] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; void push(int x, int y, int data) { int z = abs(data - arr[x][y]); if (y < 1 || y > m || x < 1 || x > n || z > 1 || arr[x][y] == -1) { return ; } rear ++; queue[rear].x = x; queue[rear].y = y; queue[rear].h = arr[x][y]; arr[x][y]=-1; if (x == n && y == m) flag ++; // printf("%d %d\n", x, y); } void view() { for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { printf("%02d ", arr[i][j]); } printf("\n"); } printf("\n"); } int main() { scanf("%d %d", &n, &m); for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { scanf("%d", &arr[i][j]); } } rear ++; queue[rear].x = 1; queue[rear].y = 1; queue[rear].h = arr[1][1]; arr[1][1]=-1; while (front != rear) { int ooo = rear; for (int t = front + 1 ; t <= ooo ; t ++) { front ++; int nx = queue[front].x; int ny = queue[front].y; int nh = queue[front].h; for (int q = 0 ; q < 4 ; q ++) { push(nx + dir[q][0], ny + dir[q][1], nh); if(flag!=0) { printf("%d", cnt + 1); return 0; } } } cnt ++; //printf("%d\n",cnt); ///printf("rear : %d\nfront : %d\n", rear, front); // view(); } if (flag == 0) { printf("0"); return 0; } return 0; } /* 4 4 7 7 8 5 6 6 7 4 5 6 7 5 2 6 6 7 #include <stdio.h> int f(int num, int cnt) { if (num == 1) return cnt; if (num % 2 == 0) num /= 2; else num = num * 3 + 1; return f(num, ++cnt); } int main() { int i, j, k, n, m; scanf("%d", &n); printf("%d", f(n, 0) + 1); return 0; } #include <stdio.h> int main() { int i, j, k, n, m; scanf("%d %d", &n, &k); for (i = 1 ; i <= n ; i ++) { scanf("%d", &m); if (m == k){ printf("%d", i); return 0; } } printf("-1"); return 0; } #include <stdio.h> int main() { int i, j, k, n, m; scanf("%d %d", &n, &k); for (i = 1 ; i <= m ; i ++) { scanf("%d", &m); if (m == k) { printf("%d", i); return 0; } } printf("-1"); return 0; } **/ #include <stdio.h> int a[1000001] = {}; /// 1 3 1 int f (int s, int e, int k) { int mid = (s + e) / 2; /// 2 if (s > e) return -1; else if (a[mid] != k) return -1; if (a[mid] == k) return mid; if (a[mid] > k) f(s, mid - 1, k); /// 1 1 if (a[mid] < k) f(mid + 1, e, k); } int main() { int i, j, k, n, m, c = 0; scanf("%d", &n); for (i = 1 ; i <= n ; i ++) scanf("%d", &a[i]); scanf("%d", &m); for (i = 1 ; i <= m ; i ++) { scanf("%d", &k); printf("%d\n", f(1, n, k)); } return 0; }

#include <stdio.h> typedef struct { int x; int y; int h; } q; int i, j, k, n, m, rear = -1, front = -1, cnt = 0; int flag = 0; int arr[1001][1001] = {}; q queue[1000001] = {}; void push(int x, int y, int data) { int z = abs(data - arr[x][y]); if (y < 1 || y > m || x < 1 || x > n || z > 1 || arr[x][y] == -1) { return ; } rear ++; queue[rear].x = x; queue[rear].y = y; queue[rear].h = arr[x][y]; arr[x][y]=-1; if (x == 1 || x == n || y == 1 || y == m) flag ++; // printf("%d %d\n", x, y); } void view() { for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { printf("%02d ", arr[i][j]); } printf("\n"); } printf("\n"); } int main() { scanf("%d %d", &n, &m); for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { scanf("%d", &arr[i][j]); } } rear ++; queue[rear].x = 1; queue[rear].y = 1; queue[rear].h = arr[1][1]; arr[1][1]=-1; while (front != rear) { int ooo = rear; for (int t = front + 1 ; t <= ooo ; t ++) { front ++; int nx = queue[front].x; int ny = queue[front].y; int nh = queue[front].h; push(nx, ny - 1, nh); push(nx + 1, ny, nh); push(nx, ny + 1,nh); push(nx - 1, ny, nh); } cnt ++; ///printf("rear : %d\nfront : %d\n", rear, front); ///view(); } if (flag == 0) printf("0"); else printf("%d", cnt); return 0; } /* 4 4 7 7 8 5 6 6 7 4 5 6 7 5 2 6 6 7 */

/** #include <stdio.h> #include <stdlib.h> typedef struct { int x; int y; } q; int i, j, k, n, m, rear = -1, front = -1; int arr[101][101] = {}; q queue[1001]; void push(int x, int y, int a) { if (y < 1 || y > n || x < 1 || x > m) { return ; } int z = arr[x][y] - a; ///printf("z : %d\n", z); if (abs(z) > 1) { ///printf("Fdsafdsafdasfdsafdsafda\n"); return ; } rear ++; queue[rear].x = x; queue[rear].y = y; } int main() { int cnt = 0; scanf("%d %d", &n, &m); for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { scanf("%d", &arr[j][i]); } } rear ++; queue[rear].x = queue[rear].y = 1; while (front != rear) { int ooo = rear; for (i = front + 1 ; i <= ooo ; i ++) { front ++; int nx = queue[front].x; int ny = queue[front].y; push(nx, ny - 1, arr[queue[rear].x][queue[rear].y]); push(nx + 1, ny, arr[queue[rear].x][queue[rear].y]); push(nx, ny + 1, arr[queue[rear].x][queue[rear].y]); push(nx - 1, ny, arr[queue[rear].x][queue[rear].y]); } cnt ++; ///printf("r : %d\nf : %d\n", rear, front); } printf("%d", cnt); return 0; } **/ #include <stdio.h> typedef struct { int x; int y; } q; int i, j, k, n, m, rear = -1, front = -1; int arr[101][101] = {}; q queue[1001] = {}; void push(int x, int y, int data) { int z = abs(data - arr[y][x]); if (y < 1 || y > n || x < 1 || x > m || z > 1) { return ; } rear ++; queue[rear].x = x; queue[rear].y = y; } int main() { scanf("%d %d", &n, &m); for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { scanf("%d", &arr[i][j]); } } rear ++; queue[rear].x = 1; queue[rear].y = 1; while (front != rear) { front ++; int nx = queue[front].x; int ny = queue[front].y; push(nx, ny - 1, arr[ny][nx]); push(nx + 1, ny, arr[ny][nx]); push(nx, ny + 1, arr[ny][nx]); push(nx - 1, ny, arr[ny][nx]); } return 0; }

/** #include <stdio.h> typedef struct { int x; int y; } q; int nx, ny, tx, ty, n, rear = -1, front = -1; int arr[1001][1001] = {}; q queue[10000001]; int dx[8] = {1, 2, 2, 1, -1, -2, -2, -1}; int dy[8] = {2, 1, -1, -2, -2, -1, 1, 2}; int is_in(int a, int b){ if (arr[a][b] == 1) return 0; return !(a < 1 || a > n || b < 1 || b > n); } int main() { int i, k, cnt = 0; int px, py; scanf("%d %d %d %d %d", &n, &nx, &ny, &tx, &ty); // 나이트 시작 위치 push rear ++; queue[rear].x = nx; queue[rear].y = ny; while(front != rear){ int ooo = rear; for (k = front + 1 ; k <= ooo ; k ++) { front ++; px = queue[front].x; py = queue[front].y; for (i = 0 ; i < 8 ; i ++) { int z = is_in(px + dx[i], py + dy[i]); if (z == 0) continue; if(px + dx[i]==tx && py + dy[i]==ty){ printf("%d", cnt + 1); return 0; } rear ++; queue[rear].x = px + dx[i]; queue[rear].y = py + dy[i]; arr[queue[rear].x][queue[rear].y] = 1; ///printf("%d %d\n",px + dx[i],py + dy[i]); } } cnt ++; ///printf("\n"); } return 0; } **/ #include <stdio.h> int main() { int i, j, k, n, m; int arr[101][101] = {}; scanf("%d %d", &n, &m); for (i = 1 ; i <= n ; i ++) { for (j = 1 ; j <= m ; j ++) { scanf("%d", &arr[i][j]); } } return 0; }

/** #include <stdio.h> typedef struct { int x; int y; } q; int arr[1001][1001] = {}; q queue[100000]; int rear = -1, front = -1, n, m, sum = 0; //front : 마지막으로 나간 데이터의 위치 //rear : 마지막으로 들어온 데이터의 위치 void enq(int x, int y) { if (x > m || x < 1 || y > n || y < 1 || arr[x][y] != 0) { return ; } sum ++; rear ++; queue[rear].x = x; queue[rear].y = y; arr[x][y] = 1; } void view() { int i, j; for (i = 1 ; i <= m ; i ++) { for (j = 1 ; j <= n ; j ++) { printf("%d ", arr[i][j]); } printf("\n"); } puts(""); } int main() { int i, j, k; scanf("%d %d", &n, &m); int ax, ay; for (i = 1 ; i <= m ; i ++) { for (j = 1 ; j <= n ; j ++) { scanf("%d", &arr[i][j]); if (arr[i][j] == 1) { queue[++rear].x = i; queue[rear].y = j; } } } if(rear==n*m){ printf("0"); return 0; } int day = 0, s = 0, e = 0; while (front < rear) { int ooo = rear; for (k = front + 1 ; k <= ooo ; k ++) { front ++; int bx = queue[front].x; int by = queue[front].y; enq(bx, by - 1); enq(bx + 1, by); enq(bx, by + 1); enq(bx - 1, by); } day ++; } for (i = 1 ; i <= m ; i ++) { for (j = 1 ; j <= n ; j ++) { if (arr[i][j] ==0) { printf("-1"); return 0; } } } printf("%d", day - 1); return 0; } **/ #include <stdio.h> typedef struct { int x; int y; } q; int i, j, k, n, m, a, b, t_x, t_y, ax, ay; int arr[101][101] = {}; q queue[1001] = {}; int rear = -1, front = -1; int main() { scanf("%d", &n); scanf("%d %d", &a, &b); rear ++; queue[rear].x = a; queue[rear].y = b; scanf("%d %d", &t_x, &t_y); while (front != rear) { front ++; ax = queue[front].x; ay = queue[front].y; } return 0; }