fork download
  1. class Ideone
  2. {
  3. static final int LIMIT = 100;
  4.  
  5. public static void main(String[] args)
  6. {
  7. for (int m = 2; m * m < LIMIT; m++)
  8. {
  9. for (int n = (m & 1) + 1; n < m; n += 2)
  10. {
  11. if (gcd(m, n) != 1) continue;
  12. int a = m * m - n * n;
  13. int b = 2 * m * n;
  14. int c = m * m + n * n;
  15. if (c >= LIMIT) break;
  16. System.out.printf("(%d,%d,%d)%n", a, b, c);
  17. }
  18. }
  19. }
  20.  
  21. static int gcd(int a, int b)
  22. {
  23. return b == 0 ? a : gcd(b, a % b);
  24. }
  25. }
  26.  
Success #stdin #stdout 0.04s 4386816KB
stdin
Standard input is empty
stdout
(3,4,5)
(5,12,13)
(15,8,17)
(7,24,25)
(21,20,29)
(9,40,41)
(35,12,37)
(11,60,61)
(45,28,53)
(33,56,65)
(13,84,85)
(63,16,65)
(55,48,73)
(39,80,89)
(77,36,85)
(65,72,97)