int last_digit_of_power(long long num) {
int n = num % 4;
if (n == 0)
n = 4; // Use 4 as the exponent if the remainder is 0
int last_digit = num % 10;
int result = 1;
for (int i = 0; i < n; ++i) {
result *= last_digit;
result %= 10; // Ensure the result remains a single digit
}
return result;
}
由规律图可知,N次方最多以4为周期的循环:
故可直接取4的模,得到余数即为个位数乘法的次数
但可整除4的情况单独考虑即可