From 3387f59ead8c920561745ed2b1feadd02d01c8bd Mon Sep 17 00:00:00 2001 From: Misha Date: Tue, 30 Sep 2025 19:51:58 +0300 Subject: [PATCH] =?UTF-8?q?=D0=A3=D0=B4=D0=B0=D0=BB=D0=B8=D1=82=D1=8C=20el?= =?UTF-8?q?em1.cpp?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- elem1.cpp | 61 ------------------------------------------------------- 1 file changed, 61 deletions(-) delete mode 100644 elem1.cpp diff --git a/elem1.cpp b/elem1.cpp deleted file mode 100644 index 8a17cb4..0000000 --- a/elem1.cpp +++ /dev/null @@ -1,61 +0,0 @@ -#include - -#define N 5 -#define M 7 - -using namespace std; - -int main() { - setlocale(0, ""); - srand(time(0)); - - int arr[N][M]{ 0 }; - int i, j; - - for (i = 0; i < N; ++i) { - for (j = 0; j < M; ++j) { - arr[i][j] = rand() % 55 + 2; - } - } - - cout << "Показати масив (рядки):\n"; - for (i = 0; i < N; ++i) - for (j = 0; j < M; ++j) { - cout.width(4); - cout << arr[i][j]; - } - cout << endl; - - int totalSum = 0; - int minElement = arr[0][0]; - int maxElement = arr[0][0]; - int elementCount = N * M; - - for (i = 0; i < N; ++i) { - for (j = 0; j < M; ++j) { - totalSum += arr[i][j]; - } - } - - for (i = 0; i < N; ++i) - for (j = 0; j < M; ++j) { - if (arr[i][j] < minElement) { - minElement = arr[i][j]; - } - if (arr[i][j] > maxElement) { - maxElement = arr[i][j]; - } - } - - double average = 0.0; - if (elementCount > 0) { - average = static_cast(totalSum) / elementCount; - } - - cout << "\nСума всіх елементів: " << totalSum << endl; - cout << "Середнє арифметичне всіх елементів: " << average << endl; - cout << "Мінімальний елемент: " << minElement << endl; - cout << "Максимальний елемент: " << maxElement << endl; - - return 0; -} \ No newline at end of file