HDU1808&&POJ3370-Halloween treats
来源:互联网 发布:linux基础试题 编辑:程序博客网 时间:2024/05/15 14:20
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
题意:给你n个数和c,取出一些数,使得这些数字和对c取模为0,输出这些数的位置
解题思路:关键点在c<=n,若前缀和对c取模为0,则直接输出所有数,否则的话,因为c<=n,所以一定会出现同余的情况,同余的两个位置之间所有的数就是答案
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int a[100009],c,sum,mod[100009];int n;int main(){ while(~scanf("%d%d",&c,&n)&&(c+n)) { sum=0; memset(mod,-1,sizeof mod); for(int i=1; i<=n; i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++) { sum=(sum+a[i])%c; if(!sum) { printf("1"); for(int j=2;j<=i;j++) printf(" %d",j); printf("\n"); break; } else if(mod[sum]!=-1) { printf("%d",mod[sum]+1); for(int j=mod[sum]+2;j<=i;j++) printf(" %d",j); printf("\n"); break; } mod[sum]=i; } } return 0;}
- HDU1808&&POJ3370-Halloween treats
- POJ3370&HDU1808 Halloween treats【鸽巢原理】
- POJ2270&&Hdu1808 Halloween treats
- poj3370——Halloween treats
- POJ3370 Halloween treats 抽屉原理
- 抽屉原理-poj3370-Halloween treats
- POJ3370 Halloween treats(数论:鸽巢原理)
- 抽屉定理poj 3370|| hdu1808 Halloween treats || hdu 1205 吃糖果 ||poj 2356
- Halloween treats
- Halloween treats
- Halloween treats
- Halloween treats
- POJ 3370 Halloween treats
- poj 3370 Halloween treats
- poj 3370 Halloween treats
- POJ 3370 Halloween Treats
- hdu-1808-Halloween treats
- poj 3370 Halloween treats
- 全面理解Android的Context
- Linux系统下安装使用中文输入法
- Python学习笔记(19)-账户管理器Version2.0
- [DP套DP] UOJ#141. 【UER #4】量子态的棋盘
- android布局控件flex-layout
- HDU1808&&POJ3370-Halloween treats
- 关于copy协议中如何简便的为对象赋值
- 洛谷P2766 最长递增子序列问题
- android事件分发机制
- 微信开发环境配置以及开发基础PHP简单说明
- MAC中MySQL启动失败的解决方法
- 2M字节Flash Rom存储器W25Q16/W25X16 认识Flash
- 接近假期,该去哪里
- python自然语言处理环境安装(centOS)