这道题就A^B的最后三位数,一种是普通方法,另外一种就是快速幂了,快速幂这个东东吧,久了不打会忘,代码不多,多看看就能理解了。
拓展,假如求前三位数呢?留到最后说吧…
快速幂理解推荐:https://www.cnblogs.com/CXCXCXC/p/4641812.html
讲的很透侧了!!!
下面见代码:总喜欢把常用的头文件等加上…
法一:普通方法
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
#define ll long long
//sort(a,a+n);memset(a,0,sizeof(a))
int main(){
int a,b;
while(scanf("%d%d",&a,&b)){
int k = 1;
if(a==0 &&b ==0){
break;
}
for(int i=1;i<=b;i++){
k*=a;
k%=1000;
}
printf("%d\n",k);
}
return 0;
}
法二:快速幂
/*
* title:hdu2035 人见人爱 快速幂
* date:2019-03-05
* auther:Wu zongyuan
*/
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
int main(){
int a,b;
while(scanf("%d%d",&a,&b)&&a&&b){
//
int ans = 1; //注意初始化别弄反了
int base = a;
while(b){
if(b&1)
ans = ans*base%1000; //求最后三位
base = base*base%1000;
b >>= 1;
}
printf("%d\n",ans);
}
return 0;
}
拓展:
因为题目网站要注册登录,所以就没有附上链接
题目:Leading and Trailing
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 of test cases.
Each case starts with a line containing two integers: n (2 ≤ n < 231) and k (1 ≤ k ≤ 107).
Output
For each case, print the case number and the three leading digits (most significant) and three trailing digits (least significant). You can assume that the input is given such that nk contains at least six digits.
Sample Input
5
123456 1
123456 2
2 31
2 32
29 8751919
Sample Output
Case 1: 123 456
Case 2: 152 936
Case 3: 214 648
Case 4: 429 296
Case 5: 665 669
这道题就是在上面题的基础上把数据扩大了,还让求前三位
用了个modf函数,有点小巧妙,我就不贴代码了,给大家思考吧!0.0
以上有错还望指正!