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 | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | cry | 161 |
3 | maomao90 | 160 |
4 | atcoder_official | 156 |
4 | -is-this-fft- | 156 |
6 | nor | 155 |
7 | maroonrk | 153 |
7 | adamant | 153 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
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 ?
Name |
---|
impossible
-is-this-fft-
So we have $$$10^{10^6} \cdot 10^{10^6} = 10^{2000000}$$$ , bro go create some new structure for such numbers
output product as a string
I have a n^2 solution but it also gives a TLE under these constraints. can you send the problem link?
Using FFT it can be solved in O(nlogn), n = max ( | a | , | b | ).
Check this out
thanks but what is fft