package zuoye;
import java.util.Scanner;
public class juzhen {
private static Scanner s;
private static char[][][] nums;
public static void main(String[] args){
s = new Scanner(System.in);
System.out.print("请输入矩阵的长:");
int indexC=s.nextInt();
System.out.print("请输入矩阵的宽:");
int indexK=s.nextInt();
if(indexC<=0||indexK<=0){
System.out.println("输入的数字不合法!");
return;
}
int[][] square=new int[indexC][indexK];
int x=0;int y=0;
for(int i=1;i<=indexC*indexK;){
while(y<square[x].length-1&&square[x][y+1]==0){
square[x][y++]=i++;
}
while(x<square.length&&square[x][y]==0){
square[x++][y]=i++;
}
while(y>0&&square[x-1][y-1]==0){
square[x-1][--y]=i++;
}
if(++y>) break;
}
System.out.println(nums[x][y]);
}
}