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
  • Vote: I like it
  • +6
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by void.abyss (previous revision, new revision, compare).

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +20 Vote: I do not like it
First
→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

http://matcomgrader.com/problem/5777/regalos/

Here is the problem in Spanish. If you are too lazy to translate it notice that in the first line you are given $$$n$$$ and $$$m$$$. You should find index of the values such that their sum is divisible by $$$m+1$$$

→ Reply