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 = 1617 + 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.
，失败是成功的亲娘，没有失败哪来的成功呢?诺贝尔如果不经历千万次的失败，
