POJ 3370. Halloween treats 抽屉原理 / 鸽巢原理

Halloween treats

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7644		Accepted: 2798		Special Judge

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.
The first line of each test case contains two integers c and n (1 ≤ c ≤ n ≤ 100000), the number of children and the number of neighbours, respectively. The next line contains n space separated integers a₁ , ... , a_n (1 ≤ a_i ≤ 100000 ), where a_i represents the number of sweets the children get if they visit neighbour i.

The 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 i corresponds to neighbour i who gives a total number of a_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.

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

Ulm Local 2007

题目大意：

　　有$c$个孩纸，$n$个邻居，给出访问每个邻居会得到的糖果数量，在不考虑得到糖果总数量的情况下，试给出一种访问邻居的方案，使得到的糖果能被孩纸们完全均分。

基本思路：

　　1、此题与POJ2356是一样的思路，此题题解可看这里，下面只作简略分析。

　　2、此题数据保证$c\leqslant n$，因此由鸽巢原理，在$mod\ n$环下，令$S(n)=a_1+a_2+\cdots+a_n$，有$S(n_1)=S(n_2)$，即$[S(n_2)-S(n_1)]\%n=a_{n_1+1}+a_{n_1+2}+\cdots+a_{n_2}=0$，所以一定有解。

　　3、若此题不保证$c\leqslant n$的约束，则可以出现无解的情况，比如有$5$个孩纸，但只有$1$个邻居$1$颗糖。

　　4、若此题不保证$a_i\geqslant 1$的约束，则可以出现某个邻居不给糖的情况（$a_i=0$，给$0$颗糖），这样对结果不影响，但输出时可以忽略掉$0$的项。

　　5、如果无尽WA，请检查是否输出的是邻居的编号而不是糖的数目。

　　6、如果无尽TLE，这是因为此题有多组数据，请试试输出最小的解。

AC代码：

 #include <stdio.h>
 #include <string.h>

 const int maxn=;
 int c, n;
 int sw[maxn], sum[maxn], sgn[maxn];

 int main() {
     while(~scanf("%d%d",&c,&n)&&c) {
         int l=, r=maxn;
         memset(sgn, 0xff, sizeof(sgn)); sgn[]=;
         for(int i=; i<=n; i++) {
             scanf("%d", sw+i);
             sum[i]=(sum[i-]+sw[i])%c;
             if(!~sgn[sum[i]]) {
                 sgn[sum[i]]=i;
             }else if(i-sgn[sum[i]]<r-l) {
                 l=sgn[sum[i]];
                 r=i;
             }
         }
         for(int i=l+; i<r; i++)
             printf("%d ", i);
         printf("%d\n", r);
     }
     return ;
 }

POJ 3370

——本文原创by BlackStorm，转载请注明出处。

本文地址：http://www.cnblogs.com/BlackStorm/p/5245868.html