浦发银行算法接力赛总结/python语言/算法+建模/用户行为预测-03算法：小i的生长数

import sys

T = int (input ())
for t in range (0, T):
    a = input ().split ()
    x = a[0]
    x = list (x)
    n = len (x)
    d = int (a[1])
    K = int (a[2])
    sum = [1] * (n)
    numLen = 0
    flag = 0
    for j in range (n - 1, -1, -1):
        if x[j] == '0':
            if (d > 0):
                sum[j] = 0
        else:
            base = int (x[j])
            exponent = d
            while exponent:
                if exponent & 1:
                    sum[j] *= base
                    if (numLen + sum[j] >= K):
                        print (x[j])
                        flag = 1
                        break
                base *= base
                exponent = exponent >> 1
        if flag == 1:
            break
        else:
            numLen = numLen + sum[j]
            if (numLen >= K):
                print (x[j])
                flag = 1
                break
    if (flag == 0):
        print ('-1')