A hard puzzle

最新推荐文章于 2020-10-20 20:22:47 发布

wys5

最新推荐文章于 2020-10-20 20:22:47 发布

阅读量186

点赞数 1

分类专栏： HDU

本文链接：https://blog.csdn.net/wys5wys/article/details/97525340

版权

HDU 专栏收录该内容

54 篇文章 0 订阅

订阅专栏

Problem Description

lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.
this puzzle describes that: gave a and b,how to know the a^b's the last digit number.But everybody is too lazy to slove this problem,so they remit to you who is wise.

Input

There are mutiple test cases. Each test cases consists of two numbers a and b(0<a,b<=2^30)

Output

For each test case, you should output the a^b's last digit number.

Sample Input

7 66
8 800

Sample Output

9
6

分析：求a^b的最后一位数。找到循环节然后分别对应输出即可。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

int main(){
    int a,b;
    while(cin>>a>>b){
        a%=10;
        if(a==0||a==1||a==5||a==6)cout<<a<<endl;
        if(a==2){
            if(b%4==0)cout<<6<<endl;
            if(b%4==1)cout<<2<<endl;
            if(b%4==2)cout<<4<<endl;
            if(b%4==3)cout<<8<<endl;
        }
        if(a==3){
            if(b%4==0)cout<<1<<endl;
            if(b%4==1)cout<<3<<endl;
            if(b%4==2)cout<<9<<endl;
            if(b%4==3)cout<<7<<endl;
        }    
        if(a==4){
            if(b%2==0)cout<<6<<endl;
            if(b%2==1)cout<<4<<endl;
        }
        if(a==7){
            if(b%4==0)cout<<1<<endl;
            if(b%4==1)cout<<7<<endl;
            if(b%4==2)cout<<9<<endl;
            if(b%4==3)cout<<3<<endl;
        }
        if(a==8){
            if(b%4==0)cout<<6<<endl;
            if(b%4==1)cout<<8<<endl;
            if(b%4==2)cout<<4<<endl;
            if(b%4==3)cout<<2<<endl;
        }
        if(a==9){
            if(b%2==0)cout<<1<<endl;
            if(b%2==1)cout<<9<<endl;
        }
        
    }
    return 0;
}