Poj-2356 Find a multiple

版权声明：最后一年，加油~ https://blog.csdn.net/zzti_xiaowei/article/details/88086756

题解： 鸽笼原理经典题目，mark一下~

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int Max_n=1e5+10;

int n;
int a[Max_n],sum[Max_n];
int e[Max_n];

void print(int l,int r){
    printf("%d\n",r-l+1);
    for(int i=l;i<=r;i++)printf("%d\n",a[i]);
}

int main()
{
    cin>>n;
    sum[0]=0;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        sum[i]=sum[i-1]+a[i];
        int mod=sum[i]%n;
        if(mod==0){
            print(1,i);
            break;
        }
        else if(e[mod]!=0){
            print(e[mod]+1,i);
            break;
        }
        else e[mod]=i;
    }

    return 0;
}