纯纯的恶意题,注意1,-1,0这三种情况,然后就可以AC了
#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<queue>
#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define MAXN 2009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
#define clr(a) memset(a,0,sizeof(a))
#define clr1(a) memset(a,-1,sizeof(a))
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
using namespace std;
inline ll Max(ll a,ll b)
{
return a>b?a:b;
}
inline ll Min(ll a,ll b)
{
return a<b?a:b;
}
char str[] = {'p','q','r','u','v','w','x','y','z'};
int main()
{
#ifdef ONLINE_JUDGE
#else
//freopen("an.txt","r", stdin);
#endif
int T;
int a[1009];
scanf("%d",&T);
while(T--)
{
clr(a);
cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9];
int sum = 0;
int flag = 0;
for(int i = 0; i<=8; i++)
{
if(i!=0)
{
if(a[i]>0&&flag)
printf("+");
}
if(a[i]==1)
{
flag = 1;
printf("%c",str[i]);
}
else if(a[i]==-1)
{
flag = 1;
printf("-%c",str[i]);
}
else if(a[i]==0)
{
continue;
}
else
{
flag = 1;
printf("%d%c",a[i],str[i]);
}
}
//cout<<flag<<endl;
if(flag)
{
if(a[9]>0)
printf("+");
if(a[9]!=0)
printf("%d\n",a[9]);
else
printf("\n");
}
else
{
printf("%d\n",a[9]);
}
}
return 0;
}
/*
2
1 -1 1 1 1 -1 -1 -1 0 0
0 0 0 0 0 0 0 0 0 0
*/