Timeline for Dynamic Programming Problem - To find smallest integer number 'x' which contains only digits 1's and 0's such that x mod n = 0
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2015 at 21:04 | history | edited | rwong | CC BY-SA 3.0 | added 1 character in body |
| Feb 8, 2015 at 20:56 | history | answered | rwong | CC BY-SA 3.0 |