1. You have to make an array of n elements where the summation of any SUBARRAY won't be divisible by m (n > m).↵
Is it possible? If not then proof?↵
2. You have to make an array of n elements where the summation of any SUBSET won't be divisible by m (n > m).↵
Is it possible? If not then proof?↵
for simplicity: 1 <= n, m <= 100000
Is it possible? If not then proof?↵
2. You have to make an array of n elements where the summation of any SUBSET won't be divisible by m (n > m).↵
Is it possible? If not then proof?↵
for simplicity: 1 <= n, m <= 100000
