Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <locale.h>
- #include <malloc.h>
- #include <time.h>
- void fillArray(int** arr, int n, int m);
- void showArray(int** arr, int n, int m);
- //void push_back(int**& arr, int n, int m);
- void removeColumn(int** arr, int n, int m);
- int main()
- {
- setlocale(0, "rus");
- srand(time(NULL));
- int i = 0, j = 0;
- const int n = 5, m = 7, o = 7, p = 7;
- int** A = (int**)malloc(n * sizeof(int*));
- if (A == NULL) exit(1);
- if (A)
- {
- for (i = 0; i < n; ++i)
- A[i] = (int*)malloc(m * sizeof(int));
- }
- int** B = (int**)malloc(o * sizeof(int*));
- if (B == NULL) exit(1);
- if (B)
- {
- for (i = 0; i < o; ++i)
- B[i] = (int*)malloc(p * sizeof(int));
- }
- printf("Массив А до изменений:\n");
- fillArray(A, n, m);
- showArray(A, n, m);
- printf("\n");
- printf("Массив B до изменений:\n");
- fillArray(B, o, p);
- showArray(B, o, p);
- printf("Массив А после изменений:\n");
- for (int k = 0; k < m; ++k)
- removeColumn(A, n, m);
- showArray(A, n, m);
- printf("Массив B после изменений:\n");
- }
- void fillArray(int** arr, int n, int m)
- {
- srand(time(NULL));
- for (int i = 0; i < n; ++i)
- for (int j = 0; j < m; ++j)
- {
- arr[i][j] = 5 - rand() % 10;
- }
- }
- void showArray(int** arr, int n, int m)
- {
- for (int i = 0; i < n; ++i)
- {
- for (int j = 0; j < m; ++j)
- {
- printf("%i\t", arr[i][j]);
- }
- printf("\n");
- }
- }
- /*void push_back(int**& arr, int n, int m)
- {
- int** tempArray = (int**)malloc(n * sizeof(int*));
- if (tempArray == NULL) exit(1);
- if (tempArray)
- {
- for (int i = 0; i < n; ++i)
- tempArray[i] = (int*)malloc(m * sizeof(int));
- }
- for (int i = 0; i < n; ++i)
- for (int j = 0; j < m; ++j)
- if (tempArray[j])
- {
- tempArray[j][i] = arr[j][i];
- }
- for (int i = 0; i < n; ++i)
- for (int j = 0; j < m; ++j)
- if (tempArray[j])
- {
- arr[j][i] = tempArray[j][i];
- }
- }*/
- void removeColumn(int** arr, int n, int m)
- {
- m--;
- int count = 0;
- for (int i = 0; i < m; ++i)
- {
- for (int k = 0; k < n; ++k)
- {
- if (arr[k][i] < 0)
- count++;
- }
- if (count >= 2)
- {
- while (int j = 0 < m)
- {
- arr[i][j] = arr[i][j + 1];
- j++;
- }
- arr[i] = (int*)realloc(*&arr[i], sizeof(double) * m);
- count = 0;
- }
- else count = 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement