Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define MAXN 10
- using namespace std;
- void input_2d(int &n, int &m, int a[][MAXN]) {
- cin >> n >> m;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- cin >> a[i][j];
- }
- }
- }
- void output_2d(int &n, int &m, int a[][MAXN]) {
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- cout << a[i][j] << " ";
- }
- cout << endl;
- }
- }
- int sum_2d(int n, int m, int a[][MAXN]) {
- int sum = 0;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- sum += a[i][j];
- }
- }
- return sum;
- }
- void sum_2d_rows(int n, int m, int a[][MAXN], int sums[]) {
- for (int i = 0; i < n; i++) {
- sums[i] = 0;
- for (int j = 0; j < m; j++) {
- sums[i] += a[i][j];
- }
- }
- }
- int min_2d(int n, int m, int a[][MAXN]) {
- int mini = a[0][0];
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- if(a[i][j]<mini) mini = a[i][j];
- }
- }
- return mini;
- }
- void min_2d_rows(int n, int m, int a[][MAXN], int minis[]) {
- for (int i = 0; i < n; i++) {
- minis[i] = a[i][0]; /* задаваме първия елемент от реда за минимум в началото*/
- for (int j = 0; j < m; j++) {
- if(a[i][j]<minis[i]) minis[i] = a[i][j];
- }
- }
- }
- int main() {
- int a[MAXN][MAXN], n, m, sum[MAXN], minis[MAXN];
- input_2d(n, m, a);
- output_2d(n, m, a);
- cout << sum_2d(n, m, a) << endl;
- sum_2d_rows(n, m, a, sum);
- for (int i = 0; i < n; i++)
- {
- cout << sum[i] << " ";
- }
- cout << endl;
- cout << min_2d(n, m, a) << endl;
- min_2d_rows(n, m, a, minis);
- for (int i = 0; i < n; i++)
- {
- cout << minis[i] << " ";
- }
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment