hdu_1061_Rightmost Digit_求n^n的个位数

最新推荐文章于 2023-10-19 23:58:30 发布

原创最新推荐文章于 2023-10-19 23:58:30 发布 · 800 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #output #input #each #算法

本文介绍了一种高效算法，用于求解正整数N的N次方结果中最右侧的数字。该算法通过取模运算优化计算过程，并使用循环结构减少不必要的计算量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

算法对了就a了,很水.

http://acm.hdu.edu.cn/showproblem.php?pid=1061

Rightmost Digit

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

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.

  #include<iostream>
using namespace std;
int main()
{
    int i,p,outn,inn,temp,times;
    cin>>i;
    while(i--)
    {
        cin>>inn;
        outn=inn%10;
        temp=outn;
        times=(inn-1)%4;
        for(p=1;p<=times;p++)
        {
            outn=(outn*temp)%10;
        }
        cout<<outn<<endl;
    }
    return 0;
}