-
Notifications
You must be signed in to change notification settings - Fork 0
/
diagonal_sum.java
53 lines (50 loc) · 968 Bytes
/
diagonal_sum.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package practice;
import java.util.*;
public class diagonal_sum {
public static void main(String[] args) {
// System.out.println("enter the size");
// Scanner scanner=new Scanner(System.in);
// int size=scanner.nextInt();
int array[][]=new int[3][3];
int i,j ,sum=0;
for(i=0;i<3;i++)
{
for(j=0;j<3;j++) {
Scanner sc=new Scanner(System.in);
array[i][j]=sc.nextInt();
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++) {
System.out.print(" " +array[i][j]);
}
System.out.println();
}
System.out.print(" left to right diagonal sum is ");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
if(i==j)
{
sum+=array[i][j];
}
}
}
System.out.println(" " +sum);
sum=0;
System.out.print(" left to right diagonal sum is ");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
if(i==j || i+j==3-i)
{
sum+=array[i][j];
}
}
}
System.out.println(" " +sum);
}
}