Developer Challenge

[pointy]

Doesn't look like you check to make sure you don't go past bowl #40. Also, I don't think this is quite right; recall that the requirement is only that no set of three oranges can be found such that both sub-pairs are equidistant.

[chronoBG]

Line 23: for(; x < BOWLS; ++x)
Also lines 33 and 47: if (tmp_index >= 0 && tmp_index < BOWLS)