Pagini recente » Cod sursa (job #2618726) | Cod sursa (job #2834658) | Cod sursa (job #222943) | Cod sursa (job #2311041) | Cod sursa (job #1491899)
#include <fstream>
using namespace std;
ifstream fin("inundatii.in");
ofstream fout("inundatii.out");
int n;
long long solution;
struct bloc
{
int x;
int y;
int z;
}v[50010];
long long abs(int x)
{
if(x < 0)
return -x;
return x;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i].x >> v[i].y >> v[i].z;
for(int i = 1; i <= n; i ++)
{
solution += abs(v[i].x - (v[n/2 + 1].x - n/2 - 1 + i));
solution += abs(v[i].y - (v[n/2 + 1].y - n/2 - 1 + i));
solution += abs(v[i].z - (v[n/2 + 1].z - n/2 - 1 + i));
}
fout << solution;
return 0;
}