UVA1230 LA4104 MODEX【快速模幂】

Many well-known cryptographic operations require modular exponentiation. That is, given integers x, y and n, compute x^y mod n. In this question, you are tasked to program an efficient way to execute this calculation.
Input
The input consists of a line containing the number c of datasets, followed by c datasets, followed by a line containing the number ‘0’.
    Each dataset consists of a single line containing three positive integers, x, y, and n, separated by blanks. You can assume that 1 < x, n < 2¹⁵ = 32768, and 0 < y < 2³¹ = 2147483648.
Output
The output consists of one line for each dataset. The i-th line contains a single positive integer z such that
$$z=x^{y}modn$$
for the numbers x, y, z given in the i-th input dataset.
Sample Input
2
2 3 5
2 2147483647 13
0
Sample Output
3
11

问题链接：UVA1230 LA4104 MODEX
问题简述：（略）
问题分析：快速模幂问题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA1230 LA4104 MODEX */

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

// 快速模幂
LL powmod(LL x, LL n, LL m)
{
    LL ret = 1;
    for(; n; n >>= 1) {
        if(n & 1) {
            ret *= x;
            ret %= m;
        }
        x *= x;
        x %= m;
    }

    return ret;
}

int main()
{
    int t, x, y, n;
    while (~scanf("%d", &t) && t) {
        while (t--) {
            scanf("%d%d%d", &x, &y, &n);
            printf("%lld\n", powmod(x, y, n));
        }
    }

    return 0;
}