Navigation
index
previous
|
Computer Science Textbook (under construction)
»
最大公約数を求める
¶
例1
例2
例3
例4
x=
y=
Naive法
計算量(mod演算実行回数)=
1
mod
=
mod
=
Euclidの互除法
計算量(mod演算実行回数)=
1
Navigation
index
previous
|
Computer Science Textbook (under construction)
»