Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdlib.h>
- #include <stdio.h>
- #include <math.h>
- int main()
- {
- int n, m, i, j, temp, exnum, min, min_i, min_j, ex_i, ex_j;
- printf("n = ");
- scanf("%d", &n);
- printf("m = ");
- scanf("%d", &m);
- int **x;
- x = (int **)malloc(n*sizeof(int *));
- for (i = 0; i< n; i++)
- x[i] = (int*)malloc(m*sizeof(int));
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < m; j++)
- {
- printf("x[%d][%d] = ", i, j);
- scanf("%d", &x[i][j]);
- }
- }
- for (i = 0; i< n; i++)
- {
- for (j = 0; j < m; j++)
- printf("%d ", x[i][j]);
- printf("\n");
- }
- printf("Enter the number for exchange: ");
- scanf("%d", &exnum);
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < m; j++)
- if (x[i][j] == exnum)
- {
- ex_i = i;
- ex_j = j;
- break;
- }
- if (j < m)
- break;
- }
- if (i == n)
- {
- printf("Number does not exist");
- return 0;
- }
- min = x[0][0];
- for (i = 0; i < n; i++)
- for (j = 0; j < m; j++)
- if (min > x[i][j])
- {
- min = x[i][j];
- min_i = i;
- min_j = j;
- }
- printf("min = %d\n", min);
- temp = x[min_i][min_j];
- x[min_i][min_j] = x[ex_i][ex_j];
- x[ex_i][ex_j] = temp;
- for (i = 0; i< n; i++)
- {
- for (j = 0; j < m; j++)
- printf("%d ", x[i][j]);
- printf("\n");
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment