Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void maxminsum(float a[][15], int& n, int& m)
- {
- int indexMax = 0, indexMin = 0;
- int countMaxOtr = 0, countMaxPol = 0, maxotr = 0, maxpol = 0;
- for (int j = 0; j < m; j++)
- {
- countMaxOtr = 0, countMaxPol = 0;
- for (int i = 0; i < m; i++)
- {
- if (a[i][j] < 0)
- {
- countMaxOtr++;
- }
- else{
- countMaxPol++;
- }
- }
- if (countMaxOtr > maxotr)
- {
- maxotr = countMaxOtr;
- indexMin = j;
- }
- if (countMaxPol > maxpol)
- {
- maxpol = countMaxPol;
- indexMax = j;
- }
- }
- for (int i = 0; i < n; i++)
- {
- float b = a[i][indexMax];
- a[i][indexMax] = a[i][indexMin];
- a[i][indexMin] = b;
- }
- printf_s("Number stolba = %d , kol-vo otr = %d number stolba = %d , kol-vo pol = %d", indexMin + 1, maxotr, indexMax + 1, maxpol);
- }
- int main()
- {
- srand(time(NULL));
- float a[10][15];
- int n, m;
- scanf_s("%d %d", &n, &m);
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m;j++)
- {
- a[i][j] = rand() % 20000-10000;
- a[i][j] = a[i][j] / 100.0;
- printf_s("% 4.2f ", a[i][j]);
- }
- printf_s("\n");
- }
- printf_s("\n");
- maxminsum(a, n, m);
- printf_s("\n");
- printf_s("\n");
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- printf_s("% 4.2f ", a[i][j]);
- }
- printf_s("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment