Bài tâp: Nhâp ma trân A: N hàng, M cot:

Tìm các hàng có tông lon nhât.

*/

#include<stdio.h>

#include<stdlib.h>

#include<conio.h>

void Nhapmatran(int N, int M, float *a){

int i, j, k=0;

if(a != NULL){

printf("Ban hay nhap ma tran theo thu tu tung hang:

");

for(i=0; i<N; i++){

printf("Hang thu %d:

", i+1);

for(j=0; j<M; j++){

scanf("%f", &a[k]);

k++;

}

}

}

}

void Inmatran(int N, int M, float *a){

int i, j;

printf("Ma tran ban vua nhap la:

");

for(i=0; i<N; i++){

for(j=0; j<M; j++){

printf("%.2f\t", a[i*M+j]);

}

printf("

");

}

}

void Maxtonghang(int N, int M, float *a){

int i, j, k = 0;

int d=0;

float Maxtong, tong=0;

float *b, temp;

b = malloc(N*sizeof(float));

for(i=0; i<N*M; i+=M){

for(j=i; j<(k+1)*M; j++){

tong = tong + a[j];

}

b[k] = tong;

k++;

tong = 0;

}

Maxtong = 0;

for(i=0; i<N; i++){

if(b[i]>Maxtong){

Maxtong = b[i];

d=i+1;

}

}

printf("Hang %d co tong lon nhat la: %.2f!", d, Maxtong);

}

main()

{

int N, M;

float *a;

printf("Ban muon nhap ma tran co bao nhieu hang?

");

scanf("%d", &N);

printf("Bao nhieu cot?

");

scanf("%d", &M);

a = malloc(M*N*sizeof(float));

Nhapmatran(N, M, a);

Inmatran(N, M, a);

Maxtonghang(N, M, a);

getch();

free(a);

return 0;

}