Given two numbers represented as strings a and b, compute their product and output product as a string.
|a| <=1e6, |b|<=1e6
How do I solve it, I brute forced it and it gives me TLE.
can anyone help me? is there an optimal way ?
Help me with this easy multiplication problem
Given two numbers represented as strings a and b, compute their product and output product as a string.
|a| <=1e6, |b|<=1e6
How do I solve it, I brute forced it and it gives me TLE.
can anyone help me? is there an optimal way ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
StellarSpecter | 2024-09-06 23:42:39 | 1 | Tiny change: 'imal way ?' -> 'imal way ??' | |
en1 |
![]() |
StellarSpecter | 2024-09-06 14:44:47 | 287 | Initial revision (published) |