Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Java
- import java.util.Scanner;
- class main{
- public static void main(String args[]){
- Scanner sc=new Scanner(System.in);
- int n;
- int cases=1;
- while(sc.hasNextInt() && (n=sc.nextInt())!=0){
- //初始化陣列。
- int arr[][]=new int[n][n];
- for(int i=0;i<n;i++){
- for(int j=0;j<n;j++){
- arr[i][j]=sc.nextInt();
- }
- }
- int s=0; //最小邊界。
- int e=n; //最大邊界
- System.out.print("Case "+cases+":");
- while(s<=e){
- int out=0,in=0;
- //最外圍總和。
- for(int i=s;i<e;i++){
- for(int j=s;j<e;j++){
- out=out+arr[i][j];
- }
- }
- //內圈總和。
- for(int i=s+1;i<e-1;i++){
- for(int j=s+1;j<e-1;j++){
- in=in+arr[i][j];
- }
- }
- // Output
- if((out-in)!=0) System.out.print(" "+(out-in));
- s++;
- e--;
- }
- System.out.println("");
- cases++;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement