problem solving42 1230. [S/W 문제해결 기본] 8일차 - 암호문3 for t in range(10): lenn = int(input()) # 암호문 길이 original = list(map(int,input().split())) # 원본 암호문 inst_n = int(input())# 명령어 개수 instruction = list(map(str,input().split())) # 명령어 i = 0 while True: if i >= len(instruction): break if instruction[i] == 'I': # 삽입 명령어 insert_index = int(instruction[i+1]) # x insert_n = int(instruction[i+2]) # y for j in range(1, insert_n+1): original.insert(insert_.. 2019. 9. 19. 1220. [S/W 문제해결 기본] 5일차 - Magnetic for t in range(10): nemo = [] ans = 0 hund = int(input()) for i in range(100): nemo.extend([list(map(int,input().split()))]) for i in range(100): for j in range(100): if nemo[i][j] == 1: for k in range(i+1,100): if nemo[k][j] == 2: ans = ans + 1 break; if nemo[k][j] == 1: break; print('#%d'%(t+1),ans) 2019. 9. 19. 3431. 준환이의 운동관리 t = int(input()) for q in range(t): L,U,X = map(int,input().split())# L = 분이상 U = 분이하 X= 운동한시간 if X > U: ans = -1 elif X >= L and X 2019. 9. 18. 1215. [S/W 문제해결 기본] 3일차 - 회문1 import copy for t in range(10): ans = 0 n = int(input()) lst = ['']*8 for i in range(8): strr = input() lst[i] = list(strr) for i in range(0,8): for j in range(8-n+1): string = '' for f in range(j,j+n): # 가로검사 string = string+lst[i][f] string = list(string) original = copy.deepcopy(string) string.reverse() reversee = copy.deepcopy(string) if original == reversee: ans = ans + 1 string = '' for f .. 2019. 9. 18. 1206. [S/W 문제해결 기본] 1일차 - View for t in range(10): lenn = int(input()) lst = list(map(int,input().split())) ans = 0 for i in range(1,lenn-2): left1 = lst[i] - lst[i-2] left2 = lst[i] - lst[i-1] right1 = lst[i] - lst[i+1] right2 = lst[i] - lst[i+2] if left1 >= 0 and left2 >= 0 and right1 >=0 and right2 >=0: if left1 2019. 9. 17. 5642. [Professional] 합 t = int(input()) for q in range(t): n = int(input()) n_lst = list(map(int,input().split())) maxx = 0 hap = 0 for i in range(n): hap = hap + n_lst[i] if hap maxx: maxx = hap # hap이 maxx보다 크면 maxx는 hap print('#%d'%(q+1),maxx) 2019. 9. 15. 이전 1 2 3 4 5 6 7 다음