SWUST数据结构--一元多项式的加法[数组]

#include<iostream>
using namespace std;

int main()
{
	int a[1000]={0},b[1000]={0},c[1000]={0};
	int i,j;
	char ch;
	
	while(cin>>i>>ch>>j)
	{
		if(i == 0 && j == 0) break;
		else a[j]=i;
	}
    
	while(cin>>i>>ch>>j)
	{
		if(i == 0 && j == 0) break;
		else b[j]=i;		
	}

	int flag = 0;
	for(i=0;i<1000;i++)
	{
		c[i] = a[i] + b[i];
		if(flag == 0)
		{
			if(c[i]!=0)
			{
				cout<<c[i]<<"x^"<<i;
				flag = 1;
			}
		}
		else if(flag ==1)
		{
			if(c[i]!=0)
			{
				cout<<'+'<<c[i]<<"x^"<<i;
				flag = 1;
			}
		}
	}

	return 0;
}