首页 > 代码库 > hdu 5095

hdu 5095

2024-08-08 14:25:43   210人阅读

Linearization of the kernel functions in SVM

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1001    Accepted Submission(s): 286


Problem Description
SVM（Support Vector Machine）is an important classification tool, which has a wide range of applications in cluster analysis, community division and so on. SVM The kernel functions used in SVM have many forms. Here we only discuss the function of the form f(x,y,z) = ax^2 + by^2 + cy^2 + dxy + eyz + fzx + gx + hy + iz + j. By introducing new variables p, q, r, u, v, w, the linearization of the function f(x,y,z) is realized by setting the correspondence x^2 <-> p, y^2 <-> q, z^2 <-> r, xy <->u, yz <-> v, zx <-> w and the function f(x,y,z) = ax^2 + by^2 + cy^2 + dxy + eyz + fzx + gx + hy + iz + j can be written as g(p,q,r,u,v,w,x,y,z) = ap + bq + cr + du + ev + fw + gx + hy + iz + j, which is a linear function with 9 variables.

Now your task is to write a program to change f into g.
 

 

Input
The input of the first line is an integer T, which is the number of test data (T<120). Then T data follows. For each data, there are 10 integer numbers on one line, which are the coefficients and constant a, b, c, d, e, f, g, h, i, j of the function f(x,y,z) = ax^2 + by^2 + cy^2 + dxy + eyz + fzx + gx + hy + iz + j.
 

 

Output
For each input function, print its correspondent linear function with 9 variables in conventional way on one line.
 

 

Sample Input
20 46 3 4 -5 -22 -8 -32 24 272 31 -5 0 0 12 0 0 -49 12
 

 

Sample Output
46q+3r+4u-5v-22w-8x-32y+24z+272p+31q-5r+12w-49z+12
 

 

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<string>#include<algorithm>#include<queue>#include<vector>#include<set>using namespace std;char s[10]={‘1‘,‘p‘,‘q‘,‘r‘,‘u‘,‘v‘,‘w‘,‘x‘,‘y‘,‘z‘};int t;int a[11];int main(){      scanf("%d",&t);      while(t--)      {            bool flag=true;            for(int i=1;i<=10;i++)                  scanf("%d",&a[i]);            for(int i=1;i<=10;i++)            {                 if(a[i]==0) continue;                 if(!flag||a[i]<0)                        printf("%c",a[i]<0?‘-‘:‘+‘);                 if(i==10||abs(a[i])!=1)                        printf("%d",abs(a[i]));                 if(i<10)                        printf("%c",s[i]);                 flag=false;            }            if(flag)                  printf("0");            printf("\n");      }      return 0;}

　　

hdu 5095


联系
我们