project euler problem 091

Right triangles with integer coordinates

This problem is too simple. I wrote the code, compile and run, then it is solved. Even if I modify the boundary to 5000, my code only runs 1.5 second to find the correct answer.

There is only one concept in the problem. How to solve the equation ax+by = c, it is easy to find out how to solve such kind of diophantine equation.