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.


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.


For each test case output an integer per line representing the result.


3 10
6 2

Output: 9 6

hide comments
Loki: 2012-09-14 17:36:48

Last edit: 2011-10-13 03:59:51
Arvind: 2012-09-14 17:36:48

nice prob..

hammad awan: 2012-09-14 17:36:48

can i get your email adress Numerix?????

Boopathi Rajaa: 2012-09-14 17:36:48

try these
9 0
0 9
0 0

kusum : 2012-09-14 17:36:48

can someone please post some strong test cases...I keep getting WA

Robin Lee: 2012-09-14 17:36:48

Note: "Last digit of potency" seems to be incorrect, i.e. LDoP of (20^2=400) is 0, not 4.

Last edit: 2011-06-03 16:57:57
saurabh kumar jha: 2012-09-14 17:36:48

is 0 00000 a valid input???

Avinash: 2012-09-14 17:36:48

Can i use scanf and cout both simultaneously with g++ 4.0.0-8 compiler?
i also use <stdio.h> and <iostream.h>

Ruslan Batyrov K-Kiya: 2012-09-14 17:36:48


Last edit: 2011-03-14 13:26:43
Ruslan Batyrov K-Kiya: 2012-09-14 17:36:48


Last edit: 2011-03-14 13:26:53

Added by:Jose Daniel Rodriguez Morales
Time limit:1s
Source limit:700B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: GOSU