Linearization of the kernel functions in SVM

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;

void print(int a, char c)
{
    if(a < 0)
    {
        if(a != -1)
            printf("%d", a);
        else printf("-");
    }
    else
    {
        if(a != 1)
            printf("%d", a);
    }
    printf("%c", c);
}

int main()
{
    int T;
    char c[] = {'p', 'q', 'r', 'u', 'v', 'w', 'x', 'y', 'z'};
    scanf("%d", &T);
    int a[10];
    while( T-- )
    {
        for( int i = 0; i < 10; ++i )
        {
            scanf( "%d", &a[i] );
        }
        int k = 0;
        while( 0 == a[k] && k < 9 )
        {
            k++;
        }
        if( k < 9 )
            print( a[k], c[k] );
        else if( k >= 9 )
            printf( "%d", a[9] );
        for( int i = k + 1; i < 9; ++i )
        {
            if( a[i] < 0 )
                print( a[i], c[i] );
            else if( a[i] > 0 )
            {
                printf("+");
                print( a[i], c[i] );
            }
        }
        if( k < 9 )
        {
            if( a[9] > 0 )
                printf( "+%d", a[9] );
            else if( a[9] < 0 )
                printf( "%d", a[9] );
        }
        printf("\n");
    }
    return 0;
}