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
Arjun Verma:
2013-06-10 01:10:51
getting WA !
|
|
Sharan Girdhani:
2013-06-07 18:58:13
Can anybody tell me a wrong test case in my code in C ??
|
|
Erti-Chris Eelmaa:
2013-05-28 15:31:43
700 bytes limit is silly. Modular exponentiation ftw. |
|
ankita:
2013-05-14 16:35:12
what is SIGSEV? |
|
(Tjandra Satria Gunawan)(曾毅昆):
2013-04-11 16:50:45
My brainf**k code got AC in first attempt ;-) |
|
Sivaraman Nagarajan:
2013-02-24 16:26:44
Could be moved to tutorial |
|
Adhityaa:
2013-02-04 10:41:56
What's 0^0 ? |
|
kamalesh:
2012-12-08 04:45:27
0^1 is 0 and 1^0 is 1 and 0^0 is 1 which caused 2 WA's for me |
|
Adam D:
2012-12-07 20:47:37
anyone could help in <snip>
|
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 |