Appearance
question:You are given an array of integers representing the heights of a sequence of towers. We say that the sequence is balanced if the difference between the heights of any two adjacent towers is at most 1. Your task is to determine whether the given sequence is balanced. -----Constraints----- - 1 leq n leq 100 - 1 leq h_i leq 100 - n is the number of towers and h_i represents the height of the i-th tower. -----Input----- Input is given from Standard Input in the following format: n h_1 h_2 ... h_n -----Output----- Print YES if the sequence of towers is balanced; otherwise, print NO. -----Sample Input----- 5 1 2 3 3 2 -----Sample Output----- YES In this case, the differences between adjacent towers are all within 1, so the sequence is balanced.
answer:def is_sequence_balanced(n, heights): Determines whether the sequence of tower heights is balanced. for i in range(n - 1): if abs(heights[i] - heights[i + 1]) > 1: return "NO" return "YES"
question:In a fictional city, there are n buildings in a row, numbered from 1 to n. Each building can either be a residential building (denoted by 'R') or a commercial building (denoted by 'C'). Each resident of a residential building wants to visit the nearest commercial building to buy their groceries. You are required to find the minimum total distance that all residents have to travel to reach the nearest commercial building. Distance between buildings i and j is defined as |i - j|, where |x| denotes the absolute value of x. Input The first line contains an integer n (1 ≤ n ≤ 100000) — the number of buildings in the row. The second line contains a string of length n consisting of 'R' and 'C', representing the type of each building. Output Print the minimum total distance all residents have to travel. If there are no residents or commercial buildings, print 0. Examples Input 7 RCCRRCR Output 4 Input 3 CCC Output 0 Input 5 RRRCC Output 6 Note: In the first example, the distances for each resident to the nearest commercial building are as follows: - The first resident (building 1) travels to building 2. - The fourth resident (building 4) travels to building 5. - The fifth resident (building 5) travels to building 6. So, the total distance is 1 + 1 + 2 = 4. In the second example, since there are no residents, the total distance is 0. In the third example, the distances for each resident are: - The first resident (building 1) travels to building 4. - The second resident (building 2) travels to building 4. - The third resident (building 3) travels to building 4. So, the total distance is 3 + 2 + 1 = 6.
answer:def minimum_total_distance(n, buildings): Calculate the minimum total distance all residents have to travel to reach the nearest commercial building. :param n: int, number of buildings :param buildings: string, 'R' for residential building, 'C' for commercial building :return: int, minimum total distance if 'R' not in buildings or 'C' not in buildings: return 0 min_dist = [float('inf')] * n # Pass from left to right nearest_c = float('inf') for i in range(n): if buildings[i] == 'C': nearest_c = i if buildings[i] == 'R' and nearest_c != float('inf'): min_dist[i] = i - nearest_c # Pass from right to left nearest_c = float('inf') for i in range(n - 1, -1, -1): if buildings[i] == 'C': nearest_c = i if buildings[i] == 'R' and nearest_c != float('inf'): min_dist[i] = min(min_dist[i], nearest_c - i) return sum([dist for dist in min_dist if dist != float('inf')])
question:# Task Adam is catering to multiple events and needs to figure out whether he can fulfill the demands of multiple orders of sandwiches. Given two lists representing the bread and sandwich preferences of the guests, determine if he has enough bread to cater to all the orders. Each type of sandwich requires two slices of bread. Assume he has unlimited ingredients, but the only limiting factor is the number of bread slices he has. # Example For example, given `bread_slices = 20` and `sandwich_orders = [4, 3, 2, 5]`, the result should be `True`, since the total number of sandwiches is `14`, requiring `14 * 2 = 28` slices of bread, and 28 is greater than 20. # Input/Output - `[input]` an integer `bread_slices` The number of slices of bread Adam has. Constraints: 1 ≤ bread_slices ≤ 1000 - `[input]` array of integers `sandwich_orders` Each integer in the array represents the number of sandwiches ordered by a guest. Constraints: 1 ≤ sandwich_orders.length ≤ 100, 1 ≤ sandwich_orders[i] ≤ 10 - `[output]` a boolean Return `True` if Adam can fulfill all the orders, otherwise return `False`.
answer:def can_fulfill_orders(bread_slices, sandwich_orders): Determines if there are enough bread slices to fulfill the orders of sandwiches. Each sandwich requires 2 slices of bread. Parameters: bread_slices (int): The number of slices of bread Adam has. sandwich_orders (list of int): The number of sandwiches ordered by each guest. Returns: bool: True if there are enough bread slices to fulfill the orders, False otherwise. total_sandwiches = sum(sandwich_orders) needed_bread_slices = total_sandwiches * 2 return bread_slices >= needed_bread_slices
question:A palindrome is a word, phrase, or number that reads the same backward as forward, ignoring spaces, punctuation, and capitalization. Given a string, determine the longest possible palindrome that can be formed using any of the characters in the string. -----Input----- A single line containing a string S, which consists of lowercase and uppercase English letters. -----Output----- A single line containing the longest possible palindrome that can be formed using any of the characters in the string. If there are multiple solutions, any one of them is acceptable. -----Constraints----- 1 ≤ |S| ≤ 1000, where |S| denotes the length of the string S. -----Sample Input----- abccccdd -----Sample Output----- dccaccd
answer:def longest_palindrome(s): Returns the longest possible palindrome that can be formed using any of the characters in the string. from collections import Counter char_count = Counter(s) palindrome_half = [] middle_char = "" for char, count in char_count.items(): if count % 2 == 1 and (middle_char == "" or char > middle_char): middle_char = char palindrome_half.append(char * (count // 2)) palindrome_half_sorted = sorted(palindrome_half, reverse=True) half = ''.join(palindrome_half_sorted) return half + middle_char + half[::-1]