Community Spring Cleaning week is here! Join your fellow Maveryx in digging through your old posts and marking comments on them as solved. Learn more here!

Weekly Challenges

Solve the challenge, share your solution and summit the ranks of our Community!

Also available in | Français | Português | Español | 日本語
IDEAS WANTED

Want to get involved? We're always looking for ideas and content for Weekly Challenges.

SUBMIT YOUR IDEA

Challenge #239: SEND + MORE = MONEY

Greg_Murray
12 - Quasar

I definitely should have taken the iterative approach. My solution is... well...  a little gross. 

Spoiler
Greg_Murray_1-1603893819421.png

 

LHolmes
9 - Comet

Maybe went overboard this week and solved 3 different ways; first by substituting known letters (systems of equations and logic) and then solving for the remainder using a batch macro; second by substituting in similar fashion and appending/replacing; and lastly - a full solve using all possible permutations for the 8 characters & 10 digits. Probably room for refinement.

 

Fun fact - if you don't constrain the Sum to 5 digits (letting m=0) there are actually 25 solutions in total.

 

Enjoy!

 

Spoiler
239 - Solution.PNG
RichoBsJ
11 - Bolide

Thank you @LHolmes and @AYXAcademy for this amazing challenge!

 

There are actually 25 solutions in total!

 

↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓

 

Spoiler
solutions 239.png
ngaskill1
7 - Meteor

there is a constraint that each number can only be used once

ngaskill1
7 - Meteor

 

Spoiler
ngaskill1_0-1603955600155.png

 

Logic-augmented brute force. Started out the complete brute force method and realized after a few minutes of processing time that it was hopeless. The key for me is realizing that this is also a puzzle--the M must be a 1 because there is no combination of any 2 non-repeating 4 digit values which could yield a sum of 20k or larger. That allows the brute force approach to have to deal with one less character in the solution and also removes any value in the namespace containing a 1. The whole thing executes in just a bit over a minute. Interesting one.

 

 

ngaskill1
7 - Meteor
Spoiler
My approach evaluated the entire namespace of 1-9999999. When I watched your solution video aftwerward and you mentioned the image in the challenge that gave some of the numbers I literally facepalmed. I did made this quite a bit more processor intensive! 🙂
gregurbanowicz
7 - Meteor

Fun challenge! Solution attached.

Jonathan-Sherman
15 - Aurora
15 - Aurora

Challenge 239 is done!

 

Took me a while to work out how to keep the approach dynamic rather than appending several times, but finally got there!

 

Workflow:

Spoiler
Jonathan-Sherman_2-1604018975264.png

Iterative Macro:

Spoiler
Jonathan-Sherman_1-1604018948128.png
gmoores
6 - Meteoroid

Brute force method that runs in about 20 seconds.

darryl5280
10 - Fireball

I took a straight forward approach and it runs in .3 seconds.

 

Simple Solution Challenge 239.jpg