Implementation Copyright by Zach Mitchell, 2017 It was a problem from Google CodeJam 2016: https://code.google.com/codejam/contest/6254486/dashboard - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Bleatrix Trotter the sheep has devised a strategy that helps her fall asleep faster. First, she picks a number N. Then she starts naming N, 2 × N, 3 × N, and so on. Whenever she names a number, she thinks about all of the digits in that number. She keeps track of which digits (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) she has seen at least once so far as part of any number she has named. Once she has seen each of the ten digits at least once, she will fall asleep. Bleatrix must start with N and must always name (i + 1) × N directly after i × N. For example, suppose that Bleatrix picks N = 1692. She would count as follows: N = 1692. Now she has seen the digits 1, 2, 6, and 9. 2N = 3384. Now she has seen the digits 1, 2, 3, 4, 6, 8, and 9. 3N = 5076. Now she has seen all ten digits, and falls asleep. The purpose of this kata is to return the last number Bleatrix Trotter sees before falling asleep. Input Will always be positive integer or zero Output The last number Bleatrix Trotter sees or "INSOMNIA" (-1 in Rust and C++) if she will count forever
zachmitch/bleatrixTrotter
Passes integer as argument, multiplying until we've seen each single digit (0-9) at least once
C++