uva11029

　　　　　　　　　　　　Leading and Trailing

Apart from the novice programmers, all others know that you can’t exactly represent numbers raised
to some high power. For example, the C function pow(125456, 455) can be represented in double data
type format, but you won’t get all the digits of the result. However we can get at least some satisfaction
if we could know few of the leading and trailing digits. This is the requirement of this problem.

Input
The first line of input will be an integer T < 1001, where T represents the number of test cases. Each
of the next T lines contains two positive integers, n and k. n will fit in 32 bit integer and k will be less
than 10000001.

Output
For each line of input there will be one line of output. It will be of the format LLL . . . T T T, where
LLL represents the first three digits of n
k and T T T represents the last three digits of n，k. You areassured that n，k will contain at least 6 digits.

Sample Input
2
123456 1
123456 2

Sample Output
123...456
152...936

题意：给n，k；求n的k次方的前三位和后三位

tip：后三位取余%1000，前三位这样：如x=123456=1.23456*10^5，则 log10（x）=log10(1.23456)+5 ; log10(1.23456)=y; 10^y=1.23456 

　　前三位即是10^y*100;注意后三位可能在前面有0的存在。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long

using namespace std;

/*ll power1(ll a,ll b)
{
    int ans=a;
    for(int i=1;i<b;i++)
        ans=ans*a%1000;
    return ans%1000;
}*/
ll power1(ll a,ll n)  ///二分pow
{
    ll ans=1;
    while(n)
    {
        if(n&1) ///为奇
            ans=ans*a%1000;
        a=a*a%1000;
        n/=2;
    }
    return ans%1000;
}

ll power2(ll a,ll b)
{
    ll p,q,ans;
    double f=b*log10(a);
    q=(ll)f;///整数部分
    p=(ll)(f*10000000)-q*10000000;///小数部分*10000000
    double x=1.0*p/10000000;
    ans=(ll)(pow(10,x)*100);
    return ans;
}

int main()
{
    ll n,k;
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;
        ll p=power2(n,k),q=power1(n,k);
        printf("%lld...%03lld
",p,q);
    }
    return 0;
}