C
来源:互联网 发布:jessyline姐妹品牌js 编辑:程序博客网 时间:2024/06/04 19:38
点击打开链接
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.
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.
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.
4 51 2 3 7 53 67 11 2 5 13 170 0
3 52 3 4
题目不难,不解释。。。。
#include<cstdio>#include<cstring>int a[100010],b[100010];__int64 s[100010];int c,n;void fun(){memset(b,-1,sizeof(b));s[0]=0;for(int i=1;i<=n;i++){scanf("%d",&a[i]);s[i]=s[i-1]+a[i];}b[0]=0;for(int i=1;i<=n;i++){int j;if(b[s[i]%c]!=-1){for(j=b[s[i]%c]+1;j<i;j++){printf("%d ",j);}printf("%d\n",i);return ;}b[s[i]%c]=i;}}int main(){while(scanf("%d%d",&c,&n),c||n){fun();}return 0;}
- c
- c
- c
- c
- C
- c
- c
- c
- C+
- c
- C
- c
- c
- c
- C
- C
- c
- C
- 抽象类 接口
- Java Application和Java Applet
- linux基本命令及操作9(软件安装)
- HDU5754(博弈)
- Spring Cloud微服务(3)之网关Zuul
- C
- 手写两个类,要体现构造,析构,拷贝构造,赋值,虚函数,重载函数等特点。
- JMock实践---(一)定义Expectations
- double四舍五入格式化
- 20170730学习笔记之泛型
- Map集合中value()方法与keySet()、entrySet()区别
- 51nod1070(Bash游戏V4)
- mq-3-amq连接
- 几种TCP连接中出现RST的场景分析