Jakkara

#include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>

using namespace std;

int main() {
    int legs[4];
    for (int i = 0; i < 4; ++i) {
        cin >> legs[i];
    }
    int energy = 0;
    while (!(legs[0] == legs[1] && legs[0] == legs[2] && legs[0] == legs[3])) {
        double highest = 0.0;
        double avg = ((double)legs[0] + legs[1] + legs[2] + legs[3]) / 4;
        int highestLeg = 0;
        for (int i = 0; i < 4; ++i) {
            double dist = abs(avg-legs[i]);
            if (dist > highest) {
                highest = dist;
                highestLeg = i;
            }
        }
        int newLength = legs[highestLeg] < avg ? ceil(avg) : floor(avg);
        int dist = abs(legs[highestLeg] - newLength);
        legs[highestLeg] = newLength;
        energy += dist;
    }

    cout << energy << endl;
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED