GCJ 2009 Problem A. Crazy Rows【位运算要加LL】

教训：自己预处理位运算的一些东西，1之类的要加上 LL，否则会出问题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>
#include <vector>
using namespace std;

#define LL long long
const LL maxn = 100;
LL n;
LL er[1000];
LL num[maxn];

void init()
{
	scanf("%lld", &n);
	for (int i = 0; i != n; ++ i)	er[i] = (1LL << (n - i - 1LL)) - 1LL;
	getchar();//读回车
	for (int i = 0; i != n; ++ i)
	{
		num[i] = 0;
		for (int j = 0; j != n; ++ j)
		{
			char tmp;
			tmp = getchar();
			num[i] = (num[i]<<1LL) + (LL)(tmp-'0');
		}
		getchar();//读回车
	}
}



void doit()
{
	LL ans = 0;
	for (int i = 0; i != n; ++ i)
	{
		for (int j = i; j != n; ++ j)
		{
			if ((num[j] & er[i]) == 0)
			{
				for (int k = j - 1; k >= i; -- k)
				{
					++ans;
					swap(num[k],num[k+1]);
				}
				break;
			}
		}
	}
	printf("%lld\n",ans);
}

int main()
{
	freopen("a.in","r",stdin);
	freopen("a.txt","w",stdout);
	LL sb;
	scanf("%lld", &sb);
	for (int i = 1; i <= sb; ++ i)
	{
		printf("Case #%d: ", i);
		init();
		doit();
	}
	return 0;
}