Submit | All submissions | Best solutions | Back to list |
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
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 |
hide comments
|
||||||||||||||
2016-06-02 15:10:47
spoj is giving error while submitting as it says that the solution takes more than 700 bytes , what to do :/ |
||||||||||||||
2016-05-30 14:46:39
It says 0 <= b and a so they can be equal. |
||||||||||||||
2016-05-25 23:00:34
awesome one... must solve....accepted in first go |
||||||||||||||
2016-05-18 11:41:08
https://crypto.stanford.edu/pbc/notes/numbertheory/exp.html Best explanation of Modular Exponentiation :). Recursion with base case (b==0) Last edit: 2016-05-18 11:41:39 |
||||||||||||||
2016-05-17 14:35:53
learnt a new technique modular exponentiation |
||||||||||||||
2016-05-06 18:32:19
ac in one go number theory rocks :) |
||||||||||||||
2016-03-28 21:35:22
It can be solved by quaternary numeral system ? |
||||||||||||||
2016-03-25 14:25:36
check for 12 2351357 if using fast modular exponentiation Last edit: 2016-03-25 14:26:08 |
||||||||||||||
2016-03-23 10:48:29
b can be 0 please edit!!! |
||||||||||||||
2016-03-20 19:52:35
watch out when b(power) = 0 |