#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define st first
#define nd second
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
vector<int> A(12), B(12);
for (int i = 0; i < 18; i++) {
int x; cin >> x;
A[11] += x;
A[x]++;
}
for (int i = 0; i < 18; i++) {
int x; cin >> x;
B[11] += x;
B[x]++;
}
for (int i = 11; i >= 0; i--) {
if (A[i] > B[i]) {
cout << "Algosia\n";
return 0;
}
if (A[i] < B[i]) {
cout << "Bajtek \n";
return 0;
}
}
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 | #include <iostream> #include <vector> #include <algorithm> #include <cmath> #define st first #define nd second typedef long long ll; using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); vector<int> A(12), B(12); for (int i = 0; i < 18; i++) { int x; cin >> x; A[11] += x; A[x]++; } for (int i = 0; i < 18; i++) { int x; cin >> x; B[11] += x; B[x]++; } for (int i = 11; i >= 0; i--) { if (A[i] > B[i]) { cout << "Algosia\n"; return 0; } if (A[i] < B[i]) { cout << "Bajtek \n"; return 0; } } cout << "remis\n"; } |
English