Cordingle analog test beautiful numbers

the reference answer GPT ᴼ ᴾ ᴱ ᴺ ᴬ ᴵ < br / > a possible Python implementation is as follows:

def is_beautiful_number(number, beautiful_digits):
    # 判断数字 number 是否是优美的数字
    for digit in str(number):
        if digit not in beautiful_digits:
            return False
    return True

with open('number.in', 'r') as f:
    # 读入数据
    n, m = map(int, f.line().split())
    beautiful_digits = set(f.readline().split())
    numbers = list(map(int, f.readline().split()))

    # 遍历多位数，找出优美的数字
    beautiful_numbers = []
    for number in numbers:
        if is_beautiful_number(number, beautiful_digits):
            beautiful_numbers.append(number)

    # 输出结果
    if beautiful_numbers:
        for number in beautiful_numbers:
            print(number)
    else:
        print('none')

first reads the data, storing the beautiful numbers in a collection beautiful_digits, and the multidigits in a list numbers.

Next, we define a function is_beautiful_number(number, beautiful_digits) to determine whether a number number is a beautiful number. Iterate over each digit of number, returning False if any digit is not in the beautiful_digits collection. Otherwise, return True.

Then, we go through each number in the list of numbers to determine if it is a beautiful number. If it is, add it to the beautiful_numbers list.

Finally, if the beautiful_numbers list is not empty, output each number in the order it was entered. Otherwise, the string 'none' is printed.