瑕佹眰涓や釜澶氶」寮忕殑鍜岋紝鍙互灏嗕袱涓椤瑰紡鐨勭郴鏁扮浉鍔犮€?/p>

鍋囪鏈変袱涓椤瑰紡 P1 鍜?P2锛屽垎鍒负锛?/p>

P1 = a1x^n + a2x^(n-1) + 鈥?+ an*x + a(n+1)

P2 = b1x^m + b2x^(m-1) + 鈥?+ bm*x + b(m+1)

鍏朵腑锛宯 鏄?P1 鐨勬渶楂樻鏁帮紝m 鏄?P2 鐨勬渶楂樻鏁般€?/p>

鎴戜滑鍙互鍏堝垱寤轰竴涓柊鐨勫椤瑰紡 P3锛屽皢 P1 鍜?P2 鐨勭郴鏁扮浉鍔狅細

P3 = (a1 + b1)*x^(max(n, m)) + (a2 + b2)*x^(max(n, m)-1) + 鈥?+ (an + bn)*x + (a(n+1) + b(m+1))

鍙互浣跨敤鏁扮粍鏉ュ瓨鍌ㄥ椤瑰紡鐨勭郴鏁帮紝鍋囪鏈変袱涓暟缁?coef1 鍜?coef2 鍒嗗埆瀛樺偍 P1 鍜?P2 鐨勭郴鏁帮紝閭ｄ箞鍙互鐢ㄤ竴涓惊鐜皢绯绘暟鐩稿姞锛屽苟瀛樺偍鍒颁竴涓柊鐨勬暟缁?coef3锛?/p>

int n = ...; // P1 鐨勬渶楂樻鏁?/span>
int m = ...; // P2 鐨勬渶楂樻鏁?/span>
int len = max(n, m) + 1; // P3 鐨勭郴鏁颁釜鏁?/span>
int coef1[] = {a1, a2, ..., an, a(n+1)}; // P1 鐨勭郴鏁版暟缁?/span>
int coef2[] = {b1, b2, ..., bm, b(m+1)}; // P2 鐨勭郴鏁版暟缁?/span>
int coef3[len]; // P3 鐨勭郴鏁版暟缁?/span>
for (int i = 0; i < len; i++) {
if (i <= n && i <= m) {
coef3[i] = coef1[i] + coef2[i];
} else if (i <= n) {
coef3[i] = coef1[i];
} else {
coef3[i] = coef2[i];
}
}

鏈€鍚庯紝澶氶」寮?P3 鐨勭郴鏁伴兘瀛樺偍鍦?coef3 鏁扮粍涓紝鍙互鏍规嵁闇€瑕佽繘琛屽悗缁搷浣溿€?/p>