pku 3370 Halloween treats(鸽巢原理)
来源:互联网 发布:做java工程师有多累 编辑:程序博客网 时间:2024/06/05 09:05
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
#include<stdio.h>#include<string.h>long long c[100005],mark[100005],x;int main(){ int m,n,i,j,flag,temp; while(scanf("%d%d",&m,&n)&&n+m) { memset(mark,0,sizeof(mark)); for(c[0]=flag=0,i=1;i<=n;i++) { scanf("%I64d",&x); if(flag) continue; c[i]=c[i-1]+x; temp=c[i]%m; if(temp==0) { for(j=1;j<i;j++) printf("%d ",j); printf("%d\n",j); flag=1; } else if(mark[temp]) { for(j=mark[temp]+1;j<i;j++) printf("%d ",j); printf("%d\n",j); flag=1; } mark[temp]=i; } } return 0;}
- pku 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 && HDU 1808 Halloween treats(鸽巢原理)
- POJ 3370-Halloween treats(鸽巢原理)
- POJ 3370:Halloween treats(鸽巢原理)
- 鸽巢原理应用-分糖果 POJ 3370 Halloween treats
- POJ 3370 Halloween treats 鸽巢原理 解题
- poj 3370 Halloween treats (组合数学:鸽巢原理)
- 数学 ( 鸽巢原理 )——Halloween treats ( POJ 3370 )
- UVA11237 Halloween treats (鸽巢原理)
- POJ3370&HDU1808 Halloween treats【鸽巢原理】
- Java nio 传输文件
- 并查集入门题集 POJ1611 POJ1703 POJ2524 POJ1182
- 【tablespace】一图搞懂extent,segment,block
- elasticsearch的基本用法
- Java--多线程断点下载
- pku 3370 Halloween treats(鸽巢原理)
- 封装 继承 多态
- 中国模式其实是不存在的
- eclipse 添加 Courier New 字体
- Extjs4表头及列头事件
- asp.net 中<% %>、<%@ %>、<%# %>、<%= %>、<%$ %>的用法
- 欢迎访问新的技术网站:www.it161.com
- 回溯法
- Find m arrangements from n set