Find d to maximise the variety of zeros in array c[] created as c[i] = d*a[i] + b[i]

#embody

utilizing namespace std;

  

void findDandZeros(int a[], int b[], int n)

  

    

    unordered_map mpp;

  

    int rely = zero;

  

    

    for (int i = zero; i < n; i++)

  

    

    int maxi = zero;

    for (auto it : mpp)

        maxi = max(it.second, maxi);

    

  

    

    for (auto it : mpp)

  

    

    cout << "The number of zeros in array C is: "

         << maxi + rely;

  

int predominant()

    int a[] = 13, 37, 39 ;

    int b[] = 1, 2, three ;

    int n = sizeof(a) / sizeof(a[0]);

    findDandZeros(a, b, n);

  

    return zero;