perlquestion
Limbic~Region
All,
<br />
In the spirit of [id://527581|Project Euler], I pose the following problem:
<p>
How many unique ways are there to select 10 different numbers from 1-100 so that the sum of the numbers is 667?
</p>
In other words:
<ul>
<li>Each number in a set of 10 must be distinct</li>
<li>Two sets that have the same 10 numbers but in a different order are not valid (not unique)</li>
<li>Some numbers in 2 different sets may repeat as long as all 10 do not repeat</li>
</ul>
A straight forward brute force implementation will require checking 17,310,309,456,440 different sets of numbers, so that is where the challenge comes in.
<p>
The only hints that I will give on how I solved the problem is that I used C and constructed my loops dynamically. I will also say that there are over a billion solutions. Unlike [id://527581|Project Euler], I ask that you also post your code so that everyone may learn from our collective ingenuity. I will post my code by this Friday.
</p>
<div class="pmsig"><div class="pmsig-180961">
<p>
Cheers - [Limbic~Region|L~R]
</p>
</div></div>
<small>Clarified acceptable solution criteria</small>