給N個數字在這些數字中加入加號和減號，問是否能組成可被K整除的數字
Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. There are eight possible expressions:
17 + 5 + -21 + 15 = 16
17 + 5 + -21 - 15 = -14
17 + 5 - -21 + 15 = 58
17 + 5 - -21 - 15 = 28
17 - 5 + -21 + 15 = 6
17 - 5 + -21 - 15 = -24
17 - 5 - -21 + 15 = 48
17 - 5 - -21 - 15 = 18
We call the sequence of integers divisible by K if + or - operators can be placed between integers in the sequence in such way that resulting value is divisible by K. In the above example, the sequence is divisible by 7 (17+5+-21-15=-14) but is not divisible by 5.
You are to write a program that will determine divisibility of sequence of integers.
第一行有個T代表測資數
每筆的第一行有N和K(1 ≤ N ≤ 10000, 2 ≤ K ≤ 100)
第二行有N個數字
The first line of the input file contains a integer M indicating the number of cases to be analyzed. Then M couples of lines follow.
For each one of this couples, the first line of the input file contains two integers, N and K (1 ≤ N ≤ 10000, 2 ≤ K ≤ 100) separated by a space.
The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it’s absolute value.
如可可以輸出"Divisible"(不含雙引號)
否則輸出"Not divisible"(不含雙引號)
For each case in the input file, write to the output file the word ‘Divisible’ if given sequence of integers is divisible by K or ‘Not divisible’ if it’s not.
2 4 7 17 5 -21 15 4 5 17 5 -21 15
Divisible Not divisible
公開 測資點#0 (20%): 1.0s , <10M
公開 測資點#1 (19%): 1.0s , <10M
公開 測資點#2 (20%): 0.5s , <10M
公開 測資點#3 (20%): 0.5s , <10M
公開 測資點#4 (21%): 0.5s , <10M
2019 9月CPE第六題