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 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
hide comments
probeta:
20180830 11:17:58
Don't use ifelse since there is size limit , simply use modular expo ! 

rahul_gera:
20180729 20:38:33
guys include the case side cases a,b=0 

sktspoj:
20180726 20:38:12
guys, just check the corner cases such as 10^0 = 1 , 10^1 = 0, 0^10 = 0 if you are getting wa


rajat_123:
20180717 14:43:33
Last edit: 20180717 14:54:26 

techlicious_:
20180616 23:27:38


abhinav_313:
20180616 21:10:02
how to input multiple strings separated by space.Please help


s_a_k_s_h_a_m:
20180612 12:35:21
use long long and fast modular exponentation for (a^b)%10 

navidator:
20180531 00:31:37
If you get WA and you use modular arithmetic, there could be some issues:


adnanlari:
20180528 22:20:51
giving WA, even after considering all the cases!! 

neverhopeless:
20180420 12:26:36
@narutohokage_1, thanks for the pointer. 
Added by:  Jose Daniel Rodriguez Morales 
Date:  20081201 
Time limit:  1s 
Source limit:  700B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: GOSU 
Resource:  Own 