BINABLE

from collections import Counterdef solution(X, Y): count_x = Counter(X) count_y = Counter(Y) common_digit = set(X) & set(Y) result = [] for digit in common_digit: min_count = min(count_x[digit], count_y[digit]) result.extend([digit] * min_count) result.sort(reverse=True) if len(result) == 0: return '-1' if result[0] == '0': return '..

def solution(array, commands): answer = [] for m in range(len(commands)): i = commands[m][0] j = commands[m][1] k = commands[m][2] new_arr = array[i-1:j] new_arr.sort() answer.append(new_arr[k-1]) return answer

def solution(k, m, score): answer = 0 score.sort(reverse=True) # 내림차순으로 sorting for i in range(0, len(score)-(len(score)%m), m): answer += sort[i+m-1] * m return answer

def solution(phone_number): phone_num_list = list(phone_number) for i in range(len(phone_num_list)): if i == (len(phone_num_list)-4): break phone_num_list[i] = "*" answer = ''.join(phone_num_list) return answer

def solution(n): answer = 0 num_list = [] for i in range(len(str(n))): num_list.append(n%10) n //= 10 sorted_num_list = sorted(num_list) for i in range(len(sorted_num_list)): answer += sorted_num_list[i] * (10**i) return answer

def solution(n): answer = 0 while (n//10 > 0): answer += (n%10) n //= 10 answer += n return answer

def solution(n): divisor = [] for i in range(1, n+1): if n%i == 0: divisor.append(i) else: continue answer = sum(divisor) return answer

def solution(storage, usage, change): total_usage = 0 for i in range(len(change)): usage = usage * (change[i]+100)/100 total_usage += usage if total_usage > storage: return i return -1

number = int(input())answer = 0for i in range(len(str(number))): answer += number % 100 number //= 100print(answer)