POJ 题目3370 Halloween treats(鸽巢原理)
来源:互联网 发布:奥尼尔06年总决赛数据 编辑:程序博客网 时间:2024/06/05 23:46
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 51 2 3 7 53 67 11 2 5 13 170 0
Sample Output
3 52 3 4
Source
Ulm Local 2007
ac代码
#include<stdio.h>#include<string.h>int sum[100010],hash[100010];int main(){int n,m;while(scanf("%d%d",&m,&n)!=EOF,n||m){int i;sum[0]=0;for(i=1;i<=n;i++){int x;scanf("%d",&x);sum[i]=(sum[i-1]+x)%m;}memset(hash,0,sizeof(hash));int s,t;s=t=1;for(i=1;i<=n;i++){if(sum[i]==0){t=i;break;}elseif(hash[sum[i]]){s=hash[sum[i]]+1;t=i;break;}else{hash[sum[i]]=i;}}for(i=s;i<t;i++){printf("%d ",i);}printf("%d\n",t);}}
- POJ 题目3370 Halloween treats(鸽巢原理)
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats - 鸽巢原理
- POJ 3370 Halloween treats【鸽巢原理】
- poj 3370 Halloween treats(反演定理+鸽巢原理)
- POJ 3370 Halloween treats(鸽巢原理)
- POJ 3370 && HDU 1808 Halloween treats(鸽巢原理)
- POJ 3370-Halloween treats(鸽巢原理)
- POJ 3370:Halloween treats(鸽巢原理)
- POJ 3370 Halloween treats(抽屉原理)
- POJ 3370 Halloween treats(抽屉原理)
- POJ 3370 Halloween treats(抽屉原理)
- POJ 3370 Halloween treats(抽屉原理)
- POJ-3370 Halloween treats (抽屉原理)
- 鸽巢原理应用-分糖果 POJ 3370 Halloween treats
- POJ 3370 Halloween treats 鸽巢原理 解题
- Fiddler 教程
- Paxos算法2-算法过程
- 字符串转换成整数java实现
- javafx由浅到深的认识(二)——Pagination控件和TableView控件的运用
- Paxos算法与Zookeeper分析
- POJ 题目3370 Halloween treats(鸽巢原理)
- Static用法说明
- Android ActionBar详解
- Fragment生命周期
- MFC的RTTI
- PL/SQL Developer使用技巧、快捷键
- 【bzoj 2179】FFT
- 依赖注入及AOP简述系列文章
- UVa 193 图着色