note
MeowChow
Any solution which returns a pair of numbers that are in the list and represent a minimal distance from each other with respect to all other possible pairings is correct. We are comparing the distance between all possible number pairings, and returning a minimal one. So the following are all correct:
<code>
nn(1,5,9,15) returns (1,5)
# or
nn(1,5,9,15) returns (5,9)
# or
nn(1,5,9,15) returns (9,5)
</code>
I don't really understand the beginning of your question though.
<pre>
<a href="/index.pl?node=MeowChow"> MeowChow </a>
s aamecha.s a..a\u$&owag.print</pre>
69570
69818