--- title: 16-5:最大公因數 lang: zh-tw tags: DICE Python --- 16-5:最大公因數 === > [name=Chinglin-K] --- 目錄:[Dice 程式教學-Python完整版](https://hackmd.io/@Chinglin-K/Dice-menu) 上一篇:[16-4:因數](https://hackmd.io/@Chinglin-K/Dice-16-4) 下一篇:[16-6:相反數絕對值](https://hackmd.io/@Chinglin-K/Dice-16-6) --- ## 題目 請撰寫一程式,輸入二個正整數,找出兩整數的公因數與最大公因數。 格式如輸出範例所示,公因數中間以空格隔開。 輸入範例: 30 60 輸出範例: 30與60的公因數1 2 3 5 6 10 15 30 30與60的最大公因數30 --- ## 程式碼 ```Python= #最大公因數 import math n=int(input()) m=int(input()) print(f'{n}與{m}的公因數',end="") for i in range(1,m+1): if(n%i==0 and m%i==0): print(i,end=" ") print("") print(f'{n}與{m}的最大公因數{math.gcd(n,m)}') ``` --- ## 輸出 ```Python= ``` --- 目錄:[Dice 程式教學-Python完整版](https://hackmd.io/@Chinglin-K/Dice-menu) 上一篇:[16-4:因數](https://hackmd.io/@Chinglin-K/Dice-16-4) 下一篇:[16-6:相反數絕對值](https://hackmd.io/@Chinglin-K/Dice-16-6) --- :::info 「盡多少本分,得多少本事」😊 ::: --- {%hackmd i1nMRrZcTFmTvoF897K9zg %}
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up