All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
String Theory...not quite (Posted on 2010-07-27) Difficulty: 3 of 5
If the numbers 1 - 100 are written in one long string, how many substrings of minimum length 2 can be found with strictly decreasing numbers? e.g. 12345678910 has three such substrings: 91, 910, 10.

No Solution Yet Submitted by Andre    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): solution - agreed | Comment 5 of 6 |
(In reply to re: solution - agreed by ed bottemiller)

Charlie's is correct. I missed that 10 was also counted twice. (see my updated post).
  Posted by Dej Mar on 2010-07-27 19:19:13

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information