1 solutions
-
0
C :
#include <stdio.h> int FindMax(int p[][3], int m, int n, int *pRow, int *pCol); int main() { int a[2][3],i,j,row,col,max; for(i=0;i<2;i++) for(j=0;j<3;j++) scanf("%d",&a[i][j]); max=FindMax(a,2,3,&row,&col); printf("Max=%d,Row=%d,Col=%d",max,row,col); } int FindMax(int p[][3], int m, int n, int *pRow, int *pCol) { int *max,i,j; max=p[0]; *pRow=0; *pCol=0; for(i=0;i<m;i++) for(j=0;j<n;j++) { if(*max<p[i][j]) { *max=p[i][j]; *pRow=i; *pCol=j; } } return (*max); }
- 1
Information
- ID
- 17604
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By