LASTDIG - The last digit
Nestor was doing the work of his math class about three days but he is tired of make operations a lot and he should deliver his task tomorrow. His math’s teacher gives him two numbers a and b. The problem consist of finding the last digit of the potency of base a and index b. Help Nestor with his problem. You are given two integer numbers: the base a (0 <= a <= 20) and the index b (0 <= b <= 2,147,483,000), a and b both are not 0. You have to find the last digit of ab.
Input
The first line of input contains an integer t, the number of test cases (t <= 30). t test cases follow. For each test case will appear a and b separated by space.
Output
For each test case output an integer per line representing the result.
Example
Input: 2 3 10 6 2
Output: 9 6
hide comments
adarsh313:
2019-01-06 10:43:39
AC in 2nd attempt |
|
harshit_k007:
2018-12-27 14:36:19
yes AC in 3 attempts...plse check case for b=0 , it costed me 2 WA!! |
|
tarun_nanduri:
2018-12-22 18:52:43
why size limit of 700 bytes
|
|
Daniel Papp:
2018-12-22 01:51:07
700 byte source code limit? Who came up with this really? |
|
chinmay_sharma:
2018-12-08 18:16:13
again and again giving wrong answer here but on code blocks my code is giving correct answer for all nearly all possible cases
|
|
yaseenmollik:
2018-12-05 19:03:07
Just use Modular Exponentiation |
|
deepak022:
2018-10-28 12:29:03
solved 15 from 15 needed problems :) |
|
jareehd:
2018-10-11 18:04:12
my 15th yo |
|
dharmendrak:
2018-10-02 11:09:54
what will be the output in case of 0 to the power 0 and 0 to the power 1. |
|
n1trob4ct3r:
2018-09-24 15:50:01
I don't get it. Why isn't the answer (a^b)%10 ? |
Added by: | Jose Daniel Rodriguez Morales |
Date: | 2008-12-01 |
Time limit: | 1s |
Source limit: | 700B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: GOSU |
Resource: | Own |