A^B(A的B次方)——人见人爱A^B，Rightmost Digit 。

写一个pow()函数计算A的B次方取余10，即求所得结果的个位数。

int pow(int a, int b)
{
  if(b==0)
    return 1;
  int half = (pow(a,b>>1))%10;
  if(b%2==0)
    return (half*half)%10;
  else
    return (half*half*a)%10;
}

可用于

Rightmost Digit

 

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int pow(int x, int n)
{
  if(n==0)
    return 1;
  int half = (pow(x,n>>1))%10;
  if(n%2==0)
    return (half*half)%10;
  else
    return (half*half*x)%10;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,p;
scanf("%d",&n);
p=n;
n=n%10;
if(n==0||n==1||n==5||n==6)
{
printf("%d\n",n);
continue;
}
int sum=(int)pow(n,p);
printf("%d\n",sum);
}
return 0;
}

修改下函数还可用于

人见人爱A^B

 

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int pow(int x, int n)
{
  if(n==0)
    return 1;
  int half = (pow(x,n>>1))%1000;
  if(n%2==0)
    return (half*half)%1000;
  else
    return (half*half*x)%1000;
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m),n||m)
{
n=n%1000;
int sum=pow(n,m);
printf("%d\n",sum);
}
return 0;
}