poj1753FlipGame

#include<stdio.h>
#include<conio.h>
#include<math.h>


#define MAX   65536


typedef struct queue
{
int head;
int tail;
int data[MAX];
}queue;


char flag[MAX+1] = {0};


void setNumber(int *number,int i,int j);
int searchShort(int number);
void initQueue(queue *q);
void inQueue(queue *q,int v);
int  outQueue(queue *q);
int  isQueueFull(queue *q);
int  isQueueEmpty(queue *q);
void show(int number);


void show(int number)
{
int i;


printf("\n");
for(i=0; i<16; i++)
{
printf("%d",number & (1<<i) ? 1 : 0);
if((i+1)%4==0)
printf("\n");
}
}


int  isQueueEmpty(queue *q)
{
return (q->tail) > q->head;
}


int  isQueueFull(queue *q)
{
return (q->head+1)%MAX == q->tail;
}


int  outQueue(queue *q)
{
int v;
v = q->data[q->tail++];
q->tail = q->tail % MAX;
return v;
}
void inQueue(queue *q,int v)
{
q->data[++q->head] = v;
q->head = q->head % MAX;
}


void initQueue(queue *q)
{
q->head = -1;
q->tail = 0;
}


int searchShort(int number)
{
int i,j,k=1,n=0;
int cnt;
double sum=17;
queue q;
int tNumber;
int temp;


initQueue(&q);
inQueue(&q,number);
flag[number] = 1;
show(number);


while(! isQueueEmpty(&q))
{
temp = outQueue(&q);


if(temp==0 || temp==MAX-1)
{
printf("k=%d\n",k);
for(i=1; k>sum; i++)
sum+=pow(16,i+1);
printf("%d",i);
return 0;
}
else if(temp == -1)
continue;


for(i=0; i<4; i++)
for(j=0; j<4; j++)
{
tNumber = temp;
setNumber(&tNumber,i-1,j);
setNumber(&tNumber,i,j-1);
setNumber(&tNumber,i,j);
setNumber(&tNumber,i,j+1);
setNumber(&tNumber,i+1,j);
//找到了

if(flag[tNumber] == 0)
{
flag[tNumber] = 1;
inQueue(&q,tNumber);
}
else 
inQueue(&q,-1);
}
}
printf("Impossible");
return 0;
}


void setNumber(int *number,int i,int j)
{
int t = 1 << (4*i+j);


if(i<4 && i>=0 && j<4 && j>=0)
{
if( (*number) & t )
(*number) = (*number) & (~t);
else
(*number) = (*number) | t;
}
}


int main(void)
{
int i,j;
char c;
int number=0;


for(i=0; i<16; i++)
{
scanf("%c",&c);
c=='b'? (number |= (1<<i)) : 1;
}
if(number == 0 || number == MAX-1)
printf("0");
else
searchShort(number);
}