快速幂

最新推荐文章于 2024-05-21 23:34:41 发布

Annmike

最新推荐文章于 2024-05-21 23:34:41 发布

阅读量212

点赞数

分类专栏：快速幂文章标签：快速幂

本文链接：https://blog.csdn.net/annmike/article/details/78755763

版权

快速幂专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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

2
3
4

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.

#include<stdio.h>
long long int pow(long long int a,long long int b){
    long long int ans=1;
    for(;b>0;b/=2){
        if(b%2==1)
        ans=(ans*a)%10;
         a=a*a%10;

    }
         return ans;

}
int main(){
   long long  int x,y;
    long long int n;
    scanf("%lld",&n);
        while(n--){
        scanf("%lld",&x);
        y=pow(x,x);
        printf("%lld\n",y);

    }
　　　　return 0;

 }