hdu 1097 A hard puzzle

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

von_troy

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

阅读量610

点赞数 1

分类专栏：数学题文章标签： output numbers each input bt

本文链接：https://blog.csdn.net/von_troy/article/details/5989026

版权

数学题专栏收录该内容

3 篇文章 0 订阅

订阅专栏

A hard puzzle

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

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 main()
{
    long long a, b;
    int ans[5];
    while(cin >> a >> b)
    {
        if( b == 0 )
        {
            cout << "1" << endl;
            continue;
        }
        else if( a == 0 )
        {
            cout << "0" << endl;
            continue;
        }
        ans[1] = a % 10;
        ans[2] = (ans[1] * a ) % 10;
        ans[3] = (ans[2] * a ) % 10;
        ans[4] = (ans[3] * a ) % 10;

        int tmp = b % 4;
        if( tmp == 0 ) tmp = 4;
        cout << ans[tmp] << endl;
    }
    return 0;
}