Pagini recente » Cod sursa (job #677052) | Cod sursa (job #1957840) | Cod sursa (job #2419627) | Cod sursa (job #1473923) | Cod sursa (job #126065)
Cod sursa(job #126065)
#include <stdio.h>
int X[50000],Y[50000],Z[50000],n;
int abs (int x) { return (x>0)?(x):(-x);}
long long Solve ( int* X , int x )
{
long long d = X[n/2], r=0 ,i;
for ( i=0 ; i<n ; i++ ) r+= abs (X[i]-d);
return r;
}
int main ()
{
int i,x=0,y=0,z=0;
freopen ( "inundatii.in" , "r" , stdin );
scanf ( "%d" , &n );
for ( i=0 ; i<n ; i++ )
{
scanf ( "%d %d %d" , &X[i] , &Y[i] , &Z[i] );
X[i]-=i; Y[i]-=i; Z[i]-=i;
x+=X[i]; y+=Y[i]; z+=Z[i];
}
fclose ( stdin );
long long r = Solve ( X , x );
r += Solve ( Y , y );
r += Solve ( Z , z );
freopen ( "inundatii.out" , "w" , stdout );
printf ( "%ld\n" , r );
fclose ( stdout );
return 0;
}