<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>inamori</author_name>
  <author_url>https://blog.hatena.ne.jp/inamori/</author_url>
  <blog_title>inamori’s diary</blog_title>
  <blog_url>https://inamori.hateblo.jp/</blog_url>
  <categories>
    <anon>数学</anon>
    <anon>Python</anon>
  </categories>
  <description>行列はリストのリストで表現し、行列式の関数を作った。 def swap(Mat, i): n = len(Mat); for k in range(i + 1, n): if Mat[k][i] != 0: tmp = Mat[i] Mat[i] = Mat[k] Mat[k] = tmp return 1 return 0def det(Mat): result = 1 div = 1 n = len(Mat) for i in range(0, n - 1): if Mat[i][i] == 0: if not swap(Mat, i): return 0 a = Mat[i][i] fo…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20080920%2Fp1&quot; title=&quot;行列式の計算（6） - inamori’s diary&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2008-09-20 00:00:00</published>
  <title>行列式の計算（6）</title>
  <type>rich</type>
  <url>https://inamori.hateblo.jp/entry/20080920/p1</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
