1032.cpp

我的URAL的1000 ~ 1050 的全部代码 包含WA 最后AC的程序 有2~3个比较难的是MAIGO的程序

// modular is GOOD
#include <iostream>
using namespace std;

const int maxN = 10000;
int a[maxN + 1];
int n;
int sum[maxN + 1];
int pos[maxN + 1];
void output(int beg, int end)
{
     int i;
     cout << end - beg + 1 << endl;
     for(i = beg; i <= end; i++ )
           cout << a[i] << endl;
}
int main()
{
//    freopen("1032.in", "r", stdin);
//    freopen("1032.out","w", stdout);
    int i;
    memset( pos , 0 , sizeof(pos) );
    cin >> n;
    sum[0] = 0;
    for( i = 1; i <= n; i++ )
    {
         cin >> a[i];
         sum[i] = a[i] + sum[i-1];
    }

    for( i = 1; i <= n; i++ )
    {
         sum[i] %= n;
         if( sum[i] == 0 ) { output(1, i);break; }
         if( pos[ sum[i] ] != 0 ) { output( pos[ sum[i] ] + 1, i ); break; }
         else pos[ sum[i] ] = i;
    }
    return 0;
}