题解 | #递推数列#

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
using namespace std;

int arr[1000];

int main() {
    int a0, a1, p, q, k;
    while (scanf("%d%d%d%d%d", &a0, &a1, &p, &q, &k) != EOF) {
        arr[0] = a0;
        arr[1] = a1;
        for (int i = 2; i <= k; i++) {
            int t = p * arr[i - 1] + q * arr[i - 2];
            arr[i] = t % 10000;
        }
        printf("%d\n", arr[k] % 10000);
    }
}