answer:def digit_to_word(n): Converts an integer (0-9999) to its word representation in English. if n == 0: return "zero" units = ["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] teens = ["ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"] tens = ["", "", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety"] thousands = ["", "one thousand", "two thousand", "three thousand", "four thousand", "five thousand", "six thousand", "seven thousand", "eight thousand", "nine thousand"] words = [] if n // 1000 > 0: words.append(thousands[n // 1000]) n %= 1000 if n // 100 > 0: words.append(units[n // 100]) words.append("hundred") n %= 100 if 10 <= n <= 19: words.append(teens[n - 10]) else: if n // 10 > 0: words.append(tens[n // 10]) if n % 10 > 0: words.append(units[n % 10]) return ' '.join(words).strip() def process_cases(T, cases): results = [] for number in cases: results.append(digit_to_word(number)) return results

answer:def has_robot_returned_to_origin(s): Determines if the robot returns to the origin after following the sequence of commands. Parameters: s (str): A string of commands 'U', 'D', 'L', 'R'. Returns: str: "YES" if robot returns to the origin, "NO" otherwise. # Initialize starting position x, y = 0, 0 # Iterate through the command string for command in s: if command == 'U': y += 1 elif command == 'D': y -= 1 elif command == 'L': x -= 1 elif command == 'R': x += 1 # Check if robot is back at the origin return "YES" if x == 0 and y == 0 else "NO"

answer:def longest_subarray_length(arr, N, D): Finds the length of the longest contiguous subarray where the difference between the maximum and minimum values in the subarray is less than or equal to D. max_len = 0 start = 0 min_val = arr[0] max_val = arr[0] for end in range(N): min_val = min(min_val, arr[end]) max_val = max(max_val, arr[end]) while max_val - min_val > D: start += 1 min_val = min(arr[start:end+1]) max_val = max(arr[start:end+1]) max_len = max(max_len, end - start + 1) return max_len # Drive function to read input and call the core function if __name__ == "__main__": import sys input = sys.stdin.read data = input().split() N = int(data[0]) D = int(data[1]) arr = list(map(int, data[2:])) print(longest_subarray_length(arr, N, D))

answer:def is_prime(n): Check if a number is prime if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True def is_tree_beautiful(h): Determines if a perfect binary tree of height h is beautiful. A tree is beautiful if the number of non-leaf nodes is a prime number. # Number of non-leaf nodes in a perfect binary tree of height h # The number of nodes at level i is 2^i # The total number of nodes in a perfect binary tree of height h is 2^(h+1) - 1 # The number of leaf nodes is 2^h # So, the number of non-leaf nodes is (2^(h+1) - 1) - 2^h = 2^h - 1 num_non_leaf_nodes = 2**h - 1 return "YES" if is_prime(num_non_leaf_nodes) else "NO"