Advertisement
Guest User

Untitled

a guest
Jan 18th, 2020
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.07 KB | None | 0 0
  1. int main()
  2. {
  3. int **mas;
  4. int m, n;
  5. int max = 0, min = 0, sum = 0;
  6. while(m < 0 || m >= 100 || n < 0 || n >= 10)
  7. printf("Enter quantity of referees and athletes: ");
  8. scanf("%d %d", &n, &m);
  9. mas = (int**)malloc(sizeof(int) * n);
  10. for (int i = 0; i < n; i++)
  11. {
  12. mas[i] = (int*)malloc(sizeof(int) * m);
  13. }
  14. for (int i = 0; i < n; i++)
  15. {
  16. printf("\n%d-athlet:\n", i);
  17. for (int j = 0; j < m; j++)
  18. {
  19. scanf("%d", mas[i][j]);
  20. }
  21. }
  22. for (int i = 0; i < n; i++)
  23. {
  24. for (int j = 0; j < m; j++)
  25. {
  26. if (max == 0 && min == 0)
  27. {
  28. max = mas[i][j];
  29. min = mas[i][j];
  30. }
  31. if (mas[i][j] > max)
  32. {
  33. max = mas[i][j];
  34. }
  35. if (mas[i][j] < min)
  36. {
  37. min = mas[i][j];
  38. }
  39. }
  40. for (int j = 0; j < m; j++)
  41. {
  42. if (mas[i][j] == max || mas[i][j] == min)
  43. {
  44. mas[i][j] = 0;
  45. }
  46. }
  47. max = 0;
  48. min = 0;
  49. }
  50. int k = 0;
  51. for (int i = 0; i < n; i++)
  52. {
  53. for (int j = 0; j < m; j++)
  54. {
  55. if (mas[i][j] != 0)
  56. {
  57. k++;
  58. }
  59. sum += mas[i][j];
  60. }
  61. printf("%d ", sum / k);
  62. k = 0;
  63. sum = 0;
  64. }
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement