Question

  #include<iostream>//Pls note:Only header allowed...

因为这是C ++，我不这么认为，因此该数学函数需要任何其他标题。

using namespace std;
int comparator(int audience[][2], int index1, int index2) {

    int b1, e1;
    int b2, e2;
    b1 = audience[index1][1];
    e1 = audience[index1][2];
    b2 = audience[index2][1];
    e2 = audience[index2][2];

    double re1;
    re1 = pow(b1, e1);
    cout << re1 << endl;

    double re2 = pow(b2, e2);
    cout << re2 << endl;

    if (re1 == re2)
    {
        return 0;
    }

    if (re1 > re2)
    {
        return -1;
    }

    if (re1 < re2)
    {
        return 1;
    }
}

//Nothing has to be done with the rest of the two functions.

void sorting(int audience[][2], int N, int &i_index, int &j_index)
{

    int i, j, temp;

    for (i = 0; i<N - 1; i++)
    {
        if (audience[i][2] < audience[i + 1][2])
            continue;
        else
            i_index = i;
        break;
    }

    for (i = N; i > 1; i++)
    {
        if (audience[i][2]>audience[i - 1][2])
            continue;
        else
            j_index = i;
        break;
    }

    for (i = i_index + 1; i < j_index - 1; i++)
    {
        min = audience[i_index + 1][2];
        for (i = )
            if (audience[i_index][1] > audience[i_index + 1][1])
            {
                temp = audience[i_index + 1][1];
                audience[i_index + 1][1] = audience[i_index][1];
                audience[i_index][1] = temp;
            }
    }

    for (i = i_index + 1; i <= j_index - 1; i++)
    {
        min = audience[i][2];
        for (j = i_index + 2; j <= j_index - 1; j++)
        {
            if (min > audience[j][2])
            {
                temp = audience[i_index + 2][2];
                audience[i_index + 1][2] = audience[i_index][2];
                audience[i_index][2] = temp;
            }

        }
    }
}

void merge(int audience[][2], int mergedarray[][2], int N, int i_index, int    j_index)
{
}

int main()
{
    int audience[100][2], mergedmarks[100][2];
    int i, N;
    int index1 = 0, index2 = 0;
    int comp_result;
    cout << "Enter the value of N : ";
    cin >> N;    // Enter size of the table
    cout << "Enter the base and exponent for " << N << "rows " << endl;

    for (i = 0; i < N; i++)
        cin >> audience[i][0] >> audience[i][1];    //Enter numbers in the table

    cout << endl << "Checking Function 1: Compare ecodes for 5 index pairs" << endl;
    for (i = 0; i < 5; i++)
    {
        cout << "\nEnter indices of row1 and row2 that you want to compare: ";
        cin >> index1 >> index2;
        if (index1 < 0 || index2 < 0 || index1 >= N || index2 >= N)
            continue;
        comp_result = comparator(audience, index1, index2);

        if (comp_result == -1)
            cout << "ecode of index 1 is greater than ecode of index2" << endl;
        else if (comp_result == 1)
            cout << "ecode of index 1 is less than ecode of index2" << endl;
        else if (comp_result == 0)
            cout << "ecode of index 1 is equal to ecode of index2" << endl;
    }
    cout << endl;
    int index_i = 0, index_j = N;
    sorting(audience, N, index_i, index_j);

    cout << "Checking Function 2: Printing sorted array " << endl;
    for (i = 0; i < N; i++)
        cout << audience[i][0] << " " << audience[i][1] << endl;
    cout << endl;

    cout << "index i: " << index_i << "\nindex j: " << index_j << endl;


    cout << endl << "Checking Function 3: Printing Merged Array " << endl;
    merge(audience, mergedmarks, N, index_i, index_j);
    int merge_array_size = index_i + (N - (index_j + 1));
    for (i = 0; i < N; i++)
        cout << mergedmarks[i][0] << " " << mergedmarks[i][1] << endl;
    cout << endl;
    return 0;
}

这是整个问题。我还是要编辑合并功能。这就是整个问题。这就是全部。

Answer 1

您需要包含pow标头，即math.h，才能使用它。

在文件的开头添加：

#include <math.h>
#include <iostream>

using namespace std;

Answer 2

POW在math.h头文件中声明，因此请使用

#include<math.h>

功率功能无功能范围

2 个答案: