#include<cstdio> #include<algorithm> #include<utility> #include<string> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<cmath> #include<iostream> // macros #define FORE(c, a, b) for(int c=a; c<= int(b); ++c) #define FORD(c, a, b) for(int c=a; c>= int(b); --c) #define FORIT(it, cont, cont_t) for(cont_t::iterator it = cont.begin(); it != cont.end(); ++it) #define REP(i, n) for(int i = 0; i < (n); ++i) #define ALL(a) a.begin(), a.end() #define PR(n) printf("%d ", (int) (n)) #define PRL(n) printf("%lld ", (ll) (n)) #define xx first #define yy second #define pb push_back #define mp make_pair #define itr iterator #define dbg if(1) #define prd dbg printf using namespace std; typedef long long ll; typedef long double ld; typedef unsigned int uint; typedef vector<int> vi; typedef set<int> si; typedef map<int, int> mi; typedef pair<int, int> pi; typedef vector<pi> vii; typedef vector<vi> vvi; // actual code int sum_a, sum_b, x; int main() { vi vec_a(11), vec_b(11); REP(i,18) { scanf("%d", &x); sum_a += x; vec_a[x]++; } REP(i,18) { scanf("%d", &x); sum_b += x; vec_b[x]++; } if (sum_a > sum_b) { printf("Algosia"); return 0; } if (sum_a < sum_b) { printf("Bajtek"); return 0; } FORD(i, 10, 0) { if (vec_a[i] > vec_b[i]) { printf("Algosia"); return 0; } if (vec_a[i] < vec_b[i]) { printf("Bajtek"); return 0; } } printf("remis"); 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 71 72 73 74 75 76 77 78 79 80 81 82 | #include<cstdio> #include<algorithm> #include<utility> #include<string> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<cmath> #include<iostream> // macros #define FORE(c, a, b) for(int c=a; c<= int(b); ++c) #define FORD(c, a, b) for(int c=a; c>= int(b); --c) #define FORIT(it, cont, cont_t) for(cont_t::iterator it = cont.begin(); it != cont.end(); ++it) #define REP(i, n) for(int i = 0; i < (n); ++i) #define ALL(a) a.begin(), a.end() #define PR(n) printf("%d ", (int) (n)) #define PRL(n) printf("%lld ", (ll) (n)) #define xx first #define yy second #define pb push_back #define mp make_pair #define itr iterator #define dbg if(1) #define prd dbg printf using namespace std; typedef long long ll; typedef long double ld; typedef unsigned int uint; typedef vector<int> vi; typedef set<int> si; typedef map<int, int> mi; typedef pair<int, int> pi; typedef vector<pi> vii; typedef vector<vi> vvi; // actual code int sum_a, sum_b, x; int main() { vi vec_a(11), vec_b(11); REP(i,18) { scanf("%d", &x); sum_a += x; vec_a[x]++; } REP(i,18) { scanf("%d", &x); sum_b += x; vec_b[x]++; } if (sum_a > sum_b) { printf("Algosia"); return 0; } if (sum_a < sum_b) { printf("Bajtek"); return 0; } FORD(i, 10, 0) { if (vec_a[i] > vec_b[i]) { printf("Algosia"); return 0; } if (vec_a[i] < vec_b[i]) { printf("Bajtek"); return 0; } } printf("remis"); return 0; } |