Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Viet chuong trinh in ra phan tu co gia tri lon nhat tron dong ma nho nhat tren cot
- #include <stdio.h>
- void nhap (int &m, int &n, int A[][100]);
- int minCot (int m, int n, int A[][100], int viTriCot, int viTriDong);
- void xuLy (int m, int n, int A[][100]);
- void main ()
- {
- int A[100][100];
- int m,n;
- nhap (m,n,A);
- xuLy (m,n,A);
- }
- int minCot (int m, int n, int A[][100], int viTriCot, int viTriDong)
- {
- A[viTriDong][viTriCot];
- for (int i=0;i<m;i++)
- {
- if (A[viTriDong][viTriCot]>A[i][viTriCot])
- {
- return 0;
- }
- }
- return 1;
- }
- void xuLy (int m, int n, int A[][100])
- {
- int kt=0;
- int maxDong;
- int viTriCot=0, viTriDong=0;
- for (int i=0;i<m;i++)
- {
- maxDong=A[i][0];
- for (int j=0;j<n;j++)
- {
- if (maxDong<A[i][j])
- {
- viTriCot=j;
- viTriDong=i;
- maxDong=A[i][j];
- }
- }
- if (minCot(m,n,A,viTriCot,viTriDong)==1)
- {
- kt=1;
- printf ("%d ",maxDong);
- }
- }
- if (kt==0)
- {
- printf ("Khong co !\n");
- }
- }
- void nhap (int &m, int &n, int A[][100])
- {
- printf ("Nhap kich thuoc cua ma tran !\n");
- scanf ("%d%d",&m,&n);
- for (int i=0;i<m;i++)
- {
- for (int j=0;j<n;j++)
- {
- scanf ("%d",&A[i][j]);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement