Timeline for Given a list of integers, how to find the smallest positive integer such that I can get all the integers in the process of dividing it by 2?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 7, 2020 at 8:24 | comment | added | maraca | @xskxzr yes right it should be do the following calculation d times not r times. | |
| Sep 7, 2020 at 8:24 | history | edited | maraca | CC BY-SA 4.0 |
edited body
|
| Sep 5, 2020 at 1:01 | comment | added | xskxzr | What is d? Your algorithm computes d but never uses it. | |
| Sep 4, 2020 at 14:52 | comment | added | maraca | This seems to be a partial solution only, because it doesn't consider how many times a number must appear in the tree, only if it is possible to build the number. | |
| Sep 4, 2020 at 14:48 | history | edited | maraca | CC BY-SA 4.0 |
added 59 characters in body
|
| Sep 4, 2020 at 14:47 | review | First posts | |||
| Sep 4, 2020 at 16:16 | |||||
| Sep 4, 2020 at 14:42 | history | answered | maraca | CC BY-SA 4.0 |