Pagini recente » Cod sursa (job #2392139) | Cod sursa (job #3221114) | Cod sursa (job #2443318) | Cod sursa (job #205867) | Cod sursa (job #1498746)
#include <cstdio>
#include <algorithm>
#define DIM 51000
using namespace std;
int N, sum; long long val;
int X[DIM], Y[DIM], Z[DIM];
int main ()
{
freopen ("inundatii.in" ,"r", stdin );
freopen ("inundatii.out","w", stdout);
scanf ("%d", &N);
for (int i = 1; i <= N; i ++)
{
scanf ("%d", &X[i]);
scanf ("%d", &Y[i]);
scanf ("%d", &Z[i]);
}
for (int i = 1; i <= N; i ++)
{
val += abs (X[N / 2 + 1] - N / 2 - 1 + i - X[i]);
val += abs (Y[N / 2 + 1] - N / 2 - 1 + i - Y[i]);
val += abs (Z[N / 2 + 1] - N / 2 - 1 + i - Z[i]);
}
printf ("%lld\n", val);
fclose (stdin );
fclose (stdout);
return 0;
}