#include<bits/stdc++.h> using namespace std; /* */ # define int int64_t const int64_t mod = 1e9+7; const int maxn = 1e6+10; int a[2][maxn]; int s[2]; int cnt[2][maxn]; int n; void tc() { for (int t = 0; t <= 1; t++) { for (int i = 1; i <= n; i++) { cin >> a[t][i]; s[t] += a[t][i]; cnt[t][a[t][i]]++; } } if (s[0] > s[1]) { cout << "Algosia" << endl; return; } if (s[0] < s[1]) { cout << "Bajtek" << endl; return; } for (int i = 10; i >= 0; i--) { if (cnt[0][i] > cnt[1][i]) { cout << "Algosia" << endl; return; } if (cnt[0][i] < cnt[1][i]) { cout << "Bajtek" << endl; return; } } cout << "remis" << endl; return; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); n = 18; tc(); return 0; int T; cin >> T; while (T--) tc(); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 | #include<bits/stdc++.h> using namespace std; /* */ # define int int64_t const int64_t mod = 1e9+7; const int maxn = 1e6+10; int a[2][maxn]; int s[2]; int cnt[2][maxn]; int n; void tc() { for (int t = 0; t <= 1; t++) { for (int i = 1; i <= n; i++) { cin >> a[t][i]; s[t] += a[t][i]; cnt[t][a[t][i]]++; } } if (s[0] > s[1]) { cout << "Algosia" << endl; return; } if (s[0] < s[1]) { cout << "Bajtek" << endl; return; } for (int i = 10; i >= 0; i--) { if (cnt[0][i] > cnt[1][i]) { cout << "Algosia" << endl; return; } if (cnt[0][i] < cnt[1][i]) { cout << "Bajtek" << endl; return; } } cout << "remis" << endl; return; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); n = 18; tc(); return 0; int T; cin >> T; while (T--) tc(); return 0; } |