for(i=0;i<4;i++)
for(j=0;j<5;j++)
{
if(a[i][j]{
temp[i]=a[i][j];
row[i]=i;
col[i]=j;
}
else
{
temp[i]=a[i][j+1];
row[i]=i;
col[i]=j+1;
}
}
这是找出每行最小值及其行列标,之后你从temp中找到最小值就行了,对应的i输出row[i],col[i],
即行列标
谢谢采纳
int nArray[4][6] = {0};
int nMin = 0;
for (int i = 0; i<4; ++i) {
for (int j = 0; j<6; ++j) {
scanf("%d", &nArray[i][j]);
if ((!i && !j) || nMin>nArray[i][j]) {
nMin = nArray[i][j];
}
}
}
printf("The min intiger is : %d", nMin);
for (int i = 0; i<4; ++i) {
for (int j = 0; j<6; ++j) {
if (nArray[i][j] == nMin) {
printf("The min index is : [%d][%d]", i, j);
}
}
}
鉴于最小元素可能不只一个,所以采用循环输出