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
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2015 at 2:06 | vote | accept | redDragon | ||
| Apr 23, 2015 at 1:33 | answer | added | Douglas Zare | timeline score: 1 | |
| Feb 8, 2015 at 21:55 | comment | added | redDragon | you can assume that n < 10^5. | |
| Feb 8, 2015 at 21:34 | comment | added | user53141 | How big numbers are we talking about? My first attempt would be to generate the set of integers to 1,000,000 with this property and then just test manually with integers one by one. | |
| Feb 8, 2015 at 20:56 | answer | added | rwong | timeline score: 1 | |
| Feb 8, 2015 at 20:47 | comment | added | redDragon | The 1's and 0's are in base 10. | |
| Feb 8, 2015 at 20:46 | history | edited | redDragon | CC BY-SA 3.0 | added 50 characters in body |
| Feb 8, 2015 at 20:13 | history | asked | redDragon | CC BY-SA 3.0 |