fbd9f94
committed
Commits
Comments (0)
Files changed (1)

+19 0projecteuler/93/93.pl
projecteuler/93/93.pl
+By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, *, /) and brackets/parentheses, it is possible to form different positive integer targets.
+Using the set, {1, 2, 3, 4}, it is possible to obtain thirtyone different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first nonexpressible number.
+Find the set of four distinct digits, a < b < c < d, for which the longest set of consecutive positive integers, 1 to n, can be obtained, giving your answer as a string: abcd.