zoukankan      html  css  js  c++  java
  • HDU 1808 Halloween treats

    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. 

    InputThe 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 a 1 , ... , a n (1 ≤ a i ≤ 100000 ), where a i represents the number of sweets the children get if they visit neighbour i. 

    The last test case is followed by two zeros. 

    OutputFor 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 a i 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 5
    1 2 3 7 5
    3 6
    7 11 2 5 13 17
    0 0

    Sample Output

    3 5
    2 3 4
    题解: 鸽巢原理
    参考代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 using namespace std;
     4 const int maxn=1e5+10;
     5 int c,n,a[maxn],temp[maxn];
     6 int main()
     7 {
     8     while(~scanf("%d%d",&c,&n),c+n)
     9     {
    10         for(int i=1;i<=n;i++) scanf("%d",a+i),temp[i]=0;
    11         int sum=0;
    12         for(int i=1;i<=n;i++) 
    13         {
    14             sum=(sum+a[i])%c;
    15             if(sum==0)
    16             {
    17                 for(int j=1;j<i;j++) printf("%d ",j);
    18                 printf("%d
    ",i);
    19                 break;
    20             }
    21             else if(temp[sum])
    22             {
    23                 for(int j=temp[sum]+1;j<i;j++) printf("%d ",j);
    24                 printf("%d
    ",i);
    25                 break;
    26             }
    27             else temp[sum]=i;
    28         }
    29     }
    30     return 0;
    31 } 
    View Code
  • 相关阅读:
    Python Scarpy安装包
    pip install 出现报asciii码错误的问题
    pyhton 27 pip命令无法使用 没有Scripts文件夹 的解决方法
    北漂
    15再见,16你好。
    selenium By.xpath 用法
    java.util.NoSuchElementException解决办法
    Android版之数据库增删改查图书信息
    Android studio连接sqlserver数据库
    Android简易版图书管理系统
  • 原文地址:https://www.cnblogs.com/csushl/p/9498437.html
Copyright © 2011-2022 走看看