Cody

Solution 1928084

Submitted on 9 Sep 2019 by Nikolaos Nikolaou
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
p=[2]; N=8; y_correct=256; assert(isequal(polypow(p,N),y_correct))

l = 4 l = 8 l = 16 l = 32 l = 64 l = 128 l = 256 q = 256

2   Pass
p=[1 1]; N=1; y_correct=[1 1]; assert(isequal(polypow(p,N),y_correct))

q = 1 1

3   Pass
p=[1 1]; N=5; y_correct=[1 5 10 10 5 1]; assert(isequal(polypow(p,N),y_correct))

l = 1 2 1 l = 1 3 3 1 l = 1 4 6 4 1 l = 1 5 10 10 5 1 q = 1 5 10 10 5 1

4   Pass
p=1:5; N=3; y_correct=[1 6 21 56 126 234 369 504 594 574 465 300 125]; assert(isequal(polypow(p,N),y_correct))

l = 1 4 10 20 35 44 46 40 25 l = 1 6 21 56 126 234 369 504 594 574 465 300 125 q = 1 6 21 56 126 234 369 504 594 574 465 300 125

5   Pass
p=5:-1:1; N=3; y_correct=[125 300 465 574 594 504 369 234 126 56 21 6 1]; assert(isequal(polypow(p,N),y_correct))

l = 25 40 46 44 35 20 10 4 1 l = 125 300 465 574 594 504 369 234 126 56 21 6 1 q = 125 300 465 574 594 504 369 234 126 56 21 6 1

6   Pass
p=5:-1:1; N=1; y_correct=[5 4 3 2 1]; assert(isequal(polypow(p,N),y_correct))

q = 5 4 3 2 1