poj 2356 鹊巢原理

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int d[10010];int mod[10010];int main(){int n;scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&d[i]);int res=0; memset(mod,0,sizeof(mod));for(int i=1;i<=n;i++){res=(res+d[i])%n;if(res==0){printf("%d\n",i);for(int j=1;j<=i;j++)printf("%d\n",d[j]);break;} if(!mod[res])mod[res]=i;else{printf("%d\n",i-mod[res]);for(int j=mod[res]+1;j<=i;j++)printf("%d\n",d[j]);break;}}return 0;}