poj 3370 Halloween treats 【抽屉原理】
来源:互联网 发布:淘宝上的ipad是真的吗 编辑:程序博客网 时间:2024/05/17 03:47
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
因为题目中n >= c则一定存在解。 详细看我上一篇
注意两点:1,数据会超int;2,C++提交不要用G++。
#include <cstdio>#include <cstring>#define LL long long#define MAX 100000+10using namespace std;LL sum;int vis[MAX], a[MAX];int main(){int c, n;int i, j;int start, end;int exist;while(scanf("%d%d", &c, &n) ,c||n){sum = 0; exist = 0;memset(vis, 0, sizeof(vis));for(i = 1; i <= n; i++){scanf("%d", &a[i]);if(exist)continue;sum += a[i];if(sum % c == 0){exist = 1;start = 1;end = i;continue;}if(vis[sum%c] == 0)vis[sum%c] = i;else{start = vis[sum%c]+1;end = i;exist = 1;continue;}}j = 0;for(i = start; i <= end; i++){if(j > 0) printf(" ");printf("%d", i);j++;}printf("\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(抽屉原理 & STL)
- 【Poj】-3370-Halloween treats(抽屉原理&STL)
- POJ3370 Halloween treats 抽屉原理
- 抽屉原理-poj3370-Halloween treats
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- Mybatis学习(2)以接口的方式编程
- VS2013中使用QT编程时visual assisent(VA)不能自动补全
- Java路径和java获取项目内文件
- Java 编程,打印昨天的当前时刻.
- Java屏幕截取全屏
- poj 3370 Halloween treats 【抽屉原理】
- 动态编译,远端调用Windchill方法
- 移动web开发知识
- SqlServer 错误日志切换和查看
- Linux下编译安装Apache及模块
- 【LeetCode】【JavaScript】Find Peak Element
- C++ string实现原理2
- linux使用telnet自动发送mail.
- SuperExplorer 1.54分析