ZOJ 1720 Polynomial Showdown

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <map>
#include <cctype>

using namespace std;

int num[10];

int main()
{
//freopen("in.txt","r",stdin);
while(scanf("%d %d %d %d %d %d %d %d %d",&num[0],&num[1],&num[2],&num[3],&num[4],&num[5],&num[6],&num[7],&num[8])!=EOF)
{
int zhishu=8;
bool first=true;
for(int i=0; i<9; i++)
{
if(zhishu>0)
{
if(first)
{
if(num[i]==1)
{
printf("x");
if(zhishu>1)
printf("^%d",zhishu);
first=false;
}
else if(num[i]==-1)
{
printf("-x");
if(zhishu>1)
printf("^%d",zhishu);
first=false;
}
else if(num[i]!=0)
{
printf("%dx",num[i]);
if(zhishu>1)
printf("^%d",zhishu);
first=false;
}
}
else
{
if(num[i]==1)
{
printf(" + x");
if(zhishu>1)
printf("^%d",zhishu);
}
else if(num[i]==-1)
{
printf(" - x");
if(zhishu>1)
printf("^%d",zhishu);
}
else if(num[i]>0)
{
printf(" + %dx",num[i]);
if(zhishu>1)
printf("^%d",zhishu);
}
else if(num[i]<0)
{
printf(" - %dx",-num[i]);
if(zhishu>1)
printf("^%d",zhishu);
}
}
}
else
{
if(first)
{
if(num[i]!=0)
{
printf("%d",num[i]);
first=false;
}

}
else
{
if(num[i]>0)
{
printf(" + %d",num[i]);
}
else if(num[i]<0)
{
printf(" - %d",-num[i]);
}
}
}
zhishu--;
}
if(first)
printf("0");
printf("\n");
}
return 0 ;
}