DoIdo

```cpp#include<iostream>#include<algorithm>using namespace std;typedef long long ll;const int N = 20;ll B[N], u[N];inline ll qmul(ll a, ll b, ll p) { ll res = 0; a %= p; b %= p; while (b) { if (b & 1LL) { res = (res + a) %

问题 C: A^X mod P题目描述It’s easy for ACMer to calculate A^X mod P. Now given seven integers n, A, K, a, b, m, P, and a function f(x) which defined as following.f(x) = K, x = 1f(x) = (a*f(x-1) + b)%m , x > 1Now, Your task is to calculate( A^(f(1)) + A

#include<cmath>#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;const int N = 110;const double eps = 1e-6;int n;double u[N][N];int gauss() { int x, y; for (y = 1, x = 1; y <= n; y++) { int