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
swap:
2015-04-01 06:09:48
Modular Exponentiation AC :) |
|
partybuoy:
2015-03-24 12:39:39
Question has an error. It is written a and b are not 0 but input can be 0 for either. |
|
eightnoteight:
2015-03-08 11:41:13
@simon
|
|
devanshukoyalkar:
2015-03-06 23:27:31
if possible please change the 700B size limit.....its ridiculous.
|
|
Novice Whistler:
2015-02-03 14:47:00
Note that the power/base can be 0
|
|
Abhishek Naik:
2015-01-31 19:51:20
Tried all the test cases, but still WA! Tried 10 times already! :'( |
|
Simon:
2015-01-22 07:46:38
why do we have to write under 700 Bytes -.- |
|
Simon:
2015-01-22 07:44:05
How do we check the source limit of our code? |
|
Phạm Bãng Bãng:
2015-01-12 14:03:36
haha 700 Kb. This problem is very funny. I like it. |
|
Mitch Schwartz:
2015-01-03 16:41:28
Maybe you weren't emitting enough positive energy when clicking the Submit button. |
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 |