-
Notifications
You must be signed in to change notification settings - Fork 0
/
loaibohangvacotcotonglonnhatra.c
83 lines (83 loc) · 1.67 KB
/
loaibohangvacotcotonglonnhatra.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <stdio.h>
void nhapmang(int m, int n, int a[][10])
{
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
void inmang(int m, int n, int a[][10])
{
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
printf("%d ", a[i][j]);
printf("\n");
}
}
int tongmaxdong(int m, int n, int a[][10])
{
int max = 0, vitri;
for (int i = 0; i < m; i++)
{
int sum = 0;
for (int j = 0; j < n; j++)
{
sum += a[i][j];
}
if (max < sum)
max = sum, vitri = i;
}
return vitri;
}
int tongmaxcot(int n, int m, int a[][10])
{
int max = 0, vitri;
for (int i = 0; i < n; i++)
{
int sum = 0;
for (int j = 0; j < m; j++)
{
sum += a[j][i];
}
if (max < sum)
max = sum, vitri = i;
}
return vitri;
}
int loaibodong(int m, int n, int a[][10])
{
int b = tongmaxdong(m, n, a);
for (int i = 0; i < n; i++)
for (int j = b; j < m - 1; j++)
{
a[j][i] = a[j + 1][i];
}
}
int loaibocot(int m, int n, int a[][10])
{
int b = tongmaxcot(n, m, a);
for (int i = 0; i < m; i++)
for (int j = b; j < n - 1; j++)
{
a[i][j] = a[i][j + 1];
}
}
int main()
{
int t, c = 0;
scanf("%d", &t);
while (c < t)
{
int n, m;
scanf("%d%d", &m, &n);
int a[10][10];
nhapmang(m, n, a);
loaibodong(m, n, a);
loaibocot(m - 1, n, a);
printf("Test %d:\n", c + 1);
inmang(m - 1, n - 1, a);
printf("\n");
c++;
}
return 0;
}