1061 Rightmost Digit

最新推荐文章于 2024-06-15 18:06:06 发布

skylar_

最新推荐文章于 2024-06-15 18:06:06 发布

阅读量334

点赞数

分类专栏： c++ 文章标签： c++ 杭电ACM c

本文链接：https://blog.csdn.net/u011329762/article/details/37564875

版权

c++ 同时被 2 个专栏收录

286 篇文章 1 订阅

订阅专栏

杭电ACM

103 篇文章 0 订阅

订阅专栏

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 31055 Accepted Submission(s): 11826

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.

//周期为20

#include<iostream>
using namespace std;

int main()
{
    int n,m,num[21]={0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9,0};
    cin>>n;
    while(n--)
    {
        cin>>m;
        cout<<num[m%20]<<endl;
    }
}