一元n次方程

code:

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int i,j,k;
int temp,n;
scanf("%d",&n);
scanf("%d",&temp);

if(temp!=1) printf("%d",temp);

printf("x^%d",n);
for(i=n-1;i>=1;i--){
	scanf("%d",&temp);
	if(temp!=0){
		if(temp<0){
			temp=-temp;
			printf("-");
		}else 
			printf("+");
	
	}else
	continue;
	
	if(temp!=1) printf("%d",temp);
	
	if(i!=1) printf("x^%d",i);
else
printf("x\n"); 
 }
 	return 0;
 }