-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Binary_Array_Game.cpp
More file actions
56 lines (42 loc) · 1 KB
/
A_Binary_Array_Game.cpp
File metadata and controls
56 lines (42 loc) · 1 KB
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
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define forn(i, k, n) for(ll i = k; i < n; i++)
#define pyes cout<<"YES"<<endl;return
#define pno cout<<"NO"<<endl;return
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int INF = 1e9;
const ll mod = 1000000007;
//The only verdict is vengeance; a vendetta, held as a votive, not in vain, for the value and veracity of such shall one day vindicate the vigilant and the virtuous.
void solve(){
ll n;
cin>>n;
int o = 0, z = 0;
vll arr(n);
forn(i,0,n) {cin>>arr[i];
if(arr[i]==0)
z++;
else
o++;
}
if(arr[0]==arr[n-1] && arr[0] == 0){
cout<<"Bob"<<endl;
return;
}
cout<<"Alice"<<endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}