hdu 1097

A hard puzzle

#include<stdio.h>
int f(int a,int b)
{
    int c=1;
    a=a%10;
    while(b!=0){				//a^33==(a^32)*a
        if(b%2==1){
            c=c*a%10; 
        } 
        b=b/2; 
        a=a*a%10; 
    }
    return c;
}
int main()
{
    int a,b;
    while(scanf("%d%d",&a,&b)!=EOF){
        printf("%d\n",f(a,b));
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int f[10][10]={{1,0,0}/*0为底数时个位数集合*/, {1,1,1}/*1为底数所有个位数集合*/, 
			{1,2,4,6,8}/* 2 */, {1,3,9,7,1}/* 3 */, {1,4,6,4}/*4*/,{1,5,5}/*5*/,
			{1,6,6}, {1,7,9,3},{1,8,4,2,6,8},{1,9,1}};
				
int c[10] = {1,1,4,4,2,1,1,4,4,2};//每个个位数一个周期元素个数 
int s[10] = {1,0,1,0,1,1,1,0,1,0};//a表中每个组开始循环时的位数 eg：{1（0位），0（1位），0}

int main()
{
	int a,b;
	while(scanf("%d %d",&a, &b) == 2){
		a %= 10;
		b = b < s[a] ? b : (b-s[a])%c[a]+s[a];//减去不是周期内的第一个数
		printf("%d\n", f[a][b]);
	}
	return 0;
}