Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
N
numer-60-2
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Littichai Buddaken
numer-60-2
Commits
5d63b0c2
Commit
5d63b0c2
authored
Feb 15, 2018
by
Littichai Buddaken
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
update ge
parent
6780f013
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
31 additions
and
3 deletions
+31
-3
ge.py
week05/ge.py
+31
-3
No files found.
week05/ge.py
View file @
5d63b0c2
# 59110440354
# นายฤทธิชัย บุดดาเคน
def
ge
(
A
,
b
):
pass
import
numpy
as
np
A
=
np
.
array
([[
4
,
-
2
,
1
],[
-
2
,
4
,
-
2
],[
1
,
-
2
,
4
]],
float
)
b
=
np
.
array
([
11
,
-
16
,
17
],
float
)
n
=
len
(
b
)
for
k
in
range
(
0
,
n
-
1
):
#print('k =',k)
for
i
in
range
(
k
+
1
,
n
):
if
A
[
i
,
k
]
!=
0.0
:
lam
=
A
[
i
,
k
]
/
A
[
k
,
k
]
A
[
i
,
k
]
=
0
A
[
i
,
k
+
1
:
n
]
=
A
[
i
,
k
+
1
:
n
]
-
lam
*
A
[
k
,
k
+
1
:
n
]
b
[
i
]
-=
lam
*
b
[
k
]
x
=
b
.
copy
()
for
k
in
range
(
n
-
1
,
-
1
,
-
1
):
x
[
k
]
=
(
b
[
k
]
-
np
.
dot
(
A
[
k
,
k
+
1
:
n
],
x
[
k
+
1
:
n
]))
/
A
[
k
,
k
]
print
(
x
)
def
solve
(
A
,
b
):
pass
import
numpy.linalg
result
=
numpy
.
linalg
.
solve
(
A
,
b
)
for
i
,
x
in
zip
(
range
(
len
(
result
)),
result
):
print
(
'x_{}={}'
.
format
(
i
,
x
))
# mxn
m
,
n
,
_
=
map
(
int
,
input
()
.
split
(
'x'
))
print
(
m
,
n
)
A
=
[]
for
i
in
range
(
m
):
A
.
append
(
list
(
map
(
int
,
input
()
.
split
(
','
))))
print
(
n
,
_
)
b
=
list
(
map
(
int
,
input
()
.
split
(
','
)))
solve
(
A
,
b
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment