开关转换问题

poj  2965  The Pilots Brothers' refrigerator

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>

//#define LL __int64
#define LL long long
#define pi acos(-1.0)
#define PB push_back()
#define MP make_pair()
#define BG begin()
#define ED end()
#define clr(a,b)  memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define Mod  1e9+7
using namespace std;
int A[5][5];

int main()
{
     #ifndef ONLINE_JUDGE
      freopen("in.cpp","r",stdin);
     #endif // ONLINE_JUDGE
      char s;
      clr(A,0);
       for(int i=0;i<4;i++)
         for(int j=0;j<4;j++){
            cin>>s; 
           if(s=='+')
           {
               for(int k=0;k<4;k++){
                  A[i][k]++;
                  A[k][j]++;
               }
               A[i][j]--;
           }
       }
       int sum=0;
       for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
           sum+=A[i][j]%2;
       cout<<sum<<endl;
       for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
         if(A[i][j]%2)  cout<<i+1<<" "<<j+1<<endl;
    return 0;
}

枚举1<<16-1种状态

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>
#define LL __int64
#define LL long long
#define LLB long long double
#define pi acos(-1.0)
#define PB push_back()
#define MP make_pair()
#define BG begin()
#define ED end()
#define clr(a,b)  memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define Mod  1e9+7
#define exp 1e-8
using namespace std;
#define maxn 100060

char A[5][5];
int pp[50][2];
void Print(int tot)
{
    printf("%d\n",tot);
    for(int i=0;i<tot;i++){
        printf("%d %d\n",pp[i][0],pp[i][1]);
    }
}
int main()
{
     #ifndef ONLINE_JUDGE
    //freopen("in.cpp","r",stdin);
    #endif // ONLINE_JUDGE
	 for(int i=0;i<4;i++)
        scanf("%s",&A[i]);
     int init_status=0;
     int end_status=(1<<16)-1;
	  for(int i=0;i<4;i++)
      for(int j=0;j<4;j++){
         int t=i*4+j;
         if(A[i][j]=='-') init_status+=(1<<t);
      }
     int Max_status=(1<<16)-1;

	 for(int i=0;i<=Max_status;i++){
        int cur_status=init_status;
        int tot=0;
        for(int p=0;p<16;p++){
             int t=i&(1<<p);
            if(t==(1<<p)){
                 pp[tot][0]=p/4+1;
                 pp[tot++][1]=p%4+1;
                 cur_status^=1<<p;
                 int x=(p/4)*4;
                 int y=p%4;
                 for(int k=0;k<4;k++){
                    cur_status^=1<<x;
                    cur_status^=1<<y;
                    x+=1;
                    y+=4;
                 }
            }
        }
        if(cur_status == end_status) {
                Print(tot);
                break;
            }
	 }

	return 0;
}