Rightmost Digit ---HDU1061

本文介绍了一种使用快速幂算法解决特定数学问题的方法:给定正整数N,输出N^N的最右一位数字。通过快速幂算法实现高效计算,并提供了完整的C++代码示例。

Rightmost Digit

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


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
234
 

Sample Output
76
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>
#include <bits/stdc++.h>

using namespace std;
//快速幂
long long f(long long a,long long b)
{
   long k=1;
   a%=10;
   while(b)
   {
      if(b%2==1)
      k=(k*a)%10;
      b/=2;
      a=(a*a)%10;
   }
   return k;
}
int main()
{
    long long t,x;
    cin>>t;
    while(t--)
    {
        scanf("%lld",&x);
        printf("%lld\n",f(x,x));
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值