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
samyak_maximus:
20200627 12:34:31
by using binary exponentiation answer is obtained in my system ide but online judge is claiming that its a wrong answer. Kindly anyone help me through it _/\_ 

agrawaladitya:
20200610 14:39:44
Turns out "a and b both are not 0" means that both are not simultaneously zero but can be individually zero 

achin1tya_1977:
20200609 08:48:34
700 Bytes how to resolve ?


samarthbtp1234:
20200604 01:14:59
i cant find any mistake in my code pls hlp


devesh_rs:
20200530 05:45:25
stupid endl !! 

amish1999:
20200518 15:00:57
Here we only need to calculate (a^b)mod 10 with the help of modular exponentiation. Last edit: 20200518 15:05:57 

avi_kumar15:
20200517 19:37:34
700B lol 

elucidase:
20200517 14:18:37
Euclid theorem gives cycle 4 for coprime numbers; others you can check, also with period 4. 

meher_24:
20200510 22:26:45
this little judge doesnt like pow function guys.Nothing is wrong with ur code people. 

amar_shukla1:
20200508 12:15:31
easy problem

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 