Advertisement
meta1211

Homework(стат.массивы)

Nov 7th, 2017
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.87 KB | None | 0 0
  1. 1.
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4.  
  5. const int N = 3;
  6. const int M = 4;
  7.  
  8. void print_array(int a[N][M])
  9. {
  10. for (unsigned int k = 0; k < N; k++)
  11. {
  12. printf("\n");
  13. for (unsigned int j = 0; j < M; j++)
  14. {
  15. printf("%d\t", a[k][j]);
  16. }
  17. }
  18. printf("\n");
  19. }
  20.  
  21. void fill_array(int a[N][M])
  22. {
  23. for (unsigned int k = 0; k < N; k++)
  24. for (unsigned int j = 0; j < M; j++)
  25. {
  26. a[k][j] = (rand() % 9) + 1;
  27. }
  28. }
  29. bool check_array(int a, int b[N][M])
  30. {
  31. for (int j = 0; j < N; j++)
  32. {
  33. for (int l = 0; l < M; l++)
  34. {
  35. if (a == b[j][l])
  36. {
  37. return false;
  38. }
  39. }
  40. }
  41. return true;
  42. }
  43. void assimilate_arrays(int a[N][M], int b[N][M])
  44. {
  45. for (int i = 0; i < N; i++)
  46. for (int k = 0; k < M; k++)
  47. {
  48. if (check_array(a[i][k], b))
  49. {
  50. printf("%d ", a[i][k]);
  51. }
  52. }
  53. }
  54. int main()
  55. {
  56. int a[N][M];
  57. int b[N][M];
  58. fill_array(a);
  59. fill_array(b);
  60. print_array(a);
  61. print_array(b);
  62. assimilate_arrays(a, b);
  63. system("pause");
  64. return 0;
  65. }
  66. 2.
  67. #include <stdio.h>
  68. #include <stdlib.h>
  69.  
  70. const int N = 20;
  71.  
  72. void fill_array(int a[N])
  73. {
  74. for (unsigned int j = 0; j < N; j++)
  75. {
  76. a[j] = j;
  77. }
  78. }
  79. void print_array(int a[N])
  80. {
  81. for (int k = N - 1; k >= 0; k--)
  82. {
  83. printf("%d ", a[k]);
  84. }
  85. printf("\n");
  86. }
  87. int main()
  88. {
  89. int a[N];
  90. fill_array(a);
  91. print_array(a);
  92. system("pause");
  93. return 0;
  94. }
  95. 3.
  96. #define _CRT_SECURE_NO_WARNINGS
  97.  
  98. #include <stdio.h>
  99. #include <stdlib.h>
  100. #include <conio.h>
  101. #include <ctime>
  102.  
  103. #define N 4
  104. #define M 5
  105. #define K 3
  106.  
  107. void print_arraya(int a[N][K])
  108. {
  109. for (unsigned int k = 0; k < N; k++)
  110. {
  111. printf("\n");
  112. for (unsigned int j = 0; j < K; j++)
  113. {
  114. printf("%d\t", a[k][j]);
  115. }
  116. }
  117. }
  118. void print_arrayb(int a[K][M])
  119. {
  120. for (unsigned int k = 0; k < K; k++)
  121. {
  122. printf("\n");
  123. for (unsigned int j = 0; j < M; j++)
  124. {
  125. printf("%d\t", a[k][j]);
  126. }
  127. }
  128. }
  129. void print_arrayc(int a[N][M])
  130. {
  131. for (unsigned int k = 0; k < N; k++)
  132. {
  133. printf("\n");
  134. for (unsigned int j = 0; j < M; j++)
  135. {
  136. printf("%d\t", a[k][j]);
  137. }
  138. }
  139. }
  140. void fill_array(int a[N][K])
  141. {
  142. for (unsigned int k = 0; k < N; k++)
  143. for (unsigned int j = 0; j < K; j++)
  144. {
  145. a[k][j] = (rand() % 9) + 1;
  146. }
  147. }
  148. void fill_array(int a[K][M])
  149. {
  150. for (unsigned int k = 0; k < K; k++)
  151. for (unsigned int j = 0; j < M; j++)
  152. {
  153. a[k][j] = (rand() % 9) + 1;
  154. }
  155. }
  156.  
  157. void multiply_arrays(int a[N][K], int b[K][M], int c[N][M])
  158. {
  159. for (int i = 0; i < N; i++)
  160. for (int k = 0; k < M; k++)
  161. {
  162. int summ = 0;
  163. for (int j = 0; j < K; j++)
  164. {
  165. summ += a[i][j] * b[j][k];
  166. }
  167. c[i][k] = summ;
  168. }
  169. }
  170.  
  171. int main()
  172. {
  173. //Начальные данные
  174. int a[N][K];
  175. int b[K][M];
  176. int c[N][M];
  177.  
  178. fill_array(a);
  179. fill_array(b);
  180. print_arraya(a);
  181. print_arrayb(b);
  182.  
  183. //Обработка
  184.  
  185. multiply_arrays(a, b, c);
  186. print_arrayc(c);
  187. system("pause");
  188. return 0;
  189. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement