URD - Urdhva - Tiryag Bhyam
Given two large digit numbers find there product.
1st line contain number of test cases T. Each of which followed by two numbers N1 and N2 (these are strings).
1<=T<=10^5, 1<=|N1|<=1000 & 1<=|N2|<=1000
or each test case print product of these two numbers in separate line with no leading zero values.
Input:2 6 9 9 2Output:54 18
I agree with sas1905: tutorial
Should be moved to tutorial..!!
I think few languages were banned after people made solutions in them
Don't use BigInteger (java) or any other this type of things just try to make an algo.
Sorry for wrong output file. plz resubmit your solution.