用流程图表示两个正整数m和n的大公约数和最小公倍数,

\u6c42\u505aVB\uff1a\u7ed9\u5b9a\u4efb\u610f\u4e24\u4e2a\u6b63\u6574\u6570\uff0c\u6c42\u5176\u5bf9\u5927\u516c\u7ea6\u6570\u548c\u6700\u5c0f\u516c\u500d\u6570

Dim m As Integer, n As Integer
Private Sub Command1_Click()
m = Val(InputBox("\u8f93\u5165\u6b63\u6574\u6570"))
n = Val(InputBox("\u8f93\u5165\u6b63\u6574\u6570"))
If n * m = 0 Then
MsgBox "\u4e24\u6570\u4efb\u4f55\u4e00\u4e2a\u6570\u90fd\u4e0d\u80fd\u4e3a0!"
Exit Sub
End If
End Sub

Private Sub Command2_Click()
Dim r As Integer, s As Integer
r = m: s = 1
Do Until m Mod r = 0 And n Mod r = 0 '\u6700\u5927\u516c\u7ea6\u6570
r = r - 1
Loop
Do Until s Mod m = 0 And s Mod n = 0 '\u6700\u5c0f\u516c\u500d\u6570
s = s + 1
Loop
Text1.Text = "\u6700\u5927\u516c\u7ea6\u6570\u662f\uff1a" & r & "\u6700\u5c0f\u516c\u500d\u6570\u662f\uff1a" & s
End Sub

#includeint zdgys(int n1,int n2){ int i;// for(i=n2;i>=1;i--)//\u8fd9\u513f for(i=n2;in2) { t=n1; n1=n2;//\u8fd9\u513f\u4ea4\u6362\u5927\u5c0f\uff0c\u6709\u95ee\u9898 t=n2; n2=t; } printf("zdgys=%d zxgbs=%d",zdgys(n1,n2),zxgbs(n1,n2));
}

一般采用辗转相除法求最大公约数h。

最小公倍数=m*n/h



  • 鏅娴佺▼鍥姹涓ゆ暟鏈澶у叕绾︽暟
    绛旓細Rem 璇█锛歏isual Basic 6.0Sub Main() '寮濮 m = Val(InputBox("璇疯緭鍏=", "杈撳叆")) n = Val(InputBox("璇疯緭鍏=", "杈撳叆")) Do Until n = 0 r = m mod n m = n n = r Loop MsgBox m, vbInformation, "杈撳嚭"End Sub '缁撴潫 ...
  • 杈撳叆涓や釜姝f暣鏁癿鍜宯,姹傚叾涓渶澶у叕绾︽暟鍜屾渶灏忓叕鍊嶆暟銆備笉瑕佷唬鐮,鐢ㄨ嚜鐒惰...
    绛旓細鈶 寰楀埌杈撳嚭m锛宯 鈶 杈楄浆鐩搁櫎娉曟眰鍑簃锛n鐨鏈灏忓叕鍊鏁a锛涒憿 鏈澶у叕绾︽暟涓簃*n/a 鍏跺疄灏辫繖涔堢畝鍗曟拻~
  • C++娴佺▼鍥闂
    绛旓細涓嬮潰鏄娴佺▼鍥瀵瑰簲鐨勪唬鐮侊紝鍚勪釜閮ㄥ垎瀵瑰簲鐨勪唬鐮侀兘鏈夋敞閲婏紝璇ョ▼搴忕敤浜庤绠涓や釜杈撳叆鏁板瓧鐨勬渶澶у叕绾︽暟銆俰nclude<iostream> using namespace std;int main(){ // START int m,n,r;//瀹氫箟杈撳叆鍙橀噺m锛宯鍜屼腑闂撮噺r bool flag;//瀹氫箟鍒ゆ柇寰幆鐨勫垽鏂潯浠 // input m,n cin>>m>>n;//杈撳叆鍙橀噺m锛...
  • 宸茬煡m n鏄涓や釜浜掍笉鐩哥瓑鐨鏈夌悊鏁,鏍规嵁娴佺▼鍥涓殑绋嬪簭
    绛旓細娴佺▼鐨绗笁姝ヨ鏄庡綋m>n 鏃讹紝y=m-n+m+n=2m, 褰搈<n 鏃讹紝y=n-m+m+n=2n,鎵浠=2x杈冨ぇ鐨勬暟 鎵浠ヨ緝澶х殑鏁=24
  • C璇█棰樼洰,杈撳叆涓や釜姝f暣鏁癿鍜宯,姹傚叾鏈澶у叕绾︽暟鍜屾渶灏忓叕鍊嶆暟
    绛旓細鏈澶у叕绾鏁锛(杈楄浆鐩搁櫎娉)璋冩暣椤哄簭浣縨>=n 寰幆 m=m%n; 濡傛灉m=0锛屽垯n涓烘渶澶у叕绾︽暟锛岃烦鍑哄惊鐜傛敞锛%琛ㄧず鍙栦綑杩愮畻銆俷=n%m; 濡傛灉n=0锛屽垯m涓烘渶澶у叕绾︽暟锛岃烦鍑哄惊鐜俷ext 姹傚嚭鏈澶у叕绾︽暟G鍚庯紝鐢╩*n/G寰楀埌鏈灏忓叕鍊嶆暟銆
  • 鐢ㄨ緱杞浉闄ゆ硶姹傛渶澶у叕绾鏁扮殑娴佺▼鍥銆傝繖涓庝箞浣撶幇do while璇彞銆俖鐧惧害鐭...
    绛旓細Rem Language:QuickBASIC Extended 7.1'寮濮 INPUT "m, n="; m, n Do r = m mod n m = n n = r Loop Until n = 0 PRINT m'缁撴潫
  • 鐢讳笅NS娴佺▼鍥, #include<stdio.h> int main() { int m,n
    绛旓細鐢讳笅NS娴佺▼鍥,#include<stdio.h>intmain(){intm,n,i,a=1,b=1,c=1;do{scanf("%d%d",&m,&n);}while(m<n);for(i=1;i<=m;i++)a=a*i;for(i=1;i<=n;i++)b=b*i;for(i=1;i<=m-n;i++)c=c*i;pr... 鐢讳笅NS娴佺▼鍥,#include<stdio.h>int main(){ int m,n,i,a=1,b...
  • 璁$畻鏈娴佺▼鍥,鍙笉鍙互鐩存帴鍦ㄨ緭鍏ヨ緭鍑烘鍐呭畾涔涓や釜杈撳叆鍊鐨澶у皬鍏崇郴...
    绛旓細鐩存帴杈撳叆m锛n max(m锛宯)=m锛宮in(m锛宯)=n
  • 1+1/3+1/5+鈥+1/2007,璇曠敤娴佺▼鍥捐〃绀
    绛旓細寮濮 (1)N=0 (2)M=1 (3)N=N+1/M (4)M=M+2 鍒ゆ柇M鏄惁灏忎簬2007 鑻ュ皬浜庡垯鍥炲埌(3)寮 鍚﹀垯 缁撴潫
  • 宸茬煡涓や釜鑷劧鏁癕鍜孨姹M鍜孨鐨鏈灏忓叕鍊嶆暟鐨勭畻娉娴佺▼鍥
    绛旓細鎷滄墭锛岃繖涓湪杩欎笂闈㈡槸鐢讳笉鍑烘潵鍦
  • 扩展阅读:盒图n的阶乘流程图 ... m n最大公约数流程图 ... 输出10的阶乘的流程图 ... 两个根为正整数 求m ... n s流程图 ... 求10个数中最大流程图 ... 求n 流程图 ... 求10的阶乘的流程图 ... 用流程图描述求n 的阶乘 ...

    本站交流只代表网友个人观点,与本站立场无关
    欢迎反馈与建议,请联系电邮
    2024© 车视网