17 - 01 - 08 POJ 1555

Polynomial Showdown

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5096		Accepted: 1711

Description

Given the coefficients of a polynomial from degree 8 down to 0, you are to format the polynomial in a readable format with unnecessary characters removed. For instance, given the coefficients 0, 0, 0, 1, 22, -333, 0, 1, and -1, you should generate an output line which displays x^5 + 22x^4 - 333x^3 + x - 1. 
The formatting rules which must be adhered to are as follows: 

1. Terms must appear in decreasing order of degree. 

2. Exponents should appear after a caret `"^". 

3. The constant term appears as only the constant. 

4. Only terms with nonzero coefficients should appear, unless all terms have zero coefficients in which case the constant term should appear. 

5. The only spaces should be a single space on either side of the binary + and - operators. 

6. If the leading term is positive then no sign should precede it; a negative leading term should be preceded by a minus sign, as in -7x^2 + 30x + 66. 

7. Negated terms should appear as a subtracted unnegated term (with the exception of a negative leading term which should appear as described above). That is, rather than x^2 + -3x, the output should be x^2 - 3x. 

8. The constants 1 and -1 should appear only as the constant term. That is, rather than -1x^3 + 1x^2 + 3x^1 - 1, the output should appear as-x^3 + x^2 + 3x - 1.

Input

The input will contain one or more lines of coefficients delimited by one or more spaces. There are nine coefficients per line, each coefficient being an integer with a magnitude of less than 1000.

Output

The output should contain the formatted polynomials, one per line.

Sample Input

0 0 0 1 22 -333 0 1 -1
0 0 0 0 0 0 -55 5 0

Sample Output

x^5 + 22x^4 - 333x^3 + x - 1
-55x^2 + 5x

<转>http://blog.163.com/happyliyifan@126/blog/static/374627722014727102057807/

#include<iostream>
#include<cstdio>
#include<cstring>
const int N = 9;
using namespace std;
int fabs(int a){
	return a < 0 ? -a : a;
}
int main(){
	int a[N];
	while(~scanf("%d",&a[0])){
		for(int i = 1; i < N; i++)
			scanf("%d",&a[i]);
		bool first = true;
		for(int i = 0; i < N; i++)
			if(a[i]){
				if(first){
					if(a[i] == -1 && i< N - 1)//current is -1
						printf("-");
					else if(a[i] != 1 || i == N - 1)
						printf("%d",a[i]);///current isn't 1
					if(i == N - 2)
						printf("x");//index is 1, not print; isn't 1, print
					else if(i < N - 1)
						printf("x^%d",N - i - 1);
					first = false;
				}
				else{//是第一个非零系数后的非零系数，则先输出符号再输出系数绝对值
					cout<<' '<<(a[i] < 0 ? '-' : '+')<<' ';//print + or -
					if(fabs(a[i]) != 1 || i ==  N-1)//系数为1，不输出
						printf("%d",fabs(a[i]));
					if(i == N - 2)//指数为1，不输出；大于1时，输出
						printf("x");
					else if(i < N - 1)
						printf("x^%d",N - i - 1);
				}
			}
		if(first)//所有系数都为0，输出0
			printf("0");
		puts("");
	}
	return 0;
}