本文主要是介绍Codeforces 742A Arpa’s hard exam and Mehrdad’s naive cheat，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.
Mehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given n, print the last digit of 1378n.
Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.
The single line of input contains one integer n (0 ≤ n ≤ 109).
Print single integer — the last digit of 1378n.
1
8
2
4
In the first example, last digit of 13781 = 1378 is 8.
In the second example, last digit of 13782 = 1378·1378 = 1898884 is 4.
题意：
看提示其实很简单的昂，就是输出 8^n 的个位数字。
思路：
有经验的就知道肯定是有规律的！快速幂没看。
AC CODE：
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define HardBoy main()
#define ForMyLove return 0;
using namespace std;
const int MYDD = 1103;int HardBoy {int n;scanf("%d", &n);if(n == 0) puts("1");else {if(n % 4 == 1) puts("8");else if(n % 4 == 2) puts("4");else if(n % 4 == 3) puts("2");else if(n%4 == 0) puts("6");}ForMyLove//GOOD NIGHT MY FRIENDS
}
这篇关于Codeforces 742A Arpa’s hard exam and Mehrdad’s naive cheat的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
