Appearance
question:You are given a string and an integer k. Check if it is possible to rearrange the string such that no two adjacent characters are the same after k swaps. A swap is defined as exchanging the positions of any two characters in the string. If it is possible to achieve such a rearrangement, print "YES", otherwise print "NO". Input The first line contains a string s, consisting of lowercase Latin letters. The second line contains an integer k (1 ≤ k ≤ |s|). The input data do not contain unnecessary spaces. The string is not empty and its length does not exceed 100 symbols. Output Print "YES" if it is possible to rearrange the string such that no two adjacent characters are the same after k swaps. Otherwise, print "NO". Examples Input aabb 2 Output YES Input aaab 1 Output NO Input abc 3 Output YES
answer:from collections import Counter def can_rearrange_string(s, k): Check if it is possible to rearrange the string 's' such that no two adjacent characters are the same after 'k' swaps. Parameters: s (str): The input string consisting of lowercase Latin letters. k (int): The maximum number of swaps. Returns: str: "YES" if it is possible to rearrange such that no two adjacent characters are the same, otherwise "NO". # Count the frequency of each character freq = Counter(s) # The most frequent character should not appear more than (len(s) + 1) // 2 times max_freq = max(freq.values()) if max_freq > (len(s) + 1) // 2: return "NO" # Check if we can achieve this with k swaps if k >= len(s): return "YES" # The number of swaps required to rearrange the string such that no two adjacent # characters are the same is dependent on the initial distribution of characters. # If we need more swaps than what is available, then return "NO". return "YES"
question:John, the botanist, is studying a peculiar species of plant known as the Fibonacci Flower. This plant grows in such a way that the number of new leaves it sprouts each month follows the famous Fibonacci sequence. The Fibonacci sequence is defined as follows: - F(0) = 0 - F(1) = 1 - F(n) = F(n-1) + F(n-2) for n ≥ 2 John wants to know how many leaves the plant will have after a certain number of months. Write a program to help John determine this. Input The input consists of a single integer n (0 ≤ n ≤ 30), representing the number of months. Output Output a single integer, the number of leaves the Fibonacci Flower will have after n months. Examples Input 5 Output 5 Input 10 Output 55 Input 0 Output 0 Note In the first sample test, after 5 months the plant will have 5 new leaves, following the Fibonacci sequence: 0, 1, 1, 2, 3, 5. In the second sample test, after 10 months the plant will have 55 new leaves, following the Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55.
answer:def fibonacci(n): Returns the nth Fibonacci number. Parameters: n (int): The month number. Returns: int: The number of leaves after n months. if n == 0: return 0 elif n == 1: return 1 else: a, b = 0, 1 for _ in range(2, n + 1): a, b = b, a + b return b
question:You are given a series of operations to perform on an initial empty set of integers. The operations are executed in the order they are given, and each one of them is one of the following types: 1. Insert an integer x into the set. 2. Delete an integer x from the set. (If x is not in the set, do nothing.) 3. Check if the integer x is present in the set. Each operation is described by one of the following forms: - "1 x" — Insert x into the set. - "2 x" — Delete x from the set. - "3 x" — Check if x is in the set. Input The first line contains a single integer q (1 ≤ q ≤ 10^5) — the number of queries. Each of the following q lines contains a query of the form defined above, where -10^9 ≤ x ≤ 10^9. Output For each query of the type "3 x", output "Yes" if x is present in the set, otherwise output "No". Example Input 5 1 5 1 10 3 5 2 5 3 5 Output Yes No Explanation The input describes a series of five operations: 1. Insert 5 into the set. 2. Insert 10 into the set. 3. Check if 5 is in the set — it is, so print "Yes". 4. Delete 5 from the set. 5. Check if 5 is in the set — it's not, so print "No".
answer:def process_operations(operations): Processes a list of operations on a set of integers. Args: operations: List of tuples where each tuple has an integer as the first element which denotes the operation type (1 for insert, 2 for delete, 3 for check) and an integer as the second element which denotes the value to be inserted, deleted or checked. Returns: result: List of strings "Yes" and "No" corresponding to each "3 x" operation. s = set() result = [] for operation in operations: op_type, x = operation if op_type == 1: s.add(x) elif op_type == 2: s.discard(x) elif op_type == 3: result.append("Yes" if x in s else "No") return result # For ease of testing: def parse_input(input_str): Parses the input string into a list of operations. Args: input_str: String where each operation is on a new line. Returns: A list of tuples representing the operations. lines = input_str.strip().split("n") q = int(lines[0]) operations = [tuple(map(int, line.split())) for line in lines[1:q+1]] return operations
question:In an isolated land, the king has organized a unique competition for his citizens. The competition involves constructing towers using crystal blocks. Each tower must consist of only one type of color, and the height of such a tower is determined by the number of blocks used. Citizens can only use blocks of certain specific heights given to them by the king. You are given a list of integers where each integer represents the height of a block. Your task is to determine the maximum height of any color-coherent tower that can be built from these blocks. Write a function `max_tower_height(block_heights)` that takes a list of integers and returns the height of the tallest possible tower using the given blocks. The blocks of the same height will form a color-coherent tower. The function should return 0 if no blocks are given. SAMPLE INPUT [1, 2, 2, 3, 3, 3, 4, 4, 4, 4] SAMPLE OUTPUT 4 Explanation In the sample input, the towers can be constructed from blocks of heights 1, 2, 3, and 4. The tallest possible tower is formed by using four blocks of height 4. Thus, the output is 4, which represents the height of this tallest color-coherent tower.
answer:def max_tower_height(block_heights): Returns the height of the tallest possible tower using given blocks. if not block_heights: return 0 from collections import Counter height_counts = Counter(block_heights) tallest_tower = max(height_counts.values()) return tallest_tower