| ENG RUS | Timus Online Judge |
1244. GentlemenTime limit: 0.5 second Memory limit: 64 MB Let's remember one old joke: Once a gentleman said to another gentleman: — What if we play cards? — You know, I haven't played cards for ten years… — And I haven't played for fifteen years… So, little by little, they decided to resurrect their youth. The first gentleman asked a servant to bring a pack of cards, and before starting playing out weighed in his hand the pack. — It seems to me, one card is missing from the pack… — he said and gave the pack to the other gentleman. — Yes, the nine of spades, — the man agreed. An incomplete pack of cards is given. The program should determine which cards are missing. InputThe first line contains a positive integer, which is the weight in milligrams of the given incomplete pack. The second line contains an integer N, 2 ≤ N ≤ 100 — the number of cards in the complete pack. In the next N lines there are integers from 1 to 1000, which are the weights of the cards in milligrams.
It's guaranteed that the total weight of all cards in the complete pack is strictly greater than the weight of the incomplete pack. OutputIf there is no solution, then output the single number 0. If there are more than one solutions, then you should write −1. Finally, if it is possible to determine unambiguously which cards are missing in the incomplete pack as compared to the complete one, then output the numbers of the missing cards separated with a space in ascending order. Samples
Problem Author: Alexander Petrov Problem Source: Ural State University Personal Programming Contest, March 1, 2003 Tags: dynamic programming |