LASTDIG2 - The last digit re-visited
Pappu 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 two numbers a and b. The problem consist in find the last digit of the potency of base a and index b. Help Pappu with his problem. You are given two integer numbers: the base a (number of digits d, such that 1 <= d <= 1000) and the index b (0 <= b <= 922*10^15). You have to find the last digit of a^b.
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.
For each test case output an integer per line representing the result.
Input: 3 3 10 6 2 150 53 Output: 9 6 0
Source limit is 700 Bytes.
variable (string) which stores the base has to have length longer than 101, this has cost me 2WA. Also, exponent easily fits into long long unsigned.
Thanks @Abhinandan Agarwal !!
finally AC :) thank you @abhinandan and @thramas
long long doesnt work
Test the following test case :
Read the problem very carefully. The base can have upto 1000 digits (might be interpreted differently) and the exponent will fit into long long. AC!
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
warning: there are '\r' character in the input data!