Algorithms and Data Structures

Remove a Single Element

Given a list of n integers, you are asked to remove one of the integers in a way that the sum of the resulting sequence modulo m is equal to s. More formally, if the index of the removed element is r:
The program should find the index of that number or print Impossible if that kind of number does not exist.


The first line of the input contains 3 integers n (1 ≤ n ≤ ), m (1 ≤ m ≤ ), and s (0 ≤ s < m).
The second line contains n space-separated integers ().


In case such a number does not exist, the program should print Impossible, otherwise, the program should print the smallest index of such a number in the given sequence. The indexing starts from 1.


3 8 5 5 0 7
3 8 5 5 10 7


Time limit: 0.2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue