Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- #include <conio.h>
- void NhapMang(int a[50][50], int hang, int cot)
- {
- for(int i=1; i<=hang; i++)
- {
- for(int j=1; j<=cot; j++)
- {
- printf("\nNhap A[%d][%d]: ",i,j);
- scanf("%d",&a[i][j]);
- }
- }
- }
- void InMang(int a[50][50], int hang, int cot)
- {
- for(int i=1; i<=hang; i++)
- {
- for(int j=1; j<=cot; j++)
- {
- printf("\nNhap A[%d][%d]=%d ",i,j,a[i][j]);
- }
- }
- }
- int TongTrenHangChan(int a[50][50], int hang, int cot)
- {
- int s=0;
- for(int i=1; i<=hang; i++)
- {
- if(i%2==0)
- for(int j=1; j<=cot; j++)
- s=s+a[i][j];
- else continue;
- }
- return s;
- }
- void LonNhatTrenTungHang(int a[50][50], int hang, int cot)
- {
- int min[50];
- for(int j=1; j<=cot; j++)
- {
- min[j]=a[1][j];
- for(int i=2; i<=hang; i++)
- {
- if(min[j]<a[i][j])
- min[j]=a[i][j];
- }
- printf("\nSo lon nhat tren hang %d la: %d",j,min[j]);
- }
- }
- void NhoNhatTrenTungCot(int a[50][50], int hang, int cot)
- {
- int max[50];
- for(int i=1; i<=hang; i++)
- {
- max[i]=a[i][1];
- for(int j=2; j<=cot; j++)
- {
- if(max[i]>a[i][j])
- max[i]=a[i][j];
- }
- printf("\nSo nho nhat tren cot %d la: %d",i,max[i]);
- }
- }
- main()
- {
- int a[50][50], hang, cot;
- printf("Nhap so hang va cot: ");
- scanf("%d%d",&hang,&cot);
- NhapMang(a,hang,cot);
- InMang(a,hang,cot);
- printf("Tong tren hang chan la %d", TongTrenHangChan(a,hang,cot));
- LonNhatTrenTungHang(a,hang,cot);
- NhoNhatTrenTungCot(a,hang,cot);
- printf("\n\n\a\a");
- getch();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement