Find a multiple（组合数学：鸽巢原理的简单应用）

Link：http://poj.org/problem?id=2356

Find a multiple Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7062   Accepted: 3092   Special Judge Description The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it may happen that two or more of them will be equal). Your task is to choose a few of given numbers ( 1 <= few <= N ) so that the sum of chosen numbers is multiple for N (i.e. N * k = (sum of chosen numbers) for some natural number k). Input The first line of the input contains the single number N. Each of next N lines contains one number from the given set. Output In case your program decides that the target set of numbers can not be found it should print to the output the single number 0. Otherwise it should print the number of the chosen numbers in the first line followed by the chosen numbers themselves (on a separate line each) in arbitrary order.  If there are more than one set of numbers with required properties you should print to the output only one (preferably your favorite) of them. Sample Input 5 1 2 3 4 1 Sample Output 2 2 3 Source Ural Collegiate Programming Contest 1999

题意：给出n个数，任选几个数，使其和为n的倍数。

编程思想：鸽巢原理的简单应用。设前k项和Sk表示a1+a2+……ak,如果Sk是n的倍数，那就直接取Sk了，否则S1-Sn除n的余数分布在1---（n-1）这n-1个数中，运用鸽巢原理，必然有两个的余数相同，即(Si%n)=(Sj%n),即(Sj-Si)%n=0，证毕。所以落在区间i+1至j的所有数的和就是n的倍数。

AC code：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<string.h>
#define LL long long
using namespace std;
const int INF=0x3f3f3f3f;
int sum[10010],a[10010],mod[10010];
int main()
{
    //freopen("D:\\in.txt","r",stdin);
    int T,i,j,k,n;
    bool fg;
    while(scanf("%d",&n)!=EOF)
    {
        fg=false;
        sum[0]=0;
        memset(mod,0,sizeof(mod));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];
            if(fg==true)
                continue;
            if(sum[i]%n==0)
            {
                printf("%d\n",i);
                for(j=1;j<=i;j++)
                {
                    printf("%d\n",a[j]);
                }
                fg=true;
            }
            else
            {
                if(mod[sum[i]%n]!=0)
                {
                    printf("%d\n",i-mod[sum[i]%n]);
                    for(j=mod[sum[i]%n]+1;j<=i;j++)
                    {
                        printf("%d\n",a[j]);
                    }
                    fg=true;
                }
                else
                {
                    mod[sum[i]%n]=i;
                }
            }
        }
    }
    return 0;
}