let t = 1000

let decide a b =
let c = t - b - a
a*a + b*b = c*c

let rec loop i top (f : int -> bool * int) =
match i with
| v when v < top ->
let (b, payload) = f i
if b then (b, i, payload)
else loop (i+1) top f
| v -> (false, -1, -1)

let triplet =
loop 1 (t/3) (fun i ->
let (b, j, _) = loop i (t/2) (fun j ->
(decide i j, -1))
(b, j)
)


val triplet : bool * int * int = (true, 200, 375)

main
{
uint sum = 1000u;
bool got_it = false;

foreach(c in 1u .. sum while !got_it)
{
uint t = sum - c;

foreach(a in 1u .. t-1u while !got_it)
{
uint b = t - a;

if(a*a+b*b==c*c)
{
write("GOT IT: " + tos(a) + ", " + tos(b) + ", " + tos(c) + "\n");
got_it = true;
}
}
}
}

return (from a in Enumerable.Range(0, t/3) from b in Enumerable.Range(0, t/2) let c = t - b - a where a*a + b*b == c*c select new Tuple<int, int>(a, b)).FirstOrDefault();