任何更快地执行程序的替代方法

Question

n,k,m=map(int,input().split())
s=input()
while m>0:
    pre=len(s)
    for i in s:
        s+=str(int(i)*k)
    s=s[pre:]
    m-=1
print(len(s))

目的是确定M级后白球的数量。请注意，对于每个级别，K都保持不变。

n，m，k是整数，s是称为球幂(0<=s>=9)的字符串，s是单数。

INPUT-4 9 2
5418
OUTPUT-14
Exlanation-Initially S=5418
After the 1st, level S=4536972
After the 2nd level, S=36452754816318
length of s is 14 

Answer 1

n, k, m = map(int, input().split())
s = input()
for m in range(m, 0, -1):
    pre = len(s)
    for i in s:
        s += str(int(i) * k)
    s = s[pre:]
print(len(s))

以上代码具有O(m*s)时间复杂度。