본문 바로가기

problem solving42

1979. 어디에 단어가 들어갈 수 있을까 t = int(input()) for i in range(t): n,k = map(int,input().split()) lst = [] for j in range(n): lst.append(list(map(int,input().split()))) ans = 0 for j in range(n): check_w = 0 check_c = 0 gumsagi = 1 for h in range(n): if h == (n-1) : gumsagi = 0 if lst[j][h] == 1 : check_w = check_w + 1 if check_w == k and (lst[j][h+gumsagi] != 1 or h == n-1): ans = ans + 1 else: check_w = 0 if lst[h][j] == 1:.. 2019. 9. 8.
2001. 파리 퇴치 T = int(input()) ans = [] for i in range(T): N,M = map(int,input().split()) room = [] maxx = [] for j in range(N): room.append(list(map(int,input().split()))) for i in range(N-M+1): for j in range(N-M+1): hap = 0 for k in range(i,i+M): hap = hap + sum(room[k][j:j+M]) maxx.append(hap) ans.append(maxx) for i in range(len(ans)): print('#%d'% (i+1),max(ans[i])) 2019. 9. 7.
2005. 파스칼의 삼각형 t = int(input()) ans = [] nlst = [] for i in range(t): n = int(input()) lenn = ((n *(n+1))/2) lst = [0]*int(lenn) cnt_front = 0 cnt_back = 2 cnt = 1 plus_front = 1 plus_back = 3 for j in range(int(lenn)): if cnt_front == j: lst[j] = 1 cnt_front = cnt_front + plus_front plus_front = plus_front + 1 if cnt_back == j: lst[j] = 1 cnt_back = cnt_back + plus_back plus_back = plus_back + 1 for k in rang.. 2019. 9. 7.
2007. 패턴 마디의 길이 t = int(input()) lst = [] for i in range(t): strr = str(input()) three = strr[0:3] for j in range(3,30): a = strr[j:j+3] if three == a: idx = j break; lst.append(idx) for k in range(t): print("#%d" % (k+1), lst[k]) 2019. 9. 7.
1926. 간단한 369 게임 n = int(input()) for i in range(1,n+1): l = str(i) clap = l.count('3') + l.count('6') + l.count('9') if clap == 1 : print('-',end=' ') elif clap == 2: print('--',end=' ') elif clap == 3: print('---',end=' ') else: print(i,end=' ') 2019. 9. 7.
1859. 백만장자 프로젝트 변경 전 def earn(a,b=[]): earning = 0 for i in range(a): maxx = max(b[i:]) if maxx != b[i]: earning = earning + (maxx - b[i]) return earning t = int(input()) ans = [] for i in range(t): case = int(input()) lst = list(map(int,input().split())) earning = earn(case,lst) ans.append(earning) for j in range(t): print("#%d" % (j+1), ans[j]) 시간 초과가 떠서 코드를 일부 수정 변경 후 t = int(input()) ans = [] for i in range.. 2019. 9. 7.