快速幂

最新推荐文章于 2025-04-13 23:00:00 发布

PrinceLJ

最新推荐文章于 2025-04-13 23:00:00 发布

阅读量120

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/liujing123456ko/article/details/80060135

快速幂专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种高效算法，用于计算给定正整数N的N^N形式下的最右侧数字。该算法通过快速幂运算实现，避免了直接计算N^N带来的巨大数值问题，适用于N值范围在1到1,000,000,000之间的场景。

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

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>
#include<algorithm>
#include<iostream>
#include<math.h>
using namespace std;
const long long  mod=1000000000;
long long kuaisu(long long a,long long mod)
{
    long long res=1,b=a;
    while(b>0)
    {
        if(b&1)
            res=res*a%mod;
        b=b>>1;
        a=a*a%mod;

    }
    return res;
}

int main()
{
    int T;
    long long N;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld",&N);
        int i;
        long long c=kuaisu(N,mod);
        printf("%d\n",c%10);
    }
}

转载https://www.cnblogs.com/lca1826/p/6748372.html