[Quick Power] Luogu P1965 [NOIP2013 Improved Group] Spinning Game

link————————

---

solution

Analyze the question and get the final $x$ The coordinates
$(x+m\ast 10^k)$ $mod$ $n$
where$10^k$ can be obtained by fast exponentiation.

---

Code

#include<cstdio>
long long n, m, k, x, move;
long long ksm(long long kk){
    
    
	if(kk == 0) return 1;
	if(kk == 1) return 10;
	long long l = ksm(kk>>1);
	if(kk % 2 == 1) return l * l * 10 % n;
	return l * l % n;
}
int main(){
    
    
	scanf("%lld%lld%lld%lld", &n, &m, &k, &x);
	printf("%lld", (x + m * ksm(k)) % n);
}