【快速幂取模】HDU1061 Rightmost Digit

最新推荐文章于 2019-04-28 09:34:29 发布

wlxsq

最新推荐文章于 2019-04-28 09:34:29 发布

阅读量446

点赞数

本文链接：https://blog.csdn.net/wlxsq/article/details/50913129

版权

数论专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Problem Description

Given a positive integer N, you should output the most right digit of N^N.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000).

Output

For each test case, you should output the rightmost digit of N^N.

Sample Input

Sample Output

  
  
   
   7
6


   
   
    
    
     
     Hint
    
    
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.

AC代码1：快速幂取模模板

#include<iostream>
#define LL long long
using namespace std;
LL n;
LL mod_exp(LL a,LL b,LL mod)
{
    LL res=1;
    while(b){
        if(b&1) res=res*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return res;
}
int main()
{
    int m;
    cin>>m;
    while(m--){
        cin>>n;
        cout<<mod_exp(n,n,10)<<endl;
    }
    return 0;
}

AC代码2：找规律；因为只求最后一位的结果，所以我们只要看n的最后一位就可以；

#include<iostream>
using namespace std;
int main()
{
  int n;
  cin>>n;
  while(n--)
  {
    int t;
    cin>>t;
    int lastdigitnum=t%10;
    if(t%4==0){
      for(int i=1;i<4;i++){
        lastdigitnum=(t%10*lastdigitnum)%10;
      }
    }else{
      for(int i=1;i<t%4;i++){
        lastdigitnum=(t%10*lastdigitnum)%10;
      }
    }
    cout<<lastdigitnum<<endl;
  }
  return 0;
}