HDU1808&&POJ3370 Halloween treats（鸽巢定理）

HDU题目链接
POJ题目链接

Problem 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 a1 , … , an (1 ≤ ai ≤ 100000 ), where ai 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 ai 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

这道题的大致意思就是万圣节到了，要给小朋友分糖果了，现在一共有n个小朋友，m件房子，每件房子的主人准备了ai个糖果，每个小朋友分到的糖果必须一样，不然他们就会闹，问你怎么选择房子，使得小朋友分到的糖果一样多？
这道题运用到了鸽巢定理，运用前缀和，然后去判断这些和%m是否相等，如果相等，这证明两个数之间的序列加起来是m的和。
代码如下:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int a[maxn];
int vis[maxn];
int main(){
	int n,m;
	while(scanf("%d%d",&n,&m)&&n+m){
		for(int i=1;i<=m;i++)vis[i]=0;
		for(int i=1;i<=m;i++){
			scanf("%d",&a[i]);
		}
		int sum=0;
		for(int i=1;i<=m;i++){
			sum=sum+a[i];
			sum=sum%n;
			if(sum==0){
				for(int j=1;j<=i;j++)printf("%d%c",j,j==i?'\n':' ');
			    break;
			}
			if(vis[sum]){
				for(int j=vis[sum]+1;j<=i;j++){
					printf("%d%c",j,j==i?'\n':' ');
				}
				break;
			}
			vis[sum]=i;
		}
	}
}

道阻且长
自己选的路 跪着也要走完