<html>
<head>
<title>求最大公约数</title>
<script type="text/javascript">
//Greatest common divisor
/* precondition: m>0 and n>0. Let g=gcd(m,n). */
function gcd(m, n){
while( m > 0 )
{ /* invariant: gcd(m,n)=g */
if( n > m ){
var t = m;
m = n; n = t;
} /* swap */
/* m >= n > 0 */
m -= n;
}
return n;
}
document.write(gcd(112,48));
</script>
</head>
<body>
</body>
</html>
求最大公约数
最新推荐文章于 2022-02-14 21:15:59 发布