题意:
解法:
最后能够胜利一定是一方走到了另一方的面前,导致对方只能往回走直到角落,
因此判断两人的之间格子数量的奇偶性即可.
code:
#include <bits/stdc++.h>
#define int long long
#define PI pair<int,int>
using namespace std;
const int maxm=2e5+5;
int n,a,b;
void solve(){
cin>>n>>a>>b;
int t=b-a-1;
if(t%2){
cout<<"Alice"<<endl;
}else{
cout<<"Borys"<<endl;
}
}
signed main(){
ios::sync_with_stdio(0);
solve();
return 0;
}