Submission #60735502

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 2e5 + 7;
const double PI = acos(-1), eps = 1e-7;
int a[10];
struct node {
    string s;
    int cnt;
};
vector<node> v;
bool cmp(node l1, node l2) {
    if (l1.cnt == l2.cnt)
        return l1.s < l2.s;
    return l1.cnt > l2.cnt;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 2e5 + 7;
const double PI = acos(-1), eps = 1e-7;

int a[10];
struct node {
    string s;
    int cnt;
};
vector<node> v;

bool cmp(node l1, node l2) {
    if (l1.cnt == l2.cnt)
        return l1.s < l2.s;
    return l1.cnt > l2.cnt;
}

void dfs(int idx, int m, int cnt, string s) {
    if (m != 0)
        v.push_back({s, cnt});
    if (m == 5)
        return;
    for (int i = idx; i <= 5; i++) {
        dfs(i + 1, m + 1, cnt + a[i], s + char('A' + i - 1));
    }
}

void solve() {
    for (int i = 1; i <= 5; i++) {
        cin >> a[i];
    }
    dfs(1, 0, 0, "");
    sort(v.begin(), v.end(), cmp);
    for (auto i: v) {
        cout << i.s << '\n';
    }
}

int main() {
    std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result