【杂题】 HDOJ 5095 Linearization of the kernel functions in SVM

签到题。。考虑细节

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 10005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

char s[] = "0pqruvwxyz";
void work(void)
{
    int ok = 0, x, flag = 0;
    scanf("%d", &x);
    if(x != 0) {
        ok = 1;
        if(x == 1) printf("%c", s[1]);
        else if(x == -1) printf("-%c", s[1]);
        else printf("%d%c", x, s[1]);
        flag = 1;
    }
    for(int i = 2; i < 10; i++) {
        scanf("%d", &x);
        if(x == 0) continue;
        ok = 1;
        if(x > 0 && flag) printf("+");
        if(flag == 0) flag = 1;
        if(x == 1) printf("%c", s[i]);
        else if(x == -1) printf("-%c", s[i]);
        else printf("%d%c", x, s[i]);
    }
    scanf("%d", &x);
    if(x != 0) {
        ok = 1;
        if(x > 0 && flag) printf("+");
        printf("%d", x);
    }
    else if(x == 0 && ok == 0) printf("0");
    printf("\n");
}

int main(void)
{
    int _;
    while(scanf("%d", &_)!=EOF) {
        while(_--) {
            
            work();
        }
    }    

    return 0;
}