Codeforces Round #383 (Div. 2) A. Arpa’s hard exam and Mehrdad’s naive cheat（水题）

A. Arpa’s hard exam and Mehrdad’s naive cheat
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
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次方的最后一位数。
思路：手动打个表发现末尾数的四个一循环，特判一下0就可以了。

代码

#include<math.h>
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int N;
    scanf("%d",&N);
    if(N==0)
        printf("1\n");
    else if(N%4==0)
        printf("6\n");
    else if(N%4==3)
        printf("2\n");
    else if(N%4==2)
        printf("4\n");
    else if(N%4==1)
        printf("8\n");
    return 0;
}