poj1555--Polynomial Showdown (水题)
2012-09-16 15:18
302 查看
根据题目意思来就行了
View Code
View Code
//Accepted 392K 0MS G++ 1292B #include <stdio.h> int main(void) { int a[9]; int sum; while(scanf("%d",&a[8])==1) { sum = a[8]; for(int i=7;i>=0;--i) { scanf("%d",&a[i]); sum += a[i]; } if(sum == 0) { printf("0\n"); continue; } int i = 8; while(a[i] == 0) --i ; if(i == 0) { printf("%d\n",a[0]); } else if(i == 1) { if(a[1] == 1) printf("x"); else if(a[1] == -1) printf("-x"); else printf("%dx",a[1]); if(a[0] > 0) printf(" + %d\n",a[0]); else if(a[0] < 0) printf(" - %d\n",a[0] * (-1)); else puts(""); } else { if(a[i] == 1) printf("x^%d",i); else if(a[i]==-1) printf("-x^%d",i); else printf("%dx^%d",a[i],i); for(i = i -1 ; i > 1; --i) { if(a[i] != 0) { if(a[i] == 1) printf(" + x^%d",i); else if(a[i] == -1) printf(" - x^%d",i); else if(a[i] > 1) printf(" + %dx^%d",a[i],i); else printf(" - %dx^%d",a[i] * (-1),i); } } if(a[1] != 0) { if(a[1] == 1) printf(" + x"); else if(a[1] == -1) printf(" - x"); else if(a[1] > 1) printf(" + %dx",a[1]); else printf(" - %dx",a[1] * (-1)); } if(a[0] != 0) { if(a[0] > 0) printf(" + %d",a[0]); else printf(" - %d",a[0] * (-1)); } puts(""); } } }
相关文章推荐
- POJ 1555 Polynomial Showdown
- poj 1555 Polynomial Showdown 模拟
- poj 1555 Polynomial Showdown
- POJ1555 Polynomial Showdown (输出多项式)
- POJ1555 ZOJ1720 UVA392 UVALive5309 Polynomial Showdown题解
- (数组的应用三:多项式的表示与处理4.3.1)POJ 1555 Polynomial Showdown(多项式的输出)
- poj 1555 Polynomial Showdown
- POJ 2249 Binomial Showdown(我的水题之路——求n个数里取m个数的值)
- POJ 1003 Hangover(水题) 权当复习…
- POJ 3224 Go for Lab Cup!(我的水题之路——赢的场数最多)
- poj 1258 Agri-Net 水题三连发。。。又是kruscal
- POJ 1125 最短路的水题
- poj 1401 Factorial(数学水题)
- 【1004】Financial Management (POJ)(水题——求平均值)
- poj入门水题整理4
- POJ 2033 Alphacode(26编码,水题)
- 【POJ 2407】Relatives(欧拉函数-水题)
- POJ 2506 Tiling dp+大数 水题
- POJ 1125 Stockbroker Grapevine 最短路水题floyd || dijkstra
- poj1004 水题一道