Pythagorean triples

You are given a natural number $n$. Find all triples of natural numbers $a < b < c \le n$ with $a^2 + b^2 = c^2$. For example, $(3, 4, 5)$: $9 + 16 = 25$.

A single integer $n$ ($5 \le n \le 500$).

Each triple on its own line: $a$, $b$, $c$. Order them by increasing $a$, and for equal $a$ by increasing $b$.

Two nested loops are enough: choose $a$ and $b$, compute $c^2 = a^2 + b^2$ and check that is an integer and . Three loops also work, but they are noticeably slower for .