Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <clocale>
- #include <ctime>
- #include <cmath>
- using namespace std;
- #define M 5
- #define N 5
- bool greaterSum(int array[][N], size_t rows);
- void fillTheArray(int array[][N], size_t rows);
- void printTheArray(int array[][N], size_t rows);
- int main(){
- setlocale(LC_ALL, "Bulgarian");
- srand(time(NULL));
- int array[M][N];
- fillTheArray(array, M);
- printTheArray(array, M);
- cout << endl;
- cout << boolalpha<< greaterSum(array, M);
- return 0;
- }
- //да се провери дали основният диагонал има по-голямо произведение на елементите от вторичния, ако да функцията да връща истина, в противен случай лъжа;
- bool greaterSum(int array[][N], size_t rows){
- int multInFirstDiagonal = 1;
- int multInSecondDiagonal = 1;
- for (size_t i = 0; i < M; i++)
- {
- for (size_t j = 0; j < N; j++){
- if (i == j){
- multInFirstDiagonal *= array[i][j];
- }
- if (i + j == N - 1){
- multInSecondDiagonal *= array[i][j];
- }
- }
- }
- if (multInFirstDiagonal > multInSecondDiagonal) return true;
- else return false;
- }
- void fillTheArray(int array[][N], size_t rows){
- for (size_t i = 0; i < M; i++)
- {
- for (size_t j = 0; j < N; j++){
- array[i][j] = rand() % 10 ;
- }
- }
- }
- //принтирам масив
- void printTheArray(int array[][N], size_t rows){
- cout << "Оригиналната матрица е това : " << endl;
- for (size_t i = 0; i < M; i++)
- {
- for (size_t j = 0; j < N; j++){
- cout << array[i][j] << "\t";
- }
- cout << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement