Author: lllyouo
Date: 20250702
tag: 同余、快速幂
link: https://www.luogu.com.cn/problem/P1965问题描述
分析
计算
参考代码
cpp
#include <bits/stdc++.h>
using namespace std;
int qmi(int a, int b, int p) {
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a % p;
a = (long long)a * a % p;
b >>= 1;
}
return ans % p;
}
int main () {
int n, m, k, x; cin >> n >> m >> k >> x;
int p = qmi(10, k, n);
x = (x + m * p % n) % n;
cout << x << endl;
return 0;
}