E - Arpa’s hard exam and Mehrdad’s naive cheat
Codeforces Round #383 (Div. 2)
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.
Input
The single line of input contains one integer n (0 ≤ n ≤ 109
).
Output
Print single integer — the last digit of 1378n
.
Example
Input
1
Output
8
Input
2
Output
4
Note
In the first example, last digit of 13781 = 1378 is 8.
In the second example, last digit of 13782 = 1378·1378 = 1898884 is 4.
题意：求1378的n次幂的尾数
解法：尾数有周期，找规律即可
代码：
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n==0)
cout<<1<<endl;
else if(n%4==1)
cout<<8<<endl;
else if(n%4==2)
cout<<4<<endl;
else if(n%4==3)
cout<<2<<endl;
else if(n%4==0)
cout<<6<<endl;
return 0;
}
