Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Halloween treats
Description Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a child will get nothing if it is too late. To avoid conflicts, the children have decided they will put all sweets together and then divide them evenly among themselves. From last year's experience of Halloween they know how many sweets they get from each neighbour. Since they care more about justice than about the number of sweets they get, they want to select a subset of the neighbours to visit, so that in sharing every child receives the same number of sweets. They will not be satisfied if they have any sweets left which cannot be divided. Your job is to help the children and present a solution. Input The input contains several test cases. (n1 ≤ c ≤ n ≤ 100000), the number of children and the number of neighbours, respectively. The next line contains space separated integers n (a_{1} , ... , a_{n}1 ≤ a), where _{i} ≤ 100000 represents the number of sweets the children get if they visit neighbour a_{i}.iThe last test case is followed by two zeros. Output For each test case output one line with the indices of the neighbours the children should select (here, index who gives a total number of i sweets). If there is no solution where each child gets at least one sweet print "no sweets" instead. Note that if there are several solutions where each child gets at least one sweet, you may print any of them.a_{i}Sample Input 4 5 1 2 3 7 5 3 6 7 11 2 5 13 17 0 0 Sample Output 3 5 2 3 4 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator