Pagini recente » Cod sursa (job #3130266) | Atasamentele paginii Clasament oji_2020_official | Cod sursa (job #2600881) | Cod sursa (job #977993) | Cod sursa (job #2968368)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inundatii.in");
ofstream fout("inundatii.out");
const int maxN = 50005;
int n, v[maxN][3];
long long ans;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 0; j < 3; j++)
fin >> v[i][j];
int m = n/2 + 1;
for(int i = 1; i < m; i++)
for(int j = 0; j < 3; j++)
ans += (v[i][j] - v[m][j] + (m - i));
for(int i = m + 1; i <= n; i++)
for(int j = 0; j < 3; j++)
ans += (v[m][j] - v[i][j] + (i - m));
fout << ans;
return 0;
}