poj 1555 Polynomial Showdown
2011-11-16 21:28
309 查看
注意:
1.开头系数是负的话,负号后面没有空格;如果是正的话,不输出正号和空格
2.系数是1的话,不输出1;如果是-1的话,也不输出1
3.指数是1的话,不输出^1
4.最后一位,不输出x^0
View Code
1.开头系数是负的话,负号后面没有空格;如果是正的话,不输出正号和空格
2.系数是1的话,不输出1;如果是-1的话,也不输出1
3.指数是1的话,不输出^1
4.最后一位,不输出x^0
View Code
#include <stdio.h> int ar[10],i; void solve(int j) { if(ar[i]!=0) { if(i==j)//是头 { if(ar[i]>0) { if(ar[i]==1)printf("x^%d ",i); else printf("%dx^%d ",ar[i],i); } else { if(ar[i]==-1)printf("-x^%d ",i); else printf("-%dx^%d ",-ar[i],i); } } else//不是头 { if(ar[i]>0) { if(ar[i]==1)printf("+ x^%d ",i); else printf("+ %dx^%d ",ar[i],i); } else { if(ar[i]==-1)printf("- x^%d ",i); else printf("- %dx^%d ",-ar[i],i); } } } i--; } int main() { int j; while (scanf("%d",&ar[8])!=EOF) { for (i=7;i>=0;i--) scanf("%d",&ar[i]); for (i=8;i>=0;i--) if(ar[i])break; if(i==-1) { printf("0\n"); continue; } j=i; if(i==8) { if(ar[i]>0) { if(ar[i]==1)printf("x^%d ",i); else printf("%dx^%d ",ar[i],i); } else { if(ar[i]==-1)printf("-x^%d ",i); else printf("-%dx^%d ",-ar[i],i); } i--; } if(i==7)solve(j); if(i==6)solve(j); if(i==5)solve(j); if(i==4)solve(j); if(i==3)solve(j); if(i==2)solve(j); if(i==1) { if(ar[i]) { if(i==j)//是头 { if(ar[i]>0) { if(ar[i]==1)printf("x "); else printf("%dx ",ar[i]); } else { if(ar[i]==-1)printf("-x "); else printf("-%dx ",-ar[i]); } } else//不是头 { if(ar[i]>0) { if(ar[i]==1)printf("+ x "); else printf("+ %dx ",ar[i]); } else { if(ar[i]==-1)printf("- x "); else printf("- %dx ",-ar[i]); } } } i--; } if(i==0) { if(ar[i]!=0) { if(i==j)//是头 { if(ar[i]>0) printf("%d ",ar[i]); else printf("%d ",ar[i]); } else//不是头 { if(ar[i]>0) printf("+ %d ",ar[i]); else printf("- %d ",-ar[i]); } } } printf("\n"); } return 0; }
相关文章推荐
- POJ1555 ZOJ1720 UVA392 UVALive5309 Polynomial Showdown题解
- poj1555--Polynomial Showdown (水题)
- (数组的应用三:多项式的表示与处理4.3.1)POJ 1555 Polynomial Showdown(多项式的输出)
- poj 1555 Polynomial Showdown
- POJ1555 Polynomial Showdown (输出多项式)
- poj 1555 Polynomial Showdown 模拟
- POJ 1555 Polynomial Showdown
- [ACM] poj 2249 Binomial Showdown (排列组合公式优化)
- poj 2249 Binomial Showdown
- UVa392 - Polynomial Showdown
- POJ-2426 Factoring a Polynomial-能否分解
- POJ 1555 Polynomial Showdown(字符串模拟)
- POJ 2249-Binomial Showdown(排列组合计数)
- POJ 2249 Binomial Showdown(我的水题之路——求n个数里取m个数的值)
- POJ 2126 Factoring a Polynomial
- zoj 1720 Polynomial Showdown
- poj 2126 Factoring a Polynomial 数学多项式分解
- poj 2249 Binomial Showdown(组合数 公式优化)
- POJ 2249-Binomial Showdown(排列组合计数)
- (组合数学3.1.2.1)POJ 2249 Binomial Showdown(排列组合公式的实现)