Advertisement
Guest User

Untitled

a guest
Nov 16th, 2018
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.90 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4.  
  5. int** mm() {
  6. int N, M;
  7. scanf("%d %d", &N, &M);
  8. int** A = (int**)malloc(N * sizeof(int*));
  9. for (int i = 0; i < N; i++) A[i] = (int*)malloc(M * sizeof(int));
  10.  
  11. for (int i = 0; i < N; i++) {
  12. for (int j = 0; j < M; j++) {
  13. scanf("%d", &A[i][j]);
  14. }
  15. }
  16. return A;
  17. }
  18. int sizei(int** &A) {
  19. return sizeof(A) / sizeof(int);
  20. }
  21. int sizej(int** &A) {
  22. return sizeof(A[0]) / sizeof(int);
  23. }
  24. void dest(int** &A) {
  25. for (int i = 0; i < sizei(A); i++) free(A[i]);
  26. free(A);
  27. }
  28.  
  29. void mul(int** A, int** B) {
  30. int** C = (int**)malloc(sizei(A) * sizeof(int*));
  31. for (int i = 0; i < sizei(A); i++) C[i] = (int*)malloc(sizej(B) * sizeof(int));
  32.  
  33. for (int i = 0; i < sizei(C); i++)
  34. for (int j = 0; j < sizej(C); j++) {
  35. C[i][j] = 0;
  36. for (int k = 0; k < sizej(A); k++) C[i][j] += A[i][k] * B[k][j];
  37. }
  38. dest(A);
  39. A = (int**)malloc(sizei(C) * sizeof(int*));
  40. for (int i = 0; i < sizei(C); i++) A[i] = (int*)malloc(sizej(C) * sizeof(int));
  41. A = C;
  42. dest(C);
  43. }
  44. int main()
  45. {
  46. //считывание а
  47. int** A = mm();
  48. char s1[4];
  49. char s2[4];
  50. scanf("%s", &s1);
  51. do {
  52. while (strcmp(s1, "*") == 0) {
  53. int** B = mm();
  54. mul(A, B);
  55. scanf("%s", &s1);
  56. dest(B);
  57. }
  58. if (strcmp(s1, ".") == 0) break;
  59. int** B = mm();
  60. scanf("%s", &s2);
  61. while (strcmp(s2, "*") == 0) {
  62. int** C = mm();
  63. mul(B, C);
  64. scanf("%s", &s2);
  65. dest(C);
  66. }
  67.  
  68. if (strcmp(s1, "+") == 0) {
  69. for (int i = 0; i < sizei(A); i++) for (int j = 0; j < sizej(B); j++) A[i][j] += B[i][j];
  70. }
  71. else if (strcmp(s1, "-") == 0) {
  72. for (int i = 0; i < sizei(A); i++) for (int j = 0; j < sizej(B); j++) A[i][j] -= B[i][j];
  73. }
  74. dest(B);
  75. s1 = s2;
  76. } while (strcmp(s1, ".") != 0);
  77. //вывод а
  78. for (int i = 0; i < sizei(A); i++) {
  79. for (int j = 0; j < sizej(A); j++) printf("%d ", A[i][j]);
  80. printf("\n");
  81. }
  82. dest(A);
  83. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement