九度教程第87题(二)
queue[rear][0]=i;
queue[rear][1]=j+k;
queue[rear][2]=0;
rear=(rear+1)%maxsize;
}
else if((k>n-j)&&(mark[i][n][k-(n-j)]==0))
{
queue[rear][0]=i;
queue[rear][1]=n;
queue[rear][2]=k-(n-j);
rear=(rear+1)%maxsize;
}
}
if(front==flag)
{
flag=rear;
num++;
}
}
if(f==-1)
printf("NO\n");
else
printf("%d\n",num);
}
scanf("%d %d %d",&s,&n,&m);;
}
}