Hdu oj 1061 Rightmost Digit

最新推荐文章于 2018-12-19 12:03:45 发布

zm_11

最新推荐文章于 2018-12-19 12:03:45 发布

阅读量455

点赞数

CC 4.0 BY-SA版权

分类专栏：快速幂取模算法

本文链接：https://blog.youkuaiyun.com/zm_11/article/details/48580099

快速幂取模算法专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一个算法问题：给定正整数N，如何找出N^N的最右侧数字。通过示例说明了求解过程，并提供了一段使用C语言实现的代码示例。

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

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.

题目地址： 点击打开链接

AC代码：

#include<stdio.h>
int a,b,c;
void qmod(int a,int b)
{
	c=1;
	a=a%10;
	while(b>0)
	{
		if(b%2==1)
		   c=(c*a)%10;
		b=b/2;
		a=(a*a)%10;
	}
	
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&a);
		qmod(a,a);
		printf("%d\n",c);
	}
	return 0;
}