uva 11029(数学)

/**************************************************
* Author     : xiaohao Z
* Blog     : http://www.cnblogs.com/shu-xiaohao/ * Last modified : 2014-03-28 22:01
* Filename     : uva_11029.cpp
* Description     :
* ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
ll ta, tb;

ll a_b_MOD_c(ll a, ll b, ll c)
{
if(b==1) return a%c;
ll temp = a_b_MOD_c(a, b/2, c);
if(b%2 == 1) return (temp*temp*a)%c;
else return (temp*temp)%c;
}

int main()
{
//    freopen("in.txt", "r", stdin);

int T;
cin >> T;
while(T--){
cin >> ta >> tb;
double ansa = 100*pow(10, fmod(tb*log10(ta), 1));
cout << (int)ansa;
int ansb = a_b_MOD_c(ta, tb, 1000);
printf("...%03d\n", ansb);
}
return 0;
}