ICPC2013予選、A問題をpythonで

A.py

def table(n):
	t = []
	for w in xrange(1, n + 1):
		for h in xrange(1, w):
			t.append((pow(h, 2) + pow(w, 2), h, w))
	return sorted(t)

if __name__ == '__main__':
	t = table(150)
	while True:
		h, w = map(int, raw_input().split())
		if w == 0 and h == 0:
			break
		i = t.index((pow(h, 2) + pow(w, 2), h, w))
		print t[i+1][1], t[i+1][2]