void.abyss's blog

A Nice Constructive Problem.
By void.abyss, history, 5 years ago, In English
  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

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it