多项式加法

int []a = new int[101];
int []b = new int[101];
int []result = new int[101];
Scanner in = new Scanner(System.in);
		
for(int i = 0;i < a.length;++i) {
	a[i] = 0;
	b[i] = 0;
}
		
int expedient, cofficient;
while(true) {
	expedient = in.nextInt();
	cofficient = in.nextInt();
	a[expedient] = cofficient;
	if(expedient == 0) {
		break;
	}
}
while(true) {
	expedient = in.nextInt();
	cofficient = in.nextInt();
	b[expedient] = cofficient;
	if(expedient == 0) {
		break;
	}
}
		
for(int i = 0;i < result.length;++i) {
	result[i] = a[i] + b[i];
}
		
boolean first = true;
for(int i = result.length -1;i >= 0;--i) {
	if(result[i] != 0) {
		if(first) {
			first = false;
		}else {
			System.out.print("+");
		}
		System.out.print(result[i]);
		if(i != 0) {
			System.out.print("x" );
			if(i != 1) {
				System.out.print(i);
			}
		}
	}
			
}