【模拟】洛谷P2239 螺旋矩阵

链接

https://www.luogu.org/problemnew/show/P2239

---

大意

求一个$n\times n$的螺旋矩阵的第$i$行，第$j$个

---

思路

直接递归

---

代码

#include<cstdio>
using namespace std;int n,i,j;
inline int work(register int n,register int i,register int j) 
{
    if(i==1)return j;
    if(j==n)return n+i-1;
    if(i==n)return n*3-j-1;
    if(j==1)return n*4-i-2;
    return work(n-2,i-1,j-1)+(n-1)*4;
}
signed main()
{
    scanf("%d%d%d",&n,&i,&j);
    printf("%d",work(n,i,j));
}