LightOJ1282 - Leading and Trailing (快速幂+高中数学)

 

 

#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#define LOCAL
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define PII pair<int, int>
#define PDI pair<double, int>
#define int long long
#define ll long long
#define ull unsigned long long
#define eps 1e-6
#define MOD 1000000007
#define debug(a) cout << #a << "=" << a << endl;
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof (x))
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;


int qmi(int a, int k, int p) {
    int res = 1;
    while (k) {
        if (k & 1)
            res = res * a % p;
        k >>= 1;
        a = a * a % p;
    }
    return res;
}
signed main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#endif
    // IOS;
    int T;
    scanf("%lld", &T);
    for (int i = 1; i <= T; ++i) {
        int n, k;
        scanf("%lld%lld", &n, &k);
        double fl = fmod(k * log10(n), 1);
        int head = (int)(pow(10, fl) * 100);
        printf("Case %d: %03lld %03lld\n", i, head, qmi(n, k, 1000));
    }
}