mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 19:52:02 +00:00
22 lines
406 B
C++
22 lines
406 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
||
|
using namespace std;
|
||
|
|
||
|
long long binpow(long long a, long long b, long long m) {
|
||
|
a %= m;
|
||
|
long long res = 1;
|
||
|
while (b > 0) {
|
||
|
if (b & 1) res = res * a % m;
|
||
|
a = a * a % m;
|
||
|
b >>= 1;
|
||
|
}
|
||
|
return res;
|
||
|
}
|
||
|
|
||
|
int main() {
|
||
|
int n, m, k, x;
|
||
|
cin >> n >> m >> k >> x;
|
||
|
cout << (x % n + m % n * binpow(10, k, n) % n) % n << endl;
|
||
|
return 0;
|
||
|
}
|