* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
		
			
				
	
	
		
			49 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			49 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | |
| id: 5900f3dd1000cf542c50feef
 | |
| title: 'Problem 112: Bouncy numbers'
 | |
| challengeType: 5
 | |
| forumTopicId: 301738
 | |
| dashedName: problem-112-bouncy-numbers
 | |
| ---
 | |
| 
 | |
| # --description--
 | |
| 
 | |
| Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.
 | |
| 
 | |
| Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420.
 | |
| 
 | |
| We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349.
 | |
| 
 | |
| Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538.
 | |
| 
 | |
| Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%.
 | |
| 
 | |
| Find the least number for which the proportion of bouncy numbers is exactly 99%.
 | |
| 
 | |
| # --hints--
 | |
| 
 | |
| `euler112()` should return 1587000.
 | |
| 
 | |
| ```js
 | |
| assert.strictEqual(euler112(), 1587000);
 | |
| ```
 | |
| 
 | |
| # --seed--
 | |
| 
 | |
| ## --seed-contents--
 | |
| 
 | |
| ```js
 | |
| function euler112() {
 | |
| 
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| euler112();
 | |
| ```
 | |
| 
 | |
| # --solutions--
 | |
| 
 | |
| ```js
 | |
| // solution required
 | |
| ```
 |