Shortest code for Seven-Eleven The Seven-Eleven problem is find 4 positive numbers (with two decimal digits, A.BC) such that their sum is equal to their product and is equal to 7.11.

a + b + c + d = a * b * c * d = 7.11
0 &lt; a &lt;= b &lt;= c &lt;= d


Write the shortest program to compute all non-decreasing quadruples. Precomputing the values is not allowed.
Ruby, 105 characters
Unfortunately I didn't get it below the 100 mark. It just brute forces all possible tuples and checks afterwards. Nevertheless it still finishes in finite time.
(1..m=711).map{|a|(a..m).map{|b|(b..m).map{|c|d=m-a-b-c;p [a/u=1e2,b/u,c/u,d/u]if d&gt;=c&amp;&amp;a*b*c*d==m*1e6}}}

The formatted version looks like this:
(1..m=711).map{ |a|
  (a..m).map{ |b|
    (b..m).map{ |c|
      d=m-a-b-c
      p [a/u=1e2,b/u,c/u,d/u] if d&gt;=c &amp;&amp; a*b*c*d==m*1e6
    }
  }
}