POJ-3278 广度优先搜索入门

#include<stdio.h>
#include<stdlib.h>
struct node{
    int x;
    int s;
}s[];
int main(){
    int n,m,book[]={};
        scanf("%d %d",&n,&m);
        if(n==m)
            printf("0\n");
        else{
            int tail=,head=;
                s[tail].x=n;
                s[tail++].s=;
                book[n]=;
            int next[]={,-,};
            int flag=;
            while(head<tail){
                for(int i=;i<;i++){
                    int dx;
                    if(i!=)
                        dx=s[head].x+next[i];
                    else
                        dx=s[head].x*next[i];
                    if(dx<||dx>)
                        continue;
                        if(book[dx]==){
                            book[dx]=;
                            s[tail].x=dx;
                            s[tail++].s=s[head].s+;
                        }
                        if(dx==m){
                            flag=;
                            break;
                        }
                }
                    head++;
                    if(flag)
                    break;
            }
            printf("%d\n",s[tail-].s);
        }
return ;
}