题解 | 递推数列
递推数列
https://www.nowcoder.com/practice/d0e751eac618463bb6ac447369e4aa25
def fun(a0, a1, p, q, k ):
dp = [0] * (k+1)
dp[0] = a0
dp[1] = a1
for i in range(2, k+1):
dp[i] = p*dp[i-1] + q*dp[i-2]
dp[i] %= 10000
return dp[k]
a0, a1, p, q, k = list(map(int, input().split()))
res = fun(a0, a1, p, q, k )
print(res)