1097A hard puzzle

最新推荐文章于 2021-04-01 22:58:00 发布

zxiaopp

最新推荐文章于 2021-04-01 22:58:00 发布

阅读量390

点赞数

分类专栏： HDOJ

本文链接：https://blog.csdn.net/zxiaopp/article/details/45231419

版权

HDOJ 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

A hard puzzle

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33321 Accepted Submission(s): 11924

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

Sample Output

9
6

我有我的笨方法~~

#include <iostream>
#include<cstdio>
using namespace std;
int a1[10][10]={{0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}};
int main()
{
    int a,b;
    while(scanf("%d%d",&a,&b)!=EOF)
    {
        while(a>=10)
        {
            a=a%10;
        }
        int x;
        if(a==0) printf("0\n");
        if(a==1) printf("1\n");
        if(a==2)
        {
            x=b%4;
            printf("%d\n",a1[2][x]);
        }
        if(a==4)
        {
            x=b%2;
            printf("%d\n",a1[4][x]);
        }

         if(a==3)
         {
            x=b%4;
            printf("%d\n",a1[3][x]);
         }
          if(a==5)
          {

            printf("5\n");
          }
           if(a==6)
            {

            printf("6\n");
           }

           if(a==7)
            {
            x=b%4;
            printf("%d\n",a1[7][x]);
            }
        if(a==8)
        {
            x=b%4;
            printf("%d\n",a1[8][x]);
        }

       if(a==9)
        {
            x=b%2;
            printf("%d\n",a1[9][x]);
        }

    }
    return 0;
}