Repository navigation
Expand file tree
/
Copy pathbiendoimatran.cpp
More file actions
77 lines (72 loc) · 1.58 KB
/
Copy pathbiendoimatran.cpp
File metadata and controls
77 lines (72 loc) · 1.58 KB
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
#include <bits/stdc++.h>
using namespace std;
void input(int m, int n, int a[][105])
{
for(int i = 0; i < m; i++)
for(int j = 0; j < n; j++)
cin >> a[i][j];
}
int sum_col(int m, int n, int a[][105], int col)
{
int sum = 0;
for(int i = 0; i < m; i++)
sum += a[i][col];
return sum;
}
int sum_row(int m, int n, int a[][105], int row)
{
int sum = 0;
for(int i = 0; i < n; i++)
sum += a[row][i];
return sum;
}
void find_min(int m, int n, int a[][105])
{
int min_row = 0, value_row = sum_row(m, n, a, 0);
int min_col = 0, value_col = sum_col(m, n, a, 0);;
for(int i = 1; i < n; i++)
{
int sum = sum_row(m, n, a, i);
if(value_row >= sum) value_row = sum, min_row = i;
}
for(int i = 1; i < m; i++)
{
int sum = sum_col(m, n, a, i);
if(value_col >= sum) value_col = sum, min_col = i;
}
a[min_row][min_col]++;
}
int check(int m , int n, int a[][105])
{
int value_row = sum_row(m, n, a, 0);
int value_col = sum_col(m, n, a, 0);;
for(int i = 1; i < n; i++)
{
int sum = sum_row(m, n, a, i);
if(value_row != sum) return 0;
}
for(int i = 1; i < m; i++)
{
int sum = sum_col(m, n, a, i);
if(value_col != sum) return 0;
}
return 1;
}
int main()
{
int t;
cin >> t;
while(t--)
{
int m, n, a[105][105], cnt = 0;
cin >> m ;
n = m;
input(m, n, a);
while(!check(m, n, a))
{
find_min(m , n, a);
cnt++;
}
cout << cnt << endl;
}
}