我想用C++语言写一个程序,只要我输入一个方阵,它就能找出方阵中每列中的最小元素及其所在的行号,并将这些最小元素中的最大值与最小值技巧行列号输出。你能帮我写这个代码嘛
时间: 2024-04-29 13:23:08 浏览: 60
当然可以!以下是C语言的代码实现:
```c
#include <stdio.h>
#define MAX_SIZE 100
int main()
{
int matrix[MAX_SIZE][MAX_SIZE];
int row, col, i, j, min, max, index;
printf("Please input the size of the matrix (less than %d): ", MAX_SIZE);
scanf("%d", &row);
// Ensure the column number is equal to the row number
col = row;
printf("Please input the %d x %d matrix:\n", row, col);
for(i = 0; i < row; i++)
for(j = 0; j < col; j++)
scanf("%d", &matrix[i][j]);
// Initialize the values of min and max
min = matrix[0][0];
max = matrix[0][0];
// Find the minimum elements in each column
for(i = 0; i < col; i++)
{
min = matrix[0][i];
index = 0;
for(j = 1; j < row; j++)
{
if(matrix[j][i] < min)
{
min = matrix[j][i];
index = j;
}
}
// Determine the maximum and minimum of the minimums
if(min > max)
max = min;
else if(min < max)
continue;
// Print the result
printf("The minimum element in column %d is %d, located in row %d\n", i+1, min, index+1);
}
printf("The maximum of the minimums is %d\n", max);
return 0;
}
```
希望能帮到你!