一元多项式.docx
- 文档编号:11612089
- 上传时间:2023-06-01
- 格式:DOCX
- 页数:10
- 大小:15.08KB
一元多项式.docx
《一元多项式.docx》由会员分享,可在线阅读,更多相关《一元多项式.docx(10页珍藏版)》请在冰点文库上搜索。
一元多项式
一元多项式
#include"stdio.h"#include"stdlib.h"#include"math.h"#defineMAX_SIZE100
#defineOK1#defineTURE1#defineFALSE0
Typedefstructpolyn{doubledata;charbuck;doubleexplonen;structpolyn*next;}*Polyn,LNode;
voidPolynScanf(charScanfPolyn[MAX_SIZE])
{intcounter,flog=0;charUnknow;
loop1:
scanf("%s",ScanfPolyn);
For(counter=0;ScanfPolyn[counter]!
='\0';counter++)
{If(ScanfPolyn[counter]>='a'&&ScanfPolyn[counter]<='z'||ScanfPolyn[counter]>='A'&&ScanfPolyn[counter]<='Z'){flog=1;break;}
}If(flog==1)
{Unknow=ScanfPolyn[counter];counter++;
For(counter;ScanfPolyn[counter]!
='\0';counter++)
{if(ScanfPolyn[counter]>='a'&&ScanfPolyn[counter]<='z'||ScanfPolyn[counter]>='A'&&ScanfPolyn[counter]<='Z')
{if(Unknow==ScanfPolyn[counter]);
Else{printf("Sorry!
PleaseinputyourPolynagain:
\n");gotoloop1;}}
}
}
}
voidInitPolyn(Polyn*head,charScanfPolyn[MAX_SIZE])
{PolynL;intcount;charUnknow;L=(Polyn)malloc(sizeof(LNode));
L->next=NULL;L->data=0;L->explonen=0;
For(count=0;ScanfPolyn[count]!
='\0';count++)
{If(ScanfPolyn[count]>='a'&&ScanfPolyn[count]<='z'||ScanfPolyn[count]>='A'&&ScanfPolyn[count]<='Z'){Unknow=ScanfPolyn[count];break;}
}L->buck=Unknow;*head=L;
}
voidCreatPolyn(Polynhead,charScanfPolyn[MAX_SIZE])
{PolynNewPointer,Pointer;char*Before;intcount,constant;
Pointer=head;Before=ScanfPolyn;
For(Before;*Before!
='\0';)
{If(*Before=='-')
{NewPointer=(Polyn)malloc(sizeof(LNode));NewPointer->next=Pointer->next;Pointer->next=NewPointer;NewPointer->data=0;NewPointer->explonen=0;Before++;
if(*Before==head->buck)
{NewPointer->data=-1;Before++;
If(*Before=='(')
{Before=Before+2;
For(;;)
{Switch(*Before)
1/13
{
Case'0':
{NewPointer->explonen=NewPointer->explonen*10-0;break;}
Case'1':
{NewPointer->explonen=NewPointer->explonen*10-1;break;}
Case'2':
{NewPointer->explonen=NewPointer->explonen*10-2;break;}
Case'3':
{NewPointer->explonen=NewPointer->explonen*10-3;break;}
Case'4':
{NewPointer->explonen=NewPointer->explonen*10-4;break;}
Case'5':
{NewPointer->explonen=NewPointer->explonen*10-5;break;}
Case'6':
{NewPointer->explonen=NewPointer->explonen*10-6;break;}
Case'7':
{NewPointer->explonen=NewPointer->explonen*10-7;break;}
Case'8':
{NewPointer->explonen=NewPointer->explonen*10-8;break;}
Case'9':
{NewPointer->explonen=NewPointer->explonen*10-9;break;}
}Before++;If(*Before=='.')
{Before++;
For(count=1;;count++)
{Switch(*Before)
{
Case'1':
{NewPointer->explonen=NewPointer->explonen-pow(10,-count);break;}Case'2':
{NewPointer->explonen=NewPointer->explonen-2*pow(10,-count);break;}Case'3':
{NewPointer->explonen=NewPointer->explonen-3*pow(10,-count);break;}Case'4':
{NewPointer->explonen=NewPointer->explonen-4*pow(10,-count);break;}Case'5':
{NewPointer->explonen=NewPointer->explonen-5*pow(10,-count);break;}Case'6':
{NewPointer->explonen=NewPointer->explonen-6*pow(10,-count);break;}Case'7':
{NewPointer->explonen=NewPointer->explonen-7*pow(10,-count);break;}Case'8':
{NewPointer->explonen=NewPointer->explonen-8*pow(10,-count);break;}Case'9':
{NewPointer->explonen=NewPointer->explonen-9*pow(10,-count);break;}
}Before++;If(*Before==')')break;}
}If(*Before==')')break;
}Before++;continue;
}Elseif(*Before=='-'||*Before=='+'||*Before=='\0')
{NewPointer->explonen=1;continue;}
Else
{
For(;;)
{Switch(*Before)
{
Case'0':
{NewPointer->explonen=NewPointer->explonen*10+0;break;}
Case'1':
{NewPointer->explonen=NewPointer->explonen*10+1;break;}
Case'2':
{NewPointer->explonen=NewPointer->explonen*10+2;break;}
Case'3':
{NewPointer->explonen=NewPointer->explonen*10+3;break;}
Case'4':
{NewPointer->explonen=NewPointer->explonen*10+4;break;}
Case'5':
{NewPointer->explonen=NewPointer->explonen*10+5;break;}
Case'6':
{NewPointer->explonen=NewPointer->explonen*10+6;break;}
Case'7':
{NewPointer->explonen=NewPointer->explonen*10+7;break;}
Case'8':
{NewPointer->explonen=NewPointer->explonen*10+8;break;}
Case'9':
{NewPointer->explonen=NewPointer->explonen*10+9;break;}
}Before++;If(*Before=='.')
{Before++;
For(count=1;;count++)
{Switch(*Before)
{
Case'1':
{NewPointer->explonen=NewPointer->explonen+pow(10,-count);break;}Case'2':
{NewPointer->explonen=NewPointer->explonen+2*pow(10,-count);break;}Case'3':
{NewPointer->explonen=NewPointer->explonen+3*pow(10,-count);break;}Case'4':
{NewPointer->explonen=NewPointer->explonen+4*pow(10,-count);break;}Case'5':
{NewPointer->explonen=NewPointer->explonen+5*pow(10,-count);break;}Case'6':
{NewPointer->explonen=NewPointer->explonen+6*pow(10,-count);break;}Case'7':
{NewPointer->explonen=NewPointer->explonen+7*pow(10,-count);break;}Case'8':
{NewPointer->explonen=NewPointer->explonen+8*pow(10,-count);break;}Case'9':
{NewPointer->explonen=NewPointer->explonen+9*pow(10,-count);break;}
}Before++;
If(*Before=='+'||*Before=='-'||*Before=='\0')break;}
}If(*Before=='-'||*Before=='+'||*Before=='\0')break;}}
}
Else
{
For(;;)
{Switch(*Before)
{
Case'0':
{NewPointer->data=NewPointer->data*10-0;break;}
Case'1':
{NewPointer->data=NewPointer->data*10-1;break;}
Case'2':
{NewPointer->data=NewPointer->data*10-2;break;}
Case'3':
{NewPointer->data=NewPointer->data*10-3;break;}
Case'4':
{NewPointer->data=NewPointer->data*10-4;break;}
Case'5':
{NewPointer->data=NewPointer->data*10-5;break;}
Case'6':
{NewPointer->data=NewPointer->data*10-6;break;}
Case'7':
{NewPointer->data=NewPointer->data*10-7;break;}
Case'8':
{NewPointer->data=NewPointer->data*10-8;break;}
Case'9':
{NewPointer->data=NewPointer->data*10-9;break;}
}Before++;If(*Before=='.')
{Before++;
For(count=1;;count++)
{Switch(*Before)
{
Case'1':
{NewPointer->data=NewPointer->data-pow(10,-count);break;}
Case'2':
{NewPointer->data=NewPointer->data-2*pow(10,-count);break;}
Case'3':
{NewPointer->data=NewPointer->data-3*pow(10,-count);break;}
Case'4':
{NewPointer->data=NewPointer->data-4*pow(10,-count);break;}
Case'5':
{NewPointer->data=NewPointer->data-5*pow(10,-count);break;}
Case'6':
{NewPointer->data=NewPointer->data-6*pow(10,-count);break;}
Case'7':
{NewPointer->data=NewPointer->data-7*pow(10,-count);break;}
Case'8':
{NewPointer->data=NewPointer->data-8*pow(10,-count);break;}
Case'9':
{NewPointer->data=NewPointer->data-9*pow(10,-count);break;}
}Before++;
If(*Before=='-'||*Before=='+'||*Before=='\0'||*Before==head->buck)break;}
}
If(*Before=='-'||*Before=='+'||*Before=='\0'||*Before==head->buck)break;
}If(*Before==head->buck)
{Before++;
If(*Before=='(')
{Before=Before+2;
For(;;)
{Switch(*Before)
{
Case'0':
{NewPointer->explonen=NewPointer->explonen*10-0;break;}
Case'1':
{NewPointer->explonen=NewPointer->explonen*10-1;break;}
Case'2':
{NewPointer->explonen=NewPointer->explonen*10-2;break;}
Case'3':
{NewPointer->explonen=NewPointer->explonen*10-3;break;}
Case'4':
{NewPointer->explonen=NewPointer->explonen*10-4;break;}
Case'5':
{NewPointer->explonen=NewPointer->explonen*10-5;break;}
Case'6':
{NewPointer->explonen=NewPointer->explonen*10-6;break;}
Case'7':
{NewPointer->explonen=NewPointer->explonen*10-7;break;}
Case'8':
{NewPointer->explonen=NewPointer->explonen*10-8;break;}
Case'9':
{NewPointer->explonen=NewPointer->explonen*10-9;break;}
}Before++;If(*Before=='.')
{Before++;
For(count=1;;count++)
{Switch(*Before)
{
Case'1':
{NewPointer->explonen=NewPointer->explonen-pow(10,-count);break;}Case'2':
{NewPointer->explonen=NewPointer->explonen-2*pow(10,-count);break;}Case'3':
{NewPointer->explonen=NewPointer->explonen-3*pow(10,-count);break;}Case'4':
{NewPointer->explonen=NewPointer->explonen-4*pow(10,-count);break;}Case'5':
{NewPointer->explonen=NewPointer->explonen-5*pow(10,-count);break;}Case'6':
{NewPointer->explonen=NewPointer->explonen-6*pow(10,-count);break;}Case'7':
{NewPointer->explonen=NewPointer->explonen-7*pow(10,-count);break;}Case'8':
{NewPointer->explonen=NewPointer->explonen-8*pow(10,-count);break;}Case'9':
{NewPointer->explonen=NewPointer->explonen-9*pow(10,-count);break;}
}Before++;If(*Before==')')break;}
}If(*Before==')')break;}Before++;continue;
}
Elseif(*Before=='-'||*Before=='+'||*Before=='\0')
{NewPointer->explonen=1;continue;}
Else
{
For(;;)
{Switch(*Before)
{
Case'0':
{NewPointer->explonen=NewPointer->explonen*10+0;break;}
Case'1':
{NewPointer->explonen=NewPointer->explonen*10+1;break;}
Case'2':
{NewPointer->explonen=NewPointer->explonen*10+2;break;}
Case'3':
{NewPointer->explonen=NewPointer->explonen*10+3;break;}
Case'4':
{NewPointer->explonen=NewPointer->explonen*10+4;break;}
Case'5':
{NewPointer->explonen=NewPointer->explonen*10+5;break;}
Case'6':
{NewPointer->
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 一元 多项式