Untitled
unknown
plain_text
10 months ago
972 B
12
Indexable
#include <iostream>
using namespace std;
int main() {
// your code here
int T;
cin >> T;
for (int tc = 0; tc < T; tc++) {
int n, m, k;
int arr[1005][1005] = {0};
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
int x = 0;
int y = 0;
int min = k;
int value = k;
for (int i = 0; i < n - (m - 1); i++) {
for (int j = 0; j < n - (m - 1); j++) {
int sum = 0;
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
sum += arr[i+p][j+q];
}
}
int d = k - sum;
if (d < 0) d *= -1;
if (d < min) {
min = d;
x = i;
y = j;
value = sum;
} else if (d == min) {
if (value < sum) {
x = i;
y = j;
value = sum;
} else if (value == sum) {
if (i <= x && j <= y) {
x = i;
y = j;
}
}
}
}
}
cout << "#" << (tc + 1) << " " << x << " " << y << endl;
}
return 0;
}Editor is loading...
Leave a Comment