#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define ll long long const ll maxn = 1e2; ll a[maxn], b[maxn]; ll sa, sb; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for(int i = 1; i <= 18; i++){ cin >> a[i]; sa += a[i]; } for(int i = 1; i <= 18; i++){ cin >> b[i]; sb += b[i]; } if(sa == sb){ sort(a + 1, a + 19); sort(b + 1, b + 19); for(int i = 18; i >= 1; i--){ if(a[i] == b[i]) continue; if(a[i] > b[i]){ cout << "Algosia\n"; return 0; } if(b[i] > a[i]){ cout << "Bajtek\n"; return 0; } } cout << "remis\n"; return 0; } if(sa > sb) cout << "Algosia\n"; else cout << "Bajtek\n"; }
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 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second #define ll long long const ll maxn = 1e2; ll a[maxn], b[maxn]; ll sa, sb; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for(int i = 1; i <= 18; i++){ cin >> a[i]; sa += a[i]; } for(int i = 1; i <= 18; i++){ cin >> b[i]; sb += b[i]; } if(sa == sb){ sort(a + 1, a + 19); sort(b + 1, b + 19); for(int i = 18; i >= 1; i--){ if(a[i] == b[i]) continue; if(a[i] > b[i]){ cout << "Algosia\n"; return 0; } if(b[i] > a[i]){ cout << "Bajtek\n"; return 0; } } cout << "remis\n"; return 0; } if(sa > sb) cout << "Algosia\n"; else cout << "Bajtek\n"; } |