Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <ctime>
- const int rowNumber = 3;
- const int columnNumber = 4;
- using namespace std;
- int* fillArray(int arr[rowNumber][columnNumber], int rows, int columns, int min, int max) {
- srand(time(NULL));
- for (int i = 0; i < rows; i++)
- {
- for (int j = 0; j < columns; j++)
- {
- arr[i][j] = rand() % (max - min + 1) + min;
- cout << setw(2) << arr[i][j] << " ";
- }
- cout << endl;
- }
- cout << endl;
- return *arr;
- }
- int countRowSum(int arr[rowNumber][columnNumber], int rowNumber, int columnNumber) {
- int sums[] = { 0,0,0 };
- for (int i = 0; i < rowNumber; i++)
- {
- for (int j = 0; j < columnNumber; j++)
- {
- sums[i] += arr[i][j];
- }
- }
- for (int i = 0; i < rowNumber; i++)
- {
- cout << sums[i] << " ";
- }
- cout << endl;
- if (sums[0] < sums[1] && sums[0] < sums[2]) return 0;
- else if (sums[1] < sums[2] && sums[1] < sums[0]) return 1;
- else return 2;
- }
- int findMaximumRowValue(int arr[rowNumber][columnNumber], int rowIndex) {
- int maxValue = -8;
- for (int i = 0; i < columnNumber; i++)
- {
- if (maxValue < arr[rowIndex][i])
- {
- maxValue = arr[rowIndex][i];
- }
- }
- return maxValue;
- }
- int main()
- {
- const int max = 8;
- const int min = -7;
- const int repeatNumber = rand() % (5 - 2 + 1) + 2;
- int counter{};
- int maxValue;
- do
- {
- int arr[rowNumber][columnNumber];
- fillArray(arr, rowNumber, columnNumber, min, max);
- int lowestSum = countRowSum(arr, rowNumber, columnNumber);
- maxValue = findMaximumRowValue(arr, lowestSum);
- cout << "Najwyzsza wartosc w wierszu o najmniejszej sumie: " << maxValue << endl;
- counter++;
- } while (maxValue < 0 && counter < repeatNumber);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement