Pagini recente » Cod sursa (job #2096148) | Cod sursa (job #890184) | Cod sursa (job #332533) | Cod sursa (job #1290096) | Cod sursa (job #1743988)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("inundatii.in");
ofstream cout("inundatii.out");
const int MAXN = 50000;
int x[1 + MAXN], y[1 + MAXN], z[1 + MAXN];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> z[i];
long long answer = 0;
for (int i = 1; i <= n; i++) {
answer += abs(x[n / 2 + 1] - n / 2 - 1 + i - x[i]);
answer += abs(y[n / 2 + 1] - n / 2 - 1 + i - y[i]);
answer += abs(z[n / 2 + 1] - n / 2 - 1 + i - z[i]);
}
cout << answer << "\n";
return 0;
}