Answered

Get the answers you need at Westonci.ca, where our expert community is always ready to help with accurate information. Experience the ease of finding quick and accurate answers to your questions from professionals on our platform. Discover detailed answers to your questions from a wide network of experts on our comprehensive Q&A platform.

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.

We hope this information was helpful. Feel free to return anytime for more answers to your questions and concerns. Thank you for choosing our platform. We're dedicated to providing the best answers for all your questions. Visit us again. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.