Something very dark...
The solution is more easy and more easy to understand too!

It's simple.
Just c=n^2 ( by intuition ). So, find a and b.
a=n^2+c and b=n^2+d ( because n^2 <= a,b,c <= (n+1)^2 = n^2 + 2*n + 1 ), where c and d is positive and c!=d( because a!=b(by text of this problem ) )

a^2 + b^2 = (n^2+c)^2 + (n^2+d)^2 = 2*n^4 + 2*n^2(c+d) + c^2 + d^2

Look at this 2*n^4 + 2*n^2(c+d) + c^2 + d^2. Each summand must be divisible on c=n^2.
So, just, c = n and d = 2*n
Answer:
a = n^2 + n
b = n^2 + 2*n
c = n^2

P.S.:
You can say just a = n^2 and analogous prove another formula.

Edited by author 03.12.2011 03:41

output should contain three different integers