#include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n = 18; vector<int> a, b; int sa = 0, sb = 0; REP (i, n) { int x; cin >> x; sa += x; a.emplace_back(x); } REP (i, n) { int x; cin >> x; sb += x; b.emplace_back(x); } if (sa > sb) cout << "Algosia\n"; else if (sa < sb) cout << "Bajtek\n"; else { sort(a.rbegin(), a.rend()); sort(b.rbegin(), b.rend()); if (a > b) cout << "Algosia\n"; else if (a < b) cout << "Bajtek\n"; else cout << "remis\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; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n = 18; vector<int> a, b; int sa = 0, sb = 0; REP (i, n) { int x; cin >> x; sa += x; a.emplace_back(x); } REP (i, n) { int x; cin >> x; sb += x; b.emplace_back(x); } if (sa > sb) cout << "Algosia\n"; else if (sa < sb) cout << "Bajtek\n"; else { sort(a.rbegin(), a.rend()); sort(b.rbegin(), b.rend()); if (a > b) cout << "Algosia\n"; else if (a < b) cout << "Bajtek\n"; else cout << "remis\n"; } } |