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
|
||||||||||||||
2014-11-01 01:45:22 Tasya Aditya Rukmana
why can't I change the language to python?.. it's always submitted as ADA |
||||||||||||||
2014-10-27 18:25:35 Aman Jain
Don't forget to check num^0 condition! Got AC in 2nd try :) |
||||||||||||||
2014-10-15 08:38:05 Diksha Jaiswal
weak test cases...my code gave output 0 for 1 100 0 bt still accepted...:p |
||||||||||||||
2014-10-09 19:11:06 Lehar
My code which gives 9 as the answer for 150^53 gets accepted and the one which gives the correct ans 0 doesn't. Very strange. |
||||||||||||||
2014-09-30 21:56:56 मयंक
"a and b both are not 0" => "Wrong Statememnt". Cost me a few WA. |
||||||||||||||
2014-09-29 11:12:26 Sba Baranwal
working for every test case including comment ones but still WA from spoj??? |
||||||||||||||
2014-09-25 11:38:49 Manraj Singh
Python ftw. AC in one go. Thanks @GTM |
||||||||||||||
2014-09-23 08:59:05 Lalit Kumar
"a and b both are not 0" don't believe it..cost me many wrong ans |
||||||||||||||
2014-09-12 18:27:03 Shail Shah
AC in 1st go :) Very simple. Need to take care of space optimization :P ;) |
||||||||||||||
2014-09-03 14:55:21 Gautam Kumar
Nice Problem. @Prashant Kumar Check for following:- 9 0 o/p 1 3 0 o/p 1 0 0 o/p 1 9 4 o/p 1 2 4 o/p 6 |