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 ??
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2024 10:51:37 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
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
What is FFT can anyone explain or is this a bluff and the problem is unsolvable ?
Auto comment: topic has been updated by StellarSpecter (previous revision, new revision, compare).