éè¦è°è¯çç¨åºå¦ä¸ï¼
#include<stdlib.h>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<math.h>
typedef struct term//项ç表示
{ float coef; //ç³»æ°
int expn; //ææ°
struct term *next;
}Term;
int c=0;
Term* CreatPolyn(int m)
// è¾å
¥m项çç³»æ°åææ°ï¼å»ºç«è¡¨ç¤ºä¸å
å¤é¡¹å¼çæåºé¾è¡¨P
{ float r;int i,t;
Term *h,*P,*q;
c=0;
if(m<=0) return NULL;
h=P=(Term*)malloc(sizeof(Term));
for(i=1;i<=m;i++) // ä¾æ¬¡è¾å
¥m个éé¶é¡¹
{ printf("请è¾å
¥ç¬¬%d个éé¶é¡¹çç³»æ°ï¼å®åï¼åææ°ï¼æ´åï¼ï¼ä¾å¦ï¼ç³»æ°ï¼ææ°ï¼ï¼ ",i);
scanf("%f,%d",&r,&t);printf("\n");
if(r)
{ P->coef=r; P->expn=t;
if(i!=m)
{q=(Term*)malloc(sizeof(Term));
P->next=q;
P=q;
}
c++;
}
}
P->next=NULL;
return h;
} // CreatPolyn
Term* selsort(Term *h)//æç
§å¹æ¬¡çé«ä½å°å¯¹åºé¡¹è¿è¡æåºï¼å¹¶è¿è¡å并å类项ã
{ Term *g, *p, *q; float f; int i,x,y,fini=1;
if(!h) return NULL;
for(x=0;(x<=c-2)&&fini;x++)//ï¼å泡æ³æåºï¼
{fini=0;
p=h;q=h->next;
for(y=0;(y<=c-x-2)&&q;y++)
{if(p->expn<q->expn)
{ f=p->coef;i=p->expn;
p->coef=q->coef;p->expn=q->expn;
q->coef=f;q->expn=i;
fini=1;
}
p=p->next;q=q->next;
}
}
g=h;
for(p=g->next;p;)
{if(g->expn==p->expn)
{ g->coef += p->coef;
g->next = p->next;
q = p;
p = p->next;
free(q);
}
if(g->next)
{g = g->next;
p = p->next;
}
}
return h;
}
int PrintfPoly(Term *P)//è¾åºä¸å
å¤é¡¹å¼
{ Term *q=P;
if(!q) return 0;
do
{ if((q->coef!=1)&&(q->coef!=0)) printf("%f",q->coef);
if(q->expn==1) putchar('X');
else
if(!q->expn) putchar('1');
else printf("X^%d",q->expn);
q=q->next;
if (q) {if(q->coef>0) putchar('+');}
} while(q);
return 1;
}
int Compare(Term *a, Term *b)//æ¯è¾ä¸¤ä¸ªå¤é¡¹å¼å¯¹åºé¡¹å¹æ¬¡ç大å°
{ if (a->expn < b->expn) return -1;
else if(a->expn > b->expn) return 1;
else return 0;
}
Term* APolyn(Term *Pa, Term *Pb) // å¤é¡¹å¼å æ³,建ç«"åå¤é¡¹å¼"ã
{ Term *h, *qa = Pa, *qb = Pb, *p;
float sum;
if(!(Pa||Pb)) return NULL;
h=p=(Term*)malloc(sizeof(Term));
while(qa||qb)
{if(qa&&qb) // PaåPbåé空
{ switch (Compare(qa,qb))
{ case -1: // å¤é¡¹å¼PAä¸å½åç»ç¹çææ°å¼å°
p-> coef = qb->coef;
p-> expn = qb->expn;
qb = qb->next;
break;
case 0: // 两è
çææ°å¼ç¸ç
sum =qa->coef+qb->coef;
if (sum != 0.0) // ä¿®æ¹å¤é¡¹å¼PAä¸å½åç»ç¹çç³»æ°å¼
{ p->coef= sum;
p-> expn = qa->expn;
qb=qb->next;
qa=qa->next;
}
break;
case 1: // å¤é¡¹å¼PBä¸å½åç»ç¹çææ°å¼å°
p-> coef = qa->coef;
p-> expn = qa->expn;
qa = qa->next;
break;
} // switchç»æ
}// ifç»æ
else
{if (qa) {p->coef=qa->coef;p->expn=qa->expn; qa=qa->next;}
// é¾æ¥Paä¸å©ä½ç»ç¹
else { p-> coef = qb->coef;p->expn = qb->expn; qb = qb->next;}
// é¾æ¥Pbä¸å©ä½ç»ç¹
}
if (qa||qb) p=p->next=(Term*)malloc(sizeof(Term));
}
return h;
} // APolynç»æ
void cle(Term *first)
{Term *p=first;
while(first)
{p=first->next;
free(first);
first=p;
}
printf("\næ¸
空æä½å®æã");
}
Term* AddPoly (Term *Pa)
{ int n; Term*p,*Pb;
printf("\nè¾å
¥ç¬¬äºä¸ªä¸å
å¤é¡¹å¼ç项æ°:");
scanf("%d",&n);
Pb= CreatPolyn(n);
Pb= selsort(Pb);
if(Pb)
{ printf("è¾å
¥çä¸å
å¤é¡¹å¼ä¸ºï¼");
PrintfPoly(Pa);
if(Pb->coef>0) printf("+");
PrintfPoly(Pb);
p = APolyn(Pa,Pb);
printf(" = ");
p = selsort(p);
PrintfPoly(p);
return p;
}
else return NULL;
cle(Pb); cle(p);
}
Term* BPolyn(Term *Pa, Term *Pb) // å¤é¡¹å¼åæ³,建ç«"å·®å¤é¡¹å¼"ã
{ int m=0;
printf("A:"); PrintfPoly(Pa); printf("\nB:"); PrintfPoly(Pb);
printf("请éæ©ï¼1.A-B 2.B-A");scanf("%d",m);
while((m!=1)&&(m!=2))
{ printf("é误! 请éæ°éæ©1.A-B 2.B-A");scanf("%d",m);}
if(m==1)
{ Term *p = Pb;
while(p){ p->coef*=-1; p = p->next;}
PrintfPoly(Pa); printf(" - "); putchar('('); PrintfPoly(Pb); putchar(')'); printf(" = ");
return APolyn(Pa,p);
}
else
{ Term *p = Pa;
while(p) { p->coef *= -1; p = p->next;}
PrintfPoly(Pb); printf(" - "); putchar('('); PrintfPoly(Pa); putchar(')'); printf(" = ");
return APolyn(p,Pb);
}
}
// BPolynç»æ
Term* DecPoly (Term *Pa )
{ int n; Term*p,*Pb;
puts("è¾å
¥ç¬¬äºä¸ªä¸å
å¤é¡¹å¼ç项æ°");
scanf("%d",&n);
Pb = CreatPolyn(n);
Pb = selsort(Pb);
if(Pb)
{ p=BPolyn(Pa,Pb);
p=selsort(p);
PrintfPoly(p);
return p;
}
else return NULL;
cle(Pb); cle(p);
}
void Operate(Term *p)
{ int n,operation;Term*Pa=p, *Pb=NULL;
printf ("1.建ç«ä¸ä¸ªå¤é¡¹å¼å¹¶è¾åºå¤é¡¹å¼\n");
printf ("2.æ±ä¸¤ä¸ªå¤é¡¹å¼ä¹å(å¿
é¡»å
å建),建ç«æ±åå¤é¡¹å¼å¹¶è¾åº\n");
printf ("3.æ±ä¸¤ä¸ªå¤é¡¹å¼ä¹å·®(å¿
é¡»å
å建),建ç«æ±å·®å¤é¡¹å¼å¹¶è¾åº\n");
printf ("4.å é¤å¤é¡¹å¼å¹¶éæ°è¾å
¥\n");
printf ("5.éåº\n");
printf ("请éæ©æ令:");
scanf("%d",&operation);
while((operation<1)||(operation>5))
{printf("é误! 请éæ°è¾å
¥: ");scanf("%d",&operation);}
switch(operation)
{case 1:
printf("è¾å
¥ä¸ä¸ªä¸å
å¤é¡¹å¼ç项æ°ï¼ ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("è¾å
¥çä¸å
å¤é¡¹å¼ä¸ºï¼");
PrintfPoly(Pa);
break;
case 2:
printf("è¾å
¥ä¸ä¸ªä¸å
å¤é¡¹å¼ç项æ°ï¼ ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("è¾å
¥çä¸å
å¤é¡¹å¼ä¸ºï¼");
PrintfPoly(Pa);
AddPoly (Pa);break;
case 3:
printf("è¾å
¥ä¸ä¸ªä¸å
å¤é¡¹å¼ç项æ°ï¼ ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("è¾å
¥çä¸å
å¤é¡¹å¼ä¸ºï¼");
PrintfPoly(Pa);
DecPoly (Pa);break;
case 4:
cle(Pa);
puts("éæ°è¾å
¥ä¸å
å¤é¡¹å¼ç项æ°ï¼ ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("è¾å
¥çä¸å
å¤é¡¹å¼ä¸ºï¼");
PrintfPoly(Pa);
break;
case 5:
printf("\n");break;
}
}
void main()
{Term *p=NULL;char c;
Operate(p);
printf("\næ¯å¦ç»§ç»æä½? (y/n) ");
while ((c=getchar())=='\n');
while(tolower(c)!='n')
{Operate(p);
printf("æ¯å¦ç»§ç»æä½? (y/n) ");
while ((c=getchar())=='\n');
}
cle(p);
PrintfPoly(p);
}
温馨提示:答案为网友推荐,仅供参考