pat 1002

还有一个测试用例没有通过，暂存于此。

// pat_test.cpp : 定义控制台应用程序的入口点。

//
#define   __1002__ENABLE__
#ifdef  __1002__ENABLE__
#include "stdio.h"
#define  MAXN  1000
typedef struct poly{
int exp;
float  cof;
} Poly;




int   main(int argc,char * argv[])
{
Poly  seq_a[MAXN] = {0}, seq_b[MAXN] = {0},seq_c[MAXN*2];
int seq_a_count = 0,seq_b_count = 0,seq_c_count = 0;
int i =0 ;
scanf("%d",&seq_a_count);
for(i =0 ; i < seq_a_count;i++ )
{
scanf("%d %f",&seq_a[i].exp,&seq_a[i].cof);
}


i =0 ;
scanf("%d",&seq_b_count);
for(i =0 ; i < seq_b_count;i++ )
{
scanf("%d %f",&seq_b[i].exp,&seq_b[i].cof);
}


i = 0;
int j = 0,k = 0; 
double zero = 0;
while(j < seq_a_count&& k < seq_b_count)
{
if(seq_a[j].exp > seq_b[k].exp)
{
seq_c[i].exp = seq_a[j].exp;
seq_c[i].cof = seq_a[j].cof;
if( (int)(seq_c[i].cof) != 0)
{
i++;
}
j++;
}
else
if(seq_a[j].exp < seq_b[k].exp)
{
seq_c[i].exp = seq_b[k].exp;
seq_c[i].cof = seq_b[k].cof;
if( (int)(seq_c[i].cof) != 0)
{
i++;
}
k++;
}
else
{
seq_c[i].exp = seq_b[k].exp;
seq_c[i].cof = seq_b[k].cof + seq_a[j].cof;
if( (int)(seq_c[i].cof) != 0)
{
i++;
}
k++;
j++;
}


}


while(j < seq_a_count)
{
seq_c[i].exp = seq_a[j].exp;
seq_c[i].cof = seq_a[j].cof;
i++;
j++;
}


while( k < seq_b_count)
{
seq_c[i].exp = seq_b[k].exp;
seq_c[i].cof = seq_b[k].cof;
i++;
k++;
}


seq_c_count = i;
if(seq_c_count != 0)
printf("%d",seq_c_count);


for( i  = 0 ;i < seq_c_count; i++)
{
if(  (int)(seq_c[i].cof) != 0)
{
printf(" %d %.1f",seq_c[i].exp,seq_c[i].cof );
}
}
printf("\n");
return 0;
}


#endif