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

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

hide comments
2014-08-26 16:03:51 Prashant Kumar
it is working for every case i checked but giving WA by spoj
<snip>

Last edit: 2023-06-12 22:46:54
2014-08-16 20:59:45 rituraj
Finally Finally Finally Got AC so happy :)
2014-08-16 19:21:58 Murat TOPAK
The one I've coded for LASTDIG2 in Python3 doesn't work here, giving me WA. Really interesting.
2014-08-15 20:55:56 Arun Vinud
Sample test cases:
13 11 ---->7
0 0 ---->1
1 0 ---->1

Very easy :)
2014-08-15 18:58:18 eightnoteight
excellent problem!!!!!!
2014-08-03 20:51:13 mohsin mohammad
Not including pow(x,0) gave to wrong answers but finally accepted......
2014-08-02 13:15:12 Rounaq Jhunjhunu Wala
O(1) with 696B file in 0.00 sec. Voila!
2014-07-23 21:03:29 Sumit Kumar Rakshit
if u r using modular exponentiation method, no need of special condtion check like 0^0 or 0^1..
2014-07-13 07:40:37 chin
done at 300B..
2014-07-07 11:43:30 gaurav
don't forget the case pow(x,0) and the limit 700 bytes
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.