题解 | 递推数列

#include<iostream>
#include<vector>
using namespace std;
int main(){
    int a0,a1,p,q,k;
    cin>>a0>>a1>>p>>q>>k;
    vector<int>a;
    a.push_back(a0),a.push_back(a1);
    for(int i=2;i<=k;i++){
        a.push_back((a[i-1]*p+q*a[i-2])%10000);
    }
    cout<<a[k]<<endl;
}