B. Polo the Penguin and Matrix:题目
思路:纯暴力
#include <bits/stdc++.h>
using namespace std;
// #define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c((int)6e5);
const int mod = 1e9 + 7;
int g[111][111];
signed main()
{
int n, m, d;
cin >> n >> m >> d;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
cin >> g[i][j];
}
}
int sum = 0x3f3f3f3f;
for (int i = 1; i <= 10000; i ++)
{
int h = i;
int ff = 1;
int res = 0;
for (int k = 1; k <= n; k++)
{
for (int kk = 1; kk <= m; kk++)
{
int cha = abs(g[k][kk] - h);
if (cha % d == 0)
res += cha / d;
else
ff = 0;
}
}
if (ff)
sum = min(sum, res);
}
if (sum == 0x3f3f3f3f)
cout << -1 << endl;
else
cout << sum << endl;
}