Zoj the little girl who picks mushrooms

The little girl who picks mushrooms

Time Limit: 2 seconds
Memory limit: 32768 KB

It's yet another festival season in gensokyo. little girl Alice planned to pick mushrooms in five mountains. she brought five bags with her and used different bags to collect mushrooms from different mountains. each bag has a capacity of 2012 grams. alice
Has finished picking mushrooms in 0 ≤N≤ 5 mountains. In
I-Th Mountain, she picked 0 ≤WiLess than or equal to 2012 grams of mushrooms. Now she is moving forward to the remained mountains. After finishing picking mushrooms in all the five mountains, she want to bring as much mushrooms as possible home
Cook a delicious soup.

Alice lives in the forest of magic. at the entry of the forest of magic, lives three mischievous fairies, sunny, lunar and star. on Alice's way back home, to enter the forest, she must give them exactly three bags of mushrooms whose total weight must be
Of integral kilograms. If she cannot do so, she must leave all the five bags and enter the forest with no mushrooms.

Somewhere in the forest of magic near Alice's house, lives a magician, Marisa. Marisa will steal 1 kilogram of mushrooms repeatedly from Alice until she has no more than 1 kilogram mushrooms in total.

So when Alice get home, what's the maximum possible amount of mushrooms Alice has? Remember that our common sense doesn't always hold in gensow.people in gensow.belive that 1 kilograms is equal to 1024 grams.

Input

There are about 8192 test cases. process to the end of file.

The first line of each test case contains an integer 0 ≤N≤ 5, the number of mountains where Alice has picked mushrooms. The second line contains
NIntegers 0 ≤Wi≤ 2012, the amount of mushrooms picked in each mountain.

Output

For each test case, output the maximum possible amount of mushrooms Alice can bring home, modulo 20121014 (this is
NotA prime ).

Sample Input

194512 512 512 5125100 200 300 400 5005208 308 508 708 1108

Sample output

102410240792

Note

In the second sample, if Alice doesn't pick any mushrooms from the 5-th Mountain. she can give (512 + 512 + 0) = 1024 grams of mushrooms to sunny, lunar and star. marisa won't steal any mushrooms from her as she has exactly 1 kilograms of mushrooms in total.

In the third sample, there are no three bags whose total weight is of integral kilograms. So Alice must leave all the five bags and enter the forest with no mushrooms.

In the last sample:

• Giving sunny, lunar and Star: (208 + 308 + 508) = 1024
• Stolen by Marisa: (708 + 1108)-1024) = 792

The first question is that the question is obviously not a question, but the question is always unclear. First of all, the question does not explain the first data. We are confused about it, for the first piece of data, we can still find something. The question is, it is collected on several mountains, and there is no limit on other mountains, that is, this, this is critical. If you have understood this point, you will understand everything!

#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[5];bool cmp(int a,int b){    return a<b;}int main(){    int n,i,j,k,sum;    while(scanf("%d",&n)!=EOF)    {      for(i=0;i<n;i++)      {          scanf("%d",&a[i]);      }      if(n<=3)      {          printf("1024\n");          continue;      }      if(n==4)      {          if((a[0]+a[1]+a[2])%1024==0)          {              printf("1024\n");              continue;          }           if((a[0]+a[1]+a[3])%1024==0)          {              printf("1024\n");              continue;          }           if((a[0]+a[3]+a[2])%1024==0)          {              printf("1024\n");              continue;          }           if((a[1]+a[3]+a[2])%1024==0)          {              printf("1024\n");              continue;          }          int maxx=-1;          for(i=0;i<3;i++)          {              for(j=i+1;j<4;j++)              {                  int  temp=(a[i]+a[j]);                  while(temp>1024)                  {                      temp-=1024;                  }                  if(temp>maxx)                  {                      maxx=temp;                  }              }          }          printf("%d\n",maxx);          continue;      }      else if(n==5){        for(i=0,sum=0;i<5;i++)        sum+=a[i];        bool flag=true;        int maxx=-1;        int tempsum=sum;        for(i=0;i<=2;i++)        for(j=i+1;j<4;j++)        for(k=j+1;k<5;k++)        {            if((a[i]+a[j]+a[k])%1024==0)            {                sum=tempsum;                sum-=a[i]+a[j]+a[k];                while(sum>1024)            sum-=1024;            if(sum>maxx)            maxx=sum;            }        }       if(maxx!=-1)       {            printf("%d\n",maxx);       }        else            printf("0\n");      }    }    return 0;}