Guest User

Untitled

a guest
Jan 10th, 2020
120
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.28 KB | None | 0 0
  1. void maxminsum(float a[][15], int& n, int& m)
  2. {
  3. int indexMax = 0, indexMin = 0;
  4. int countMaxOtr = 0, countMaxPol = 0, maxotr = 0, maxpol = 0;
  5. for (int j = 0; j < m; j++)
  6. {
  7. countMaxOtr = 0, countMaxPol = 0;
  8. for (int i = 0; i < m; i++)
  9. {
  10. if (a[i][j] < 0)
  11. {
  12. countMaxOtr++;
  13. }
  14. else{
  15. countMaxPol++;
  16. }
  17. }
  18. if (countMaxOtr > maxotr)
  19. {
  20. maxotr = countMaxOtr;
  21. indexMin = j;
  22. }
  23. if (countMaxPol > maxpol)
  24. {
  25. maxpol = countMaxPol;
  26. indexMax = j;
  27. }
  28. }
  29. for (int i = 0; i < n; i++)
  30. {
  31. float b = a[i][indexMax];
  32. a[i][indexMax] = a[i][indexMin];
  33. a[i][indexMin] = b;
  34. }
  35. printf_s("Number stolba = %d , kol-vo otr = %d number stolba = %d , kol-vo pol = %d", indexMin + 1, maxotr, indexMax + 1, maxpol);
  36. }
  37.  
  38. int main()
  39. {
  40. srand(time(NULL));
  41. float a[10][15];
  42. int n, m;
  43. scanf_s("%d %d", &n, &m);
  44. for (int i = 0; i < n; i++)
  45. {
  46. for (int j = 0; j < m;j++)
  47. {
  48. a[i][j] = rand() % 20000-10000;
  49. a[i][j] = a[i][j] / 100.0;
  50. printf_s("% 4.2f ", a[i][j]);
  51. }
  52. printf_s("\n");
  53. }
  54. printf_s("\n");
  55.  
  56. maxminsum(a, n, m);
  57.  
  58. printf_s("\n");
  59. printf_s("\n");
  60. for (int i = 0; i < n; i++) {
  61. for (int j = 0; j < m; j++) {
  62. printf_s("% 4.2f ", a[i][j]);
  63. }
  64. printf_s("\n");
  65. }
  66. return 0;
  67. }
Advertisement
Add Comment
Please, Sign In to add comment