Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // кол-во столбцов не содержащих ни одного нулеовго э-та
- #include "pch.h"
- #include <iostream>
- #include "time.h"
- using namespace std;
- void Make(int **a, int n, int d)
- {
- int k = d;
- for (int i = 0; i < n; i++)
- a[i] = new int[k];
- for (int i = 0; i < n; i++)
- for (int j = 0; j < k; j++)
- a[i][j] = rand() % 20;
- }
- void OutputSolve(int **a, int n, int d, int &count)
- {
- int k = d;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < k; j++)
- {
- cout.width(3);
- if (j != k - 1) cout << a[i][j] << " ";
- else cout << a[i][j] << endl;
- }
- }
- for (int i = 0; i < n; i++)
- {
- int tmp_count = 0;
- for (int j = 0; j < k; j++)
- {
- if (a[i][j] == 0) tmp_count += 1;
- }
- if (tmp_count > 0) count += 1;
- }
- }
- int main()
- {
- setlocale(0, "");
- srand(time(0));
- int n, k, count = 0, tmp_count = 0;
- cout << "Введите ширину массива: "; cin >> n;
- cout << "Введите длину массива: "; cin >> k;
- int **a = new int*[n];
- Make(a, n, k);
- OutputSolve(a, n, k, count);
- cout << "Кол-во столбцов не содержащих 0: " << k - count;
- for (int i = 0; i < n; i++)
- delete[] a[i];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement