보호되어 있는 글입니다.

n, m = map(int, input().split())maximum = 0dack = list(map(int,input().split()))for i in range(n-2): for j in range(i+1, n-1): for k in range(j+1, n): if (dack[i] + dack[j] + dack[k]

lst = []size = 0for i in range(5): temp_input = input() lst.append(temp_input) size_temp = len(temp_input) if size_temp >= size: size = size_temp else: passtry: for i in range(size): for j in range(5): if i

def bin_search(array, target, start, end): while start target: end = mid - 1 else: start = mid + 1 return Falsen = int(input())arr = list(map(int, input().split()))m = int(input())targets = list(map(int, input().split()))sorted_arr = sorted(arr)for target in targets: if bin_search(sorted_arr, target, 0, len(sorted_arr) - 1): print(1) else: ..

lst = []data = { 'A+': 4.5, 'A0': 4.0, 'B+': 3.5, 'B0': 3.0, 'C+': 2.5, 'C0': 2.0, 'D+': 1.5, 'D0': 1.0, 'F' : 0.0}tot_score = 0for n in range(0,20): n = input() parts = n.split() if parts[-1] == 'P': continue else: temp = float(parts[1]) tot_score += temp score = temp * data[parts[-1]] lst.append(score)average = sum(lst) ..

def check_func(word): flag = True checked = set() save_chars = '' for char in word: if char in checked and char != save_chars: flag = False checked.add(char) save_chars = char return flagn = int(input())cnt = 0for i in range(n): flag = check_func(input()) if flag == True: cnt += 1print(cnt)