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 ??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
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) |
Name |
---|