Advertisement
Guest User

Untitled

a guest
Jan 17th, 2017
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.42 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include <iostream>
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <ctime>
  6.  
  7. using namespace std;
  8.  
  9. void createMatr(int**&, int );
  10. void input(int**, int);
  11. void output(int**, int);
  12. int SUM(int**, int);
  13. int result(int, int, int);
  14.  
  15.  
  16. int n, sum_A, sum_B, sum_C;
  17. int** A, **B, **C;
  18.  
  19. int main()
  20. {
  21. srand(time(NULL));
  22.  
  23. cout << "Enter n: ";
  24. cin >> n; cout << endl;
  25.  
  26. createMatr(A, n);
  27. createMatr(B, n);
  28. createMatr(C, n);
  29.  
  30.  
  31. input(A, n);
  32. input(B, n);
  33. input(C, n);
  34.  
  35.  
  36. output(A, n);
  37. sum_A = SUM(A, n);
  38.  
  39. output(B, n);
  40. sum_B = SUM(B, n);
  41.  
  42. output(C, n);
  43. sum_C = SUM(C, n);
  44.  
  45.  
  46. cout <<"result: "<< result(sum_A, sum_B, sum_C)<<endl;
  47.  
  48. system("pause");
  49.  
  50. return 0;
  51. }
  52.  
  53.  
  54. void createMatr(int**& Matr, int n) {
  55. Matr = new int*[n];
  56. for (int i = 0; i < n; i++)
  57. Matr[i] = new int[n];
  58. };
  59.  
  60.  
  61. void input(int** Matr, int n) {
  62. for (int i = 0; i < n; i++) {
  63. for (int j = 0; j < n; j++) {
  64. Matr[i][j] = rand() % 10;
  65. }
  66. }
  67.  
  68. };
  69.  
  70.  
  71. void output(int** Matr, int n) {
  72. for (int i = 0; i < n; i++) {
  73. for (int j = 0; j < n; j++) {
  74. printf("%2d", Matr[i][j]);
  75. };
  76. cout << endl;
  77. }
  78. cout << endl;
  79. };
  80.  
  81. int SUM(int** Matr, int n) {
  82. int sum = 0;
  83. for (int i = 0; i < n; i++) {
  84. for (int j = i; j < n; j++) {
  85. sum += Matr[i][j];
  86. }
  87. }
  88. cout << "sum is: " << sum << endl<<endl;
  89. return sum;
  90. }
  91.  
  92. int result(int a, int b, int c) {
  93. return((a + b + c) / 3);
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement