HDU5095——水过——Linearization of the kernel functions in SVM

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T;
int a[11];
int vis[11];
char b[12] = "pqruvwxyz";
int main()
{
    scanf("%d",&T);
    while(T--){
        memset(vis,0,sizeof(vis));
        for(int i = 1; i <= 10 ; i++){
            scanf("%d",&a[i]);
            if(a[i] == 0)
                vis[i] = 1;
        }
        if(a[1] == 0&&a[2] ==0&& a[3] ==0&& a[4] ==0&& a[5] ==0&& a[6] ==0&& a[7] ==0&& a[8] ==0&& a[9] ==0&& a[10] == 0){
            printf("0\n");
            continue;
        }
        int flag = 1;
        for(int i = 1; i <= 10 ; i++){
            if(a[i] == 0) continue;
            if(flag && a[i]){
                if(i!=10){
                    if(a[i] == 1)
                    printf("%c",b[i-1]);
                    else if(a[i] == -1)
                        printf("-%c",b[i-1]);
                    else 
                       printf("%d%c",a[i],b[i-1]);
                }
                else printf("%d",a[i]);
                flag = 0;
            }
            else {
                if(a[i] > 0){
                    printf("+");
                    if(i!=10){
                    if(a[i] == 1)
                        printf("%c",b[i-1]);
                    else 
                    printf("%d%c",a[i],b[i-1]);
                    }
                    else printf("%d",a[i]);
                }
                else {
                    printf("-");
                    if(i!=10){
                    if(a[i] == -1)
                        printf("%c",b[i-1]);
                    else 
                    printf("%d%c",-a[i],b[i-1]);
                    }
                    else printf("%d",-a[i]);
                }
            }
        }
        puts("");
    }
    return 0;
}