【POJ 2965】 The Pilots Brothers' refrigerator

【题目链接】

http://poj.org/problem?id=2965

【算法】

位运算

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
const int MASK = ;

int i,j,tmp,s,mn,p,sum;
int a[];
char c;

inline int calc(int x,int y)
{
        int pos =  * x + y - ;
        int ret = ;
        int tmp = pos;
        while (tmp <  * x)
        {
                ret |= ( << tmp);
                tmp++;
        }
        tmp = pos;
        while (tmp >=  * x - )
        {
                ret |= ( << tmp);
                tmp--;
        }
        tmp = pos;
        while (tmp < )
        {
                ret |= ( << tmp);
                tmp += ;
        }
        tmp = pos;
        while (tmp >= y - )
        {
                ret |= ( << tmp);
                tmp -= ;
        }
        return ret;
}

int main()
{

        for (i = ; i <= ; i++)
        {
                for (j = ; j <= ; j++)
                {
                        a[*i+j-] = calc(i,j);
                }
        }
        for (i = ; i < ; i++)
        {
                scanf("%c",&c);
              if (c == '-')    s |= ( << i);
                if (i %  == ) scanf("%c",&c);
        }
        mn = MASK;
        for (i = ; i <= MASK; i++)
        {
                tmp = s; sum = ;
                for (j = ; j < ; j++)
                {
                        if (i & ( << j))
                        {
                                sum++;
                                tmp ^= a[j];
                        }
                }
                if (tmp == MASK && sum < mn)
                {
                        mn = sum;
                        p = i;
                }
        }
        printf("%d\n",mn);
        for (i = ; i < ; i++)
        {
                if (p & ( << i))
                        printf("%d %d\n",i/+,i%+);
        }

        return ;

}