解题思路:
注意事项:
参考代码:import java.util.Scanner;
public class 格子位置 {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int p=in.nextInt();int p1=p;
int q=in.nextInt();int q1=q;
for(int i=1;i<=n;i++){//同一行
System.out.print("(" + p + "," + i + ")");
}
System.out.println();
for(int i=1;i<=n;i++){
System.out.print("(" + i + "," + q + ")");
}
System.out.println();
while(true){
if(p>1&&q>1){
--p;--q;}
else break;
}
while(p<=n&&q<=n){
System.out.print("(" + p + "," + q +")");
p++;q++;
}
System.out.println();
while(true){
if(p11){
++p1;--q1;}
else break;
}
while(p1>=1&&q1<=n){
System.out.print("(" + p1+","+q1+")");
p1--;q1++;
}
}
}