HDU 1808.Halloween treats【鸽巢原理】【11月25】
来源:互联网 发布:淘宝商城首页网站 编辑:程序博客网 时间:2024/06/05 18:25
alloween treats
Problem 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.
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.
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
翻译过来就是给定数列,从中找出几个数的和是c的倍数,输出这些数的位置。多解输出任意一个。。。
代码如下:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn = 100000 + 10;int mod[maxn], fl[maxn], c, n;long long sum[maxn];int main(){ while(scanf("%d %d", &c, &n)) { if(!(c + n)) break; int xbegin = 1, xend; memset(sum, 0, sizeof(sum)); memset(fl, 0, sizeof(fl)); for(int i = 1;i <= n; i++) { scanf("%d", &sum[i]); sum[i] += sum[i-1]; //cout << sum[i] << endl; mod[i] = sum[i] % c; if(mod[i] == 0) { xbegin = 1; xend = i; } else if(fl[mod[i]]) { xbegin = fl[mod[i]]; xend = i; } fl[mod[i]] = i + 1; } for(int i = xbegin;i <= xend; i++) { cout << i; if(i != xend) cout << " "; } cout << endl; } return 0;}
0 0
- HDU 1808.Halloween treats【鸽巢原理】【11月25】
- POJ 3370 && HDU 1808 Halloween treats(鸽巢原理)
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- POJ 3370 Halloween treats 鸽巢原理
- UVA11237 Halloween treats (鸽巢原理)
- POJ 3370 Halloween treats - 鸽巢原理
- POJ3370&HDU1808 Halloween treats【鸽巢原理】
- POJ3370 Halloween treats(数论:鸽巢原理)
- POJ 3370 Halloween treats【鸽巢原理】
- 鸽巢原理:hdu 1205 吃糖果+poj 2356 Find a multiple+poj 3370 Halloween treats
- hdu 1808 Halloween treats 抽屉原理
- hdu 1808 Halloween treats 抽屉原理
- hdu 1808 Halloween treats 抽屉原理
- HDU 1808 Halloween treats【抽屉原理】
- HDU 1808 Halloween treats(抽屉原理)
- poj 3370 Halloween treats(反演定理+鸽巢原理)
- 鸽巢原理应用-分糖果 POJ 3370 Halloween treats
- android webview加载URL 自适应屏幕
- Leetcode170: Course Schedule II
- C++primer plus第六版课后编程练习答案4.8
- 利用AFNetworking下载文件
- jasmine测试prototype方法
- HDU 1808.Halloween treats【鸽巢原理】【11月25】
- UITextField 设置placeholder的颜色
- 046 - Permutations
- WebRTC 简介
- Vmware虚拟机下Ubuntu上网设置方法图文详解
- android程序员必知的MVP框架开发技巧
- 047 - Permutations II
- Videoview 实现:暂停 播放 快进 启动
- 点击页面其它地方隐藏div所想到的jQuery的delegate