일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 |
- C++
- java
- axios
- json-server
- redux-toolkit
- SW
- 코딩테스트합격자되기
- react-router
- redux-saga
- 자바
- programmers
- 매일메일
- react-redux
- 프로그래머스
- maeil-mail
- redux
- Get
- 이코테
- Algorithm
- react
- sw expert academy
- useDispatch
- 알고리즘
- JavaScript
- 항해99
- Python
- 테코테코
- 리액트
- createSlice
- 항해플러스
- Today
- Total
목록SW Expert Academy/level 2 (11)
Binary Journey
출처: https://swexpertacademy.com/ scores = ["A+", "A0", "A-", "B+", "B0", "B-", "C+", "C0", "C-", "D0"] T = int(input()) for test_case in range(1, T + 1): total, student = map(int, input().split()) pivot = total // len(scores) student_scores = [[0,0] for i in range(total)] answer = '' for t in range(total): mid, final, report = map(int, input().split()) student_scores[t][0] = mid * 0.35 + final *..
출처: https://swexpertacademy.com/ checkpoint = [(0,0), (0,3), (0,6), (3,0), (3,3), (3,6), (6,0), (6,3), (6,6)] standard_number = 45 N = 9 T = int(input()) for test_case in range(1, T + 1): answer = 1 matrix = [list(map(int, input().split())) for _ in range(N)] for i in range(N): if answer == 0: break _sum = sum(matrix[i]) if _sum > standard_number: answer = 0 break _sum = 0 for v in range(N): _su..
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): h1, m1, h2, m2 = map(int, input().split()) h = h1 + h2 m = 0 if m1 + m2 12: h = h % 12 if h == 0: h += 12 print(f'#{test_case} {h} {m}')
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): N, M = map(int, input().split()) matrix = [] answer = 0 for i in range(N): matrix.append(list(map(int, input().split()))) for i in range(N): ones = 0 for h in range(N): # 행 if matrix[i][h] == 0: if ones == M: answer += 1 ones = 0 continue ones += 1 if ones == M: answer += 1 ones = 0 for v in range(N): # 열 if matr..
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): numbers = list(map(int, input().split())) MAX = max(numbers) MIN = min(numbers) numbers = [ n for n in numbers if n != MAX and n != MIN ] print(f'#{test_case} {round(sum(numbers) / len(numbers))}')
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): number = int(input()) if number % 2: print(f'#{test_case} {test_case // 2 * -1 + test_case}') else: print(f'#{test_case} {test_case // 2 * -1}')
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): answer = 0 N, M = map(int, input().split()) flies = [] for n in range(N): flies.append(list(map(int, input().split()))) max_kill = 0 for i in range(N - M + 1): for j in range(N - M + 1): temp = 0 for a in range(M): for b in range(M): temp += flies[i +a][j+b] if temp > max_kill: max_kill = temp print(f'#{test_case..
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): word = input() answer = 1 if word == ''.join(reversed(word)) else 0 print(f'#{test_case} {answer}')
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): print(f'#{test_case}') star_num = int(input()) arr = [[0] * star_num for i in range(star_num)] for i in range(star_num): for j in range(star_num): if j == 0 or j == star_num - 1: arr[i][j] = str(1) else: arr[i][j] = str(int(arr[i-1][j-1]) + int(arr[i-1][j])) print(' '.join(arr[i][:i + 1]))
출처: https://swexpertacademy.com/ T = int(input()) for test_case in range(1, T + 1): string = input() word = '' for s in string: word += s string = string[1:] if string.index(word) == 0: break print(f'#{test_case} {len(word)}')