All,
In the spirit of Project Euler, I pose the following problem:

How many unique ways are there to select 10 different numbers from 1-100 so that the sum of the numbers is 667?

In other words:

• Each number in a set of 10 must be distinct
• Two sets that have the same 10 numbers but in a different order are not valid (not unique)
• Some numbers in 2 different sets may repeat as long as all 10 do not repeat

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.

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 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.

Clarified acceptable solution criteria