joj1013 Polynomial Multiplication

  1013 : Polynomial Multiplication

Result
TIME Limit
MEMORY Limit
Run Times
AC Times
JUDGE
3s
8192K
4660
807
Standard
A polynomial is a sum of terms, where each term is a coefficient multiplied by the variable x raised to some nonnegative integer power. The largest such power is referred to as the degree of the polynomial. For example: x^3+x^2+x+1, x^3+x, x^2, and 1 are all polynomials.

Input

A positive integer denoting the number of cases.
(The degree of polynomial 1) followed by the value of each coefficient for polynomial 1.
(The degree of polynomial 2) followed by the value of each coefficient for polynomial 2.
No polynomial will have degree greater than five. All coefficients will be greater than or equal to zero and less than 65536. Each polynomial will be on a separate line. A blank line will separate each case.

Output

The product of polynomial 1 and polynomial 2. The caret symbol (^) should be used to denote exponentiation. That is, x^2 means x*x. But, instead of x^1, just use x, and instead of x^0, use nothing. Terms where the coefficient is 0 must be omitted.

Example

In this example we multiply the following two sets of polynomials:
x^4+2x^3+x^2+5x and x^3+2x^2+1
x^3+x+1 and 2x^3+x+2

Input

2

4 1 2 1 5 0

3 1 2 0 1



3 1 0 1 1

3 2 0 1 2

Output

x^7 + 4x^6 + 5x^5 + 8x^4 + 12x^3 + x^2 + 5x

2x^6 + 3x^4 + 4x^3 + x^2 + 3x + 2

 
This problem is used for contest:  187    198  
Submit  /  Problem List  /  Status  /  Discuss
 
다항식 곱셈은 두 개의 수조를 열어 곱셈 결과를 반복하여 세 번째 수조에 존재하는 것이다.
출력 형식 변태 주의...처음에 로컬 실행을 쓸 수 있었는데, 제출하자마자 시간을 초과했습니다.
처음에'+'를 처리할 때 두 번째부터 모두'+%dx^%d'라고 썼기 때문에 for에서 while를 열어 첫 번째 항목을 찾았습니다. 과감하게 시간을 초과했습니다.
나중에 "+"처리와 디지털 처리를 분리합니다, AC.

 1 #include <stdio.h>

 2 #include <string.h>

 3 

 4 int main()

 5 {

 6     freopen("in.txt", "r", stdin);

 7 

 8     int sample, high1, high2, i, j, k, t;

 9     int a[30], b[30], c[60];

10 

11     scanf("%d", &sample);

12 

13     while (sample--)

14     {

15         memset(c, 0, sizeof(a));

16 

17         scanf("%d", &high1);

18         for (i=high1; i>=0; --i)

19         {

20             scanf("%d", &a[i]);

21         }

22         scanf("%d", &high2);

23         for (i=high2; i>=0; --i)

24         {

25             scanf("%d", &b[i]);

26         }

27 

28         for (i=0; i<high1+1; ++i)

29         {

30             for (j=0; j<high2+1; ++j)

31             {

32                 c[i+j] += a[i]*b[j];

33             }

34         }

35 

36 

37         // 0

38         int flagprint = 1;

39         for (k=high1+high2; k>=0; --k)

40         {

41             if (c[k])

42             {

43                 flagprint = 0;

44             }

45         }

46         if (flagprint)

47         {

48             printf("0");

49         }

50 

51         int flag = 0;

52         for (k=high1+high2; k>=0; --k)

53         {

54             if (0 != c[k])

55             {

56                 flag = 1;

57                 if (1 != c[k] && 0 != k)

58                 {

59                     printf("%d", c[k]);

60                 }

61                 else if (0 == k)

62                 {

63                     printf("%d", c[k]);

64                 }

65 

66                 if (k != 0)

67                 {

68                     printf("x");

69                 }

70                 if (k > 1)

71                 {

72                     printf("^%d", k);

73                 }

74             }

75             if (0 != k && flag)

76             {

77                 if (0 != c[k-1])

78                 {

79                     printf(" + ");

80                 }

81 

82             }

83         }

84 

85         printf("
");

86     }

87 

88     return 0;

89 }