HDU 1061 Rightmost Digit 数论

代码是在网上找的模版,第一次做是想找规律的可是实在是太繁琐勒(其实是我懒= =! ),就上网看看有没有更简单的方法,才知道这样的题有模版,就是快速幂取模.

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

    
    

     
     2
3
4
    
    

 

Sample Output

    
    

     
     7
6

    
    
    
    


    
    
    
    


    
    
    
    


    
    
    
    

     
     
#include<stdio.h>
#include<string.h>
long long pow_mod(long long a,long long p,int n)
{
    if(p==0)
        return 1;
    long long ans = pow_mod(a,p/2,n);
     ans = ans *ans %n;
    if(p%2==1)
        ans =ans *a%n;
    return ans;
}
int main()
{
    int t;
    long long a,s;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld",&a);
         s=pow_mod(a,a,10);
         printf("%lld\n",s);
    }
    return 0;
}