POJ 3370 Halloween treats
来源:互联网 发布:php beast 解密 编辑:程序博客网 时间:2024/05/22 15:34
题目大意:输入n,m,以及m个数据,求可被n整除的一个组合。。。由于是任意组合~所以样例不一定是对的~~~
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 andn (1 ≤ c ≤ n ≤ 100000), the number of children and the number of neighbours, respectively. The next line containsn space separated integers a1 , ... ,an (1 ≤ ai ≤ 100000 ), whereai represents the number of sweets the children get if they visit neighbouri.
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, indexi corresponds to neighbour i who gives a total number ofai 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
/*其实这是一道数学题~嗯嗯…抽屉原理的说~~~*/#include<stdio.h>#define M 100005int a[M];int main(){int n,m,t,i,j;int flag,sum;int L,R;while(scanf("%d%d",&n,&m),n+m){sum=0; flag=1;for(i=0;i<=n;i++){a[i]=0;}for(i=1;i<=m;i++){scanf("%d",&t);sum=(sum+t)%n;if(flag){if(sum==0){L=1; R=i; flag=0; continue; }else if(a[sum]){L=a[sum]+1; R=i; flag=0; continue; }a[sum]=i;}}for(i=L;i<=R;i++){printf("%d%c",i,i==R?'\n':' ');}}return 0;}
- 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
- [置顶]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(抽屉原理)
- MySQL创建用户与授权(常用备查)
- linux vi 命令大全
- jQuery Select的操作集合
- mysql数据库的日志功能开启配置
- How to configure IPMI to work with Oracle RAC
- POJ 3370 Halloween treats
- 表格的横纵转
- EPOLL为我们带来了什么
- sql case when
- counting 1 bits C implementations
- hbase 根据需求创建组合索引(组合rowkey)及组合索引创建规则
- Double 精度问题总结
- shell调用expect
- 勾股数,gcd