from itertools import combinations_with_replacement answer = [] def check_sum(n, lst): combination = combinations_with_replacement(lst, n) for combination in combination: total = sum(combination) answer.append(total) N = int(input()) lst = [1,5,10,50] check_sum(N, lst) print(len(set(answer)))

def find_divided_parts(s): divided_parts = [] current_part = s[0] for char in s[1:]: if char == current_part[-1]: current_part += char else: divided_parts.append(current_part) current_part = char divided_parts.append(current_part) return [part for part in divided_parts if part] def ans_counter(a, b): count = 0 for part in result_set: if part[0] == a: count += 1 ans_count.append(count) input_str ..

N = int(input()) books = dict() for i in range(N): title = input() if title not in books: books[f'{title}'] = 1 else: books[f'{title}'] += 1 tmp = [k for k,v in books.items() if max(books.values()) == v] print(''.join(sorted(tmp)[0]))

보호되어 있는 글입니다.

from queue import Queue N = int(input()) lst = [i + 1 for i in range(N)] collect = [] for i in range(len(lst)): if len(lst) != 1: tmp1 = lst.pop(0) collect.append(tmp1) tmp = lst[0] lst.pop(0) lst.append(tmp) else: if len(" ".join(map(str, collect))+ " ".join(map(str, lst))) == 1: print("".join(map(str, lst))) break print(" ".join(map(str, collect)), " ".join(map(str, lst)))

#include #include int compare(const void* a, const void* b) { return (*(int*)a - *(int*)b); } int main() { int count; int n; scanf("%d %d", &count, &n); int* arr1 = (int*)malloc(count * sizeof(int)); for (int i = 0; i < count; i++) { scanf("%d", &arr1[i]); } qsort(arr1, count, sizeof(int), compare); if (n