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
hide comments
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?
|
|
Alex Anderson:
2012-09-14 17:36:48
0^0 is treated as being 1, though it really is an undefined expression.
|
|
numerix:
2012-09-14 17:36:48
@Devansh: Depends on the language you use ... |
|
!nvincible:
2012-09-14 17:36:48
wants to know if spoj accepts "continue"? |
|
The Financier:
2012-09-14 17:36:48
Why whitespaces are also calculated ? =\ |
|
~neo~:
2012-09-14 17:36:48
got it,thanks... |
|
~neo~:
2012-09-14 17:36:48
what will be answer for a=0 , b=0
|
|
Taras Brzezinsky:
2012-09-14 17:36:48
0^0 can mean 10^0, 'cause 10=0 mod 10
|
|
Jürgen Boger:
2012-09-14 17:36:48
Hey, i got several runtime exceptions (NZEC) in my C# code. Afterward i figured out, that SPOJ doesn't know the "continue" command. After placing some brackets, so that my code works without "continue", i got AC. |
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 |