Leading and Trailing LightOJ - 1282

关注

原创最新推荐文章于 2019-07-22 21:56:00 发布 136 阅读 AI 写同款· GEO 优化 ›

Leading and Trailing LightOJ - 1282 （n^k 的前三个数） You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.Input Input starts with an integer T (≤ 1000), denoting the number 阅读详情

求n^k的前三位和后三位

后三位快速幂即可得到
对于前三位
1. a.bc * 10^t = n^k
2. log_{10}{a.bc} + t = klog_{10|{n}
3. 所以log_{10}{a.bc} 是klog_{10|{n}的小数部分
4. a.bc = 1000 * klog_{10|{n} 的整数部分

 #include<bits/stdc++.h>
 using namespace std;
 #define fst first
 #define sec second
 #define sci(num) scanf("%d",&num)
 #define scl(num) scanf("%lld",&num)
 #define mem(a,b) memset(a,b,sizeof a)
 #define cpy(a,b) memcopy(a,b,sizeof b)
 typedef long long LL;
 typedef pair<int,int> P;
 const int MAX_N = 510;
 const int MAX_M = 10000;
 int mpow(int a,int n,int mod) {
     int ans = 1;
     while (n) {
         if (n & 1) ans = ans * a % mod;
         a = a * a % mod;
         n >>= 1;
     }
     return ans;
 }
 int main() {
     int T;
     cin >> T;
     for (int cs =1; cs <= T;cs++) {
         LL N,K;
         cin >> N >> K;
         double x =  K* log10(N) -(LL) (K* log10(N));
         //cout <<  pow(10,x) << endl;
         LL ans1 = 100 * pow(10,x);
         LL ans2 =mpow(N % 1000,K,1000);
         cout << "Case " << cs << ": ";
         printf("%lld %03lld\n",ans1,ans2);
     }
     return 0;
 }