Sphere Online Judge

SPOJ Problem Set (classical)

3442. The last digit

Problem code: LASTDIG

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 two numbers a and b. The problem consist in find 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). You have to find the last digit of a^b.

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 Rdguez
Date:2008-12-01
Time limit:1s
Source limit:700B
Languages:All except: ERL TECS JS
Resource:Mine

hide comments
2009-12-14 23:28:24 Gagan Singhal
Finally solved it.!!Silly mistakes!!

Last edit: 2009-12-18 15:58:29
2009-10-25 06:42:21 Muhammad Ridowan
Or better you could lower the time limit, in which no Bigi can solve it. ;)
2009-08-10 16:38:34 Drew Saltarelli
you should limit the languages to only those that don't have built in arbitrary big numbers :D
2009-07-31 09:44:48 nthrgeek
No it's not,if know basic math

Last edit: 2009-08-04 13:09:32
2009-07-21 14:25:35 Sura
This problem is very challenging with Java lengthy programming ;)
2009-06-12 15:18:06 Ambuj Varshney
for 0^0 solution is 1 , need to add explicitly. Otherwise , judge will show Wrong Answer.
2009-05-22 21:38:11 **
The constraints is correct.

If a=0 & b=0 the result is undefined to avoid this the constraint a>0.

Last edit: 2009-08-04 13:09:50
2009-04-21 10:25:05 LeppyR64
a has incorrect constraints.
0 <= a < 20

Last edit: 2009-04-21 10:41:33
SPOJ System © 2008-2010 Sphere Research Labs. All Rights Reserved.