题解 | 斐波那契

import sys

def parse_input():
    n, k = map(int, sys.stdin.readline().strip().split())
    return n, k

def count_k(num, k) -> int:
    count = 0
    while num > 0:
        count += num % 10 == k
        num //= 10
    return count

def fib_generator(n):
    last = 0
    last_last = 1
    for i in range(n):
        now = last + last_last
        last_last, last = last, now
        yield now

if __name__ == "__main__":
    n, k = parse_input()
    
    count_max = -1
    fib_wanted = -1
    for fib in fib_generator(n):
        count = count_k(fib, k)
        if count > count_max:
            count_max, fib_wanted = count, fib

    print(fib_wanted)