Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class _02_PythagoreanNumbers {
- public static void main(String[] args) {
- @SuppressWarnings("resource")
- Scanner input = new Scanner(System.in);
- int n = input.nextInt();
- int[] numbers = new int[n];
- // enter all numbers in array
- for (int i = 0; i < numbers.length; i++) {
- numbers[i] = input.nextInt();
- }
- for (int i = 0; i < numbers.length; i++) {
- for (int j = i; j < numbers.length; j++) {
- for (int k = j; k < numbers.length; k++) {
- if (numbers[k]*numbers[k] + numbers[j]*numbers[j] == numbers[i]*numbers[i]) {
- if (numbers[k] > numbers[j]) {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[j], numbers[k], numbers[i]);
- }
- else {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[k], numbers[j], numbers[i]);
- } }
- else if (numbers[j]*numbers[j] + numbers[i]*numbers[i] == numbers[k]*numbers[k]) {
- if (numbers[j] > numbers[i]) {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[i], numbers[j], numbers[k]);
- }
- else {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[j], numbers[i], numbers[k]);
- }
- }
- else if (numbers[i]*numbers[i] + numbers[k]*numbers[k] == numbers[j]*numbers[j]) {
- if (numbers[i] > numbers[i]) {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[k], numbers[i], numbers[j]);
- }
- else {
- System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d\n",
- numbers[i], numbers[k], numbers[j]);
- }
- }
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement