#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set; void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifndef ONLINE_JUDGE #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif using ll=long long; #define all(a) a.begin(), a.end() // long longi bool cmp(int a, int b){ return a > b; } int main(){ ios_base::sync_with_stdio(0); cin.tie(nullptr); vector<int> a(18), b(18); for(auto& x : a) cin >> x; for(auto& x : b) cin >> x; vector<int> aa(11), bb(11); for(auto x : a) aa[x]++; for(auto x : b) bb[x]++; int sum1 = 0, sum2 = 0; for(auto x : a) sum1 += x; for(auto x : b) sum2 += x; if(sum1 == sum2){ for(int i = 10; i; i--){ if(aa[i] != bb[i]){ cout << (aa[i] > bb[i] ? "Algosia" : "Bajtek") << "\n"; return 0; } } cout << "remis\n"; }else{ cout << (sum1 > sum2 ? "Algosia" : "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 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | #include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set; void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifndef ONLINE_JUDGE #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif using ll=long long; #define all(a) a.begin(), a.end() // long longi bool cmp(int a, int b){ return a > b; } int main(){ ios_base::sync_with_stdio(0); cin.tie(nullptr); vector<int> a(18), b(18); for(auto& x : a) cin >> x; for(auto& x : b) cin >> x; vector<int> aa(11), bb(11); for(auto x : a) aa[x]++; for(auto x : b) bb[x]++; int sum1 = 0, sum2 = 0; for(auto x : a) sum1 += x; for(auto x : b) sum2 += x; if(sum1 == sum2){ for(int i = 10; i; i--){ if(aa[i] != bb[i]){ cout << (aa[i] > bb[i] ? "Algosia" : "Bajtek") << "\n"; return 0; } } cout << "remis\n"; }else{ cout << (sum1 > sum2 ? "Algosia" : "Bajtek") << "\n"; } } |