Kulut

#include <bits/stdc++.h>


using namespace std;

bool f(map<char, int> M, int t) {
    for (auto p : M) {
        if (p.second != t) return true;
    }
    return false;
} 

int main() {
    int n;
    map<char, int> M;
    vector<pair<char, pair<char,int>>> v; 
    M['A'] = 0;M['B'] = 0;M['C'] = 0;M['D'] = 0;
    cin >> n;

    int x, t = 0;
    char h;

    for (int i=0; i<n; i++) {
        cin >> h >> x;
        M[h] += x;
        t += x;
    }
    t /= 4;

    while (f(M,t)) {
        pair<char, int> a,b;
        for (auto x : M) {
            if (x.second < t) a = x;
            if (x.second > t) b = x;
        }
        int k = min(b.second - t, t - a.second);
        v.push_back({a.first, {b.first, k}});
        M[a.first] += k;
        M[b.first] -= k;
    }
    cout << v.size() <<"\n";
    for (auto y : v) {
        cout << y.first << " " << y.second.first << " " << y.second.second << "\n";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED