Description

假設有兩多項式
f(x) = A₁x^a₁ + A₂x^a₂ + A₃x^a₃ + ...
g(x) = B₁x^b₁ + B₂x^b₂ + B₃x^b₃ + ...
其中係數皆為整數, 次方皆為非負整數並且f的次方不重複且由小排到大, g的次方也不重複且由小排到大

則給定兩組係數序列{(A₁,a₁), (A₂,a₂), (A₃,a₃), ...}與{(B₁,b₁), (B₂,b₂), (B₃,b₃), ...}
和一整數n

求f(n) + g(n) = ?

例如

n = 12
{(3,0), (-4,3), (100,4), (-3000,65536)}與{(-12,2), (101,4), (3000,65536)}

會有

底下是部分程式碼

#include 
#define MAX_TERM 100

int A[MAX_TERM], a[MAX_TERM];
int B[MAX_TERM], b[MAX_TERM];
int C[MAX_TERM], c[MAX_TERM];

int main()
{
    int i, j, k, n, result;
    int f_terms, g_terms, fg_terms;

    scanf("%d", &f_terms);
    for(i = 0; i < f_terms; i++){
        scanf("%d %d", &A[i], &a[i]);
    }
    scanf("%d", &g_terms);
    for(i = 0; i < g_terms; i++){
        scanf("%d %d", &B[i], &b[i]);
    }
    scanf("%d", &n);

    /* ??? */

    printf("%d", result);
    return 0;
}
 

Input

f(x)的項數

係數 次方

g(x)的項數

係數次方

n

Output

f(n) + g(n)

Sample Input  Download

Sample Output  Download

Tags

Discuss