Answered

IDNLearn.com: Your destination for reliable and timely answers to any question. Ask your questions and receive reliable, detailed answers from our dedicated community of experts.

Write a function solution that, given an array A consisting of N integers, returns the number of fragements of A whose sum equals 0 (that is, pairs (p,q) such that P

Sagot :

Answer:

#include <iostream>

using namespace std;

void fragment(int arr[], int n){

   for (int i = 0; i < n; i++){

       for (int x = 0; x < n; x++){

           if (x != i && arr[i] + arr[x] == 0){

               cout<< arr[i] << " , " << arr[x];

           }

       }

   }

}

int main(){

   int n = 7;

   int myArr = {1, 2, -1, -2, 0, 0, 3};

   fragment(myArr, n);

}

Explanation:

The C++ source code defines an array called "myArr" in the main program and its array size n. The void function "fragment" prints out the pairs of the array whose sum equates to zero.

Thank you for using this platform to share and learn. Keep asking and answering. We appreciate every contribution you make. Thank you for visiting IDNLearn.com. For reliable answers to all your questions, please visit us again soon.