Submit | All submissions | Best solutions | Back to list |
URD - Urdhva - Tiryag Bhyam |
Given two large digit numbers find their product.
Input
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
Output
For each test case print product of these two numbers in separate line with no leading zero values.
Example
Input: 2 6 9 9 2 Output: 54 18
Added by: | junior_g |
Date: | 2017-06-14 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM32-GCC ASM64 BASH BC BF PYTHON PYPY PYTHON3 PY_NBC R SCALA SCM guile SCM qobi SED ST SWIFT VB.NET WHITESPACE |
hide comments
2019-12-25 07:55:02
weak test cases, got AC but my code outputs 12 * 0 = 00 |
|
2018-07-05 08:00:15
Are N1 and N2 is length of the string ?? |
|
2017-06-14 17:40:22
Should be moved to tutorial..!! |
|
2017-06-14 17:21:09 Vipul Srivastava
I think few languages were banned after people made solutions in them |
|
2017-06-14 17:13:38
Don't use BigInteger (java) or any other this type of things just try to make an algo. |
|
2017-06-14 14:03:56
Sorry for wrong output file. plz resubmit your solution. |
|
2017-06-14 09:44:02
submission id:19608934 Please check the solution..It follows all the constraints.. edit: Do you mean trailing zeroes rather than leading? Last edit: 2017-06-14 09:49:18 |