fork download
  1. #include <stdio.h>
  2.  
  3. void findPairs(int arr[], int size) {
  4.  
  5. for (int i = 0; i < size - 1; i++) {
  6. for (int j = i + 1; j < size; j++) {
  7. int sum = arr[i] + arr[j];
  8.  
  9.  
  10. for (int k = 0; k < size - 1; k++) {
  11. for (int l = k + 1; l < size; l++) {
  12. if (k != i && k != j && l != i && l != j) {
  13. if (arr[k] + arr[l] == sum) {
  14.  
  15. for (int m = 0; m < size - 1; m++) {
  16. for (int n = m + 1; n < size; n++) {
  17. if (m != i && m != j && m != k && m != l &&
  18. n != i && n != j && n != k && n != l) {
  19. if (arr[m] + arr[n] == sum) {
  20.  
  21. printf("Person 1: %d, %d\n", arr[i], arr[j]);
  22. printf("Person 2: %d, %d\n", arr[k], arr[l]);
  23. printf("Person 3: %d, %d\n", arr[m], arr[n]);
  24. return;
  25. }
  26. }
  27. }
  28. }
  29. }
  30. }
  31. }
  32. }
  33. }
  34. }
  35. printf("No pairs found with equal sum.\n");
  36. }
  37.  
  38. int main() {
  39. int arr[] = {13, 26, 39, 52, 65, 78};
  40. int size = sizeof(arr) / sizeof(arr[0]);
  41.  
  42. findPairs(arr, size);
  43.  
  44. return 0;
  45. }
Success #stdin #stdout 0s 5284KB
stdin
Standard input is empty
stdout
Person 1: 13, 78
Person 2: 26, 65
Person 3: 39, 52