多項(xiàng)式輾轉(zhuǎn)相除法求最大公因式

1、#include#include#includestructchain定義一個(gè)多項(xiàng)式的結(jié)構(gòu)體intn該多項(xiàng)式的最高次數(shù)doublean存放多項(xiàng)式的系數(shù)voidcreat_chain(structchainc)建立一個(gè)多項(xiàng)式intindoubleaiprintf(“請(qǐng)輸入該多項(xiàng)式最高次數(shù):“)scanf(“%d“(c).n=n(c).an=(double)calloc(n1sizeof(double))給該多項(xiàng)式系數(shù)動(dòng)態(tài)分配內(nèi)存print

2、f(“按下列格式輸入系數(shù):(例如x^42x^37x^15輸入:12075)n“)printf(“等待輸入:“)f(i=ni=0i)scanf(“%lf“(c).an[i]=aivoidshow(structchainc)按照多項(xiàng)式的格式顯示多項(xiàng)式inti=c.nprintf(“多項(xiàng)式是:“)while(i=0)if((i!=c.n)switch(i)case1:printf(“%.2lfX“c.an[i])breakcase0:prin

3、tf(“%.2lf“c.an[i])breakdefault:printf(“%.2lfX^%d“c.an[i]i)breakiprintf(“n“)if(fabs(r.an[i])=1e6)如果一旦有一個(gè)不為零，返回falsereturnfalsereturntrue全為零的情況下返回truevoiddo_div(structchainch1structchainch2)輾轉(zhuǎn)相除法公式:ch1=qch2rinti=0jdoubletm

4、pstructchainqrif(check_zero(ch2))判斷所除的多項(xiàng)式是否為0，若為0，退出printf(“所除的多項(xiàng)式不能為0!n“)exit(0)q.n=ch1.nch2.nq的最高次數(shù)為ch1和ch2最高次數(shù)相減r.n=ch1.n1r.an=(double)calloc(r.n1sizeof(double))為系數(shù)動(dòng)態(tài)分配內(nèi)存q.an=(double)calloc(q.n1sizeof(double))while(i=

5、0j)if(j=q.ni)r.an[j]=ch1.an[j]tmpch2.an[jq.ni]高次對(duì)應(yīng)相減elser.an[j]=ch1.an[j]低次保留if(check_zero(r))break若余式r系數(shù)全為零退出循環(huán)ch1=rch2沒除干凈，將r賦給ch1繼續(xù)除ch2iprintf(“n“)printf(“q(x):“)show(q)顯示每一步的多項(xiàng)式qprintf(“r(x):“)show(r)顯示每一步與q對(duì)應(yīng)的多項(xiàng)式rpr