BNUOJ 34988 Happy Reversal

/*
  每个位数相等的串的十进制数与他反转后的十进制数之和是一样的
  所以最大值一定是max（Max-Min2,Max2-Min)
  另外 求十进制数有更高效的方法：
  int b[10005];
  void init()
  {
      b[0] = 1;
      for(int i = 1; i < 63; ++i)
        b[i] = 2*b[i-1];
  }
  用的时候只需每位加上a[i]*b[j]即可
*/

#include <iostream>
#include <cstdio>
#include <cstring>
#define INF 0x7fffffffffffffffl

using namespace std;

int n, k;
char bin[10005];
long long val[50005],cnt;
long long Max, Min, a1, a2;
long long change1()
{
    long long ret, r;
    ret = 0;
    r = 1;
    for (int i = k - 1; i >= 0; i--)
    {
        ret += r*(bin[i] - '0');
        r = r * 2;
    }
    return ret;
}
long long change2()
{
    long long ret = 0,r = 1;
    for (int i = k - 1; i >= 0; i--)
    {
        if (bin[i] == '0')
            ret += r;
        r = r * 2;
    }
    return ret;
}
int main()
{
//    freopen("in.txt","r",stdin);
    int t;
    scanf("%d", &t);
    for(int kase = 1; kase <= t; ++kase)
    {
        scanf("%d%d", &n, &k);
        cnt = 0;
        for (int i = 0; i < n; i++)
        {
            scanf("%s", bin);
            val[cnt++] = change1();
            val[cnt++] = change2();
        }
        Max = -INF;
        Min = INF;
        a1 = 0;
        for (int i = 0; i < cnt; i++) if (Max < val[i])
            {
                Max = val[i]; a1 = i;
            }
        if (a1%2 == 0) a2 = a1 + 1;
        else a2 = a1 - 1;
        for (int i = 0; i < cnt; i++)
            if (i != a2 && Min > val[i]) Min = val[i];
        printf("Case #%d: %lld\n", kase, Max - Min);
    }
    return 0;
}