fork download 
  1. 	import java.io.BufferedReader;
  2. 	import java.io.IOException;
  3. 	import java.io.InputStreamReader;
  4. 	import java.util.ArrayList;
  5. 	import java.util.HashSet;
  6. 	import java.util.List;
  7.  
  8. 	public class Main {
  9.  
  10. 		public static void main(String[] args) {
  11. 			try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
  12. 				String input;
  13. 				while ((input = br.readLine()) != null) {
  14. 					if (input.equalsIgnoreCase("exit"))
  15. 						return;
  16. 					long startNano = System.nanoTime();
  17. 					brute(input);
  18. 					long endNano = System.nanoTime();
  19. 					long diff = endNano - startNano;
  20. 					long diffMilli = diff / 1000000;
  21. 					System.out.println("Time: " + diffMilli + " ms");
  22. 				}
  23. 			} catch (IOException e) {
  24. 				e.printStackTrace();
  25. 			}
  26. 		}
  27.  
  28. 		/**
  29. 		 * Method inputs all integers into a hashset, and then sums two integers
  30. 		 * and checks for the negation in the set.
  31. 		 * @param input
  32. 		 */
  33. 		private static void brute(String input) {
  34. 			List<Triplet> list = new ArrayList<Triplet>();
  35. 			String[] nums = input.split("\\s");
  36. 			int[] array = new int[nums.length];
  37. 			int index = 0;
  38. 			HashSet<Integer> set = new HashSet<Integer>();
  39. 			for (String s : nums) {
  40. 				int num = Integer.parseInt(s);
  41. 				set.add(num);
  42. 				array[index] = num;
  43. 				index++;
  44. 			}
  45.  
  46. 			int i, j, size = array.length;
  47. 			for (i = 0; i < size - 1; i++) {
  48. 				for (j = i + 1; j < size; j++) {
  49. 					if (set.contains(-(array[i] + array[j]))) {
  50. 						Triplet t = new Triplet(array[i], array[j], -(array[i] + array[j]));
  51. 						if (list.contains(t)) {
  52. 							continue;
  53. 						}
  54. 						list.add(t);
  55. 						System.out.printf("%d %d %d\n", array[i], array[j], -(array[i] + array[j]));
  56. 					}
  57. 				}
  58. 			}
  59. 		}
  60.  
  61. 		public static class Triplet {
  62. 			private int x, y, z;
  63.  
  64. 			public Triplet(int x, int y, int z) {
  65. 				this.x = x;
  66. 				this.y = y;
  67. 				this.z = z;
  68. 			}
  69.  
  70. 			@Override
  71. 			public int hashCode() {
  72. 				final int prime = 31;
  73. 				int result = 1;
  74. 				result = prime * result;
  75. 				result = prime * result + x;
  76. 				result = prime * result + y;
  77. 				result = prime * result + z;
  78. 				return result;
  79. 			}
  80.  
  81. 			@Override
  82. 			public boolean equals(Object obj) {
  83. 				if (this == obj)
  84. 					return true;
  85. 				if (obj == null)
  86. 					return false;
  87. 				if (getClass() != obj.getClass())
  88. 					return false;
  89. 				Triplet other = (Triplet) obj;
  90. 				if (x != other.x)
  91. 					return false;
  92. 				if (y != other.y)
  93. 					return false;
  94. 				if (z != other.z)
  95. 					return false;
  96. 				return true;
  97. 			}
  98.  
  99. 		}
  100. 	}
Success #stdin #stdout 0.08s 4386816KB
comments ()
stdin 
9 -6 -5 9 8 3 -4 8 1 7 -4 9 -9 1 9 -9 9 4 -6 -8
4 5 -1 -2 -7 2 -5 -3 -7 -3 1
-1 -6 -3 -7 5 -8 2 -8 1
-5 -1 -4 2 9 -9 -6 -1 -7
stdout 
9 -5 -4
9 -4 -5
-6 3 3
-5 9 -4
-5 -4 9
-5 1 4
-5 4 1
8 -4 -4
8 1 -9
8 -9 1
3 -4 1
3 1 -4
3 -6 3
-4 8 -4
-4 1 3
-4 -4 8
-4 9 -5
1 7 -8
1 -4 3
1 -9 8
1 4 -5
1 -8 7
7 1 -8
7 -8 1
-9 1 8
4 -8 4
Time: 11 ms
4 -1 -3
4 -2 -2
4 -5 1
4 -3 -1
4 1 -5
5 -2 -3
5 -7 2
5 2 -7
5 -3 -2
-1 2 -1
-1 -3 4
-2 -3 5
-2 1 1
-7 2 5
2 -3 1
2 -7 5
2 1 -3
-5 1 4
-3 1 2
Time: 10 ms
-1 2 -1
-6 5 1
-6 1 5
-3 2 1
-3 1 2
-7 5 2
-7 2 5
5 2 -7
5 1 -6
2 1 -3
Time: 1 ms
-5 -4 9
-5 9 -4
-1 2 -1
-1 -1 2
-4 2 2
-4 9 -5
2 -1 -1
Time: 0 ms
https://ideone.com/oNaely
language:
Java (HotSpot 12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!