-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3x3 matrix lower uppper cross sum.txt
101 lines (79 loc) · 1.62 KB
/
3x3 matrix lower uppper cross sum.txt
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <stdio.h>
int main()
{
int a[3][3]={{6,5,4},
{1,2,5},
{7,9,7}};
int n=3;
int i,j,usum=0,lsum=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
{
usum+=a[i][j];
lsum+=a[i][j];
}
else if(j>i)
{
usum+=a[i][j];
}
else
{
lsum+=a[i][j];
}
}
}
printf("%d",usum);
printf("\n%d",lsum);
return 0;
}
java:
public class Task {
public static void main(String args[])
{
int i,j;
int usum=0;
int a[][]={{1,2,3},
{4,5,6},
{7,8,9}};
int n=a.length;
int lsum=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
{
usum+=a[i][j];
lsum+=a[i][j];
}
else if(j>i)
{
usum+=a[i][j];
}
else
{
lsum+=a[i][j];
}
}
}
System.out.println(usum+" "+lsum);
}
}
python:
a=[[1,2,3],[4,5,6],[7,8,9]]
n=len(a)
usum=0
lsum=0
for i in range(len(a)):
for j in range(len(a)):
if i==j:
usum+=a[i][j]
lsum+=a[i][j]
elif j>i:
usum+=a[i][j]
else:
lsum+=a[i][j]
print(usum," ",lsum)