easy

#include<bits/stdc++.h>
using namespace std;
int n,x,y;
int g[105][105]; //螺旋数组
int main(){
cin>>n>>x>>y;
int num=2; //计数
int a=1,b=1; //横纵坐标
g[1][1]=1;
while(num<=n*n){
while(b+1<=n && g[a][b+1]==0){
g[a][b]=num;
}
while(a+1<=n && g[a+1][b]==0){
g[a][b]=num;
}
while(b-1>=1 && g[a][b-1]==0){
g[a][--b]=num++;
}
while(a-1>=1 && g[a-1][b]==0){
g[--a][b]=num++;
}
}
cout<<g[x][y];
return 0;
}