#include <stdio.h>
#include <string.h>

main ()
{
char a[2][80], t;
int r, j, m, n, L, max;

for (r = 0; r <= 1; r++)
gets (a[r]);
t = a[0][0];

for (r = 0; r <= 1; r++)
{
L = strlen (a[r]);
for (j = 0; j <= L; j++)
if (a[r][j] > t)
{
max = a[r][j];
max = t;
m = r;
n = j;
}
}
printf ("max=%c row=%d colum=%d\n", max, m, n);
getch ();
return 0;
}

输出结果不对?

#include <stdio.h>
#include <conio.h>
#define N 3
#define M 30

int main(void)
{
char str[N][M], ch;
int i, j, row = 0, column = 0;

for (i = 0; i < N; i++)
{
gets(str[i]);
}

ch = str[row][column];

for (i = 0; i < N; i++)
{
for (j = 0; str[i][j] != '\0'; j++)
{
if (str[i][j] > ch)
{
ch = str[i][j];
row = i;
column = j;
}
}
}

printf("ch = %c\n", ch);
printf("row = %d\n", row);
printf("column = %d\n", column);

getch();
return 0;
}

#include <stdio.h>
#include <conio.h>

main ()
{
char a[2][80], t;
int r, j, m = 0, n = 0;

for (r = 0; r <= 1; r++)
gets (a[r]);
t = a[m][n];

for (r = 0; r <= 1; r++)
{
for (j = 0; a[r][j] != '\0'; j++)
if (a[r][j] > t)
{
t = a[r][j];
m = r;
n = j;
}
}
printf ("max=%c row=%d colum=%d\n", t, m, n);

getch ();
return 0;
}

[此贴子已经被作者于2006-5-9 18:40:16编辑过]

只是对 论坛 那位兄弟的程序进行了针对性整理,这会应该没问题拉!
但可能不是很精练!

#include <stdio.h>
#include <conio.h>

main ()
{
char a[2][80], t;
int r, j, m = 0, n = 0;

for (r = 0; r <= 1; r++)
gets (a[r]);
t = a[m][n];

for (r = 0; r <= 1; r++)
{
for (j = 0; a[r][j] != '\0'; j++)
if (a[r][j] > t)
{
t = a[r][j];
}
}
printf ("max='%c' :\n", t);
for (r = 0; r <= 1; r++)
{
for (j = 0; a[r][j] != '\0'; j++)
if (a[r][j]==t)
{
m = r;
n = j;
printf (" row=%d colum=%d\n", m, n);
}
}
getch ();
return 0;
}