离散数学作业：分油问题

两个小孩去打油，一人带了一个一斤的空瓶，另一个带了一个七两、一个三两的空瓶。原计划各打一斤油，可是由于所带的钱不够，只好两人合打了一斤油，在回家的路上，二人想平分这一斤油，可是又没有其它工具。试仅用三个瓶子(一斤、七两、三两)精确地分出两个半斤油来。   #include <iostream> #include <iomanip> using namespace std; const int maxsize=1000; //确定队列的长度 struct node{ //定义结点结构 三个瓶子装油的状态和这个结点的父结点 int container1; int container2; int container3; int father;}; struct queue {struct node g[maxsize]; // 定义队列 int front; //前指针 int rear;}; //后指针 struct queue q1,q2; // 定义了两个队列 void inital_queue(struct queue *y) // 对队列初始化 { y->front=1; // 把两个指针初始化为1 y->rear=1;} void en_queue(struct queue *y, struct node *n) // 出队列 { y->g[y->rear].container1=n->container1; y->g[y->rear].container2=n->container2; y->g[y->rear].container3=n->container3; y->g[y->rear].father=n->father; y->rear=(y->rear+1)%maxsize; } void dequeue(struct queue *y,struct node *n) // 入队列 { n->container1=y->g[y->front].container1; n->container2=y->g[y->front].container2; n->container3=y->g[y->front].container3; n->father=y->g[y->front].father; y->front=(y->front+1)%maxsize; } int isresult(struct node *n) // 判断 是否和满足最终的要求即(5,5,0) { if(n->container1==5&&n->container2==5) {return 1;} else return 0; } int judge(struct queue *y,struct node *n) // 用来判断当前计算出来的状态是不是新状态，以减少往队列里放的数据 { for (int i=y->front; i<=y->rear; i++) {if (n->container1==y->g[i].container1&&n->container2==y->g[i].container2&&n->container3==y->g[i].container3) return i;} return 0;} void rule(struct queue *y,struct queue *y1,struct node *n) // 广度优先搜索 { struct node node12; if ( n->container2>0) {node12.container1=n->container2+n->container1; node12.container2=0; node12.container3=n->container3; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3>0) {node12.container1=n->container3+n->container1; node12.container2=n->container2; node12.container3=0; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container1+n->container2>=7) {node12.container1=n->container2+n->container1-7; node12.container2=7; node12.container3=n->container3; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3+n->container2>=7) {node12.container1=n->container1; node12.container2=7; node12.container3=n->container3+n->container2-7; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3+n->container2<7) {node12.container1=n->container1; node12.container2=n->container3+n->container2; node12.container3=0; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3+n->container1>=3) {node12.container1=n->container1+n->container3-3; node12.container2=n->container2; node12.container3=3; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3+n->container2>=3) {node12.container1=n->container1; node12.container2=n->container2+n->container3-3; node12.container3=3; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } } if ( n->container3+n->container2<3) {node12.container1=n->container1; node12.container2=0; node12.container3=n->container2+n->container3; node12.father=judge(y1,n); if(!judge(y1,&node12)) { en_queue(y,&node12); en_queue(y1,&node12); } }} void display(struct queue *q,int i) // 显示队列里数据,从初始结点开始显示直到正确的状态 { if(q->g[i].father!=-1) {display(q,q->g[i].father);} cout<<"("<<q->g[i].container1<<","<<q->g[i].container2<<","<<q->g[i].container3<<")"<<endl; cout<<q->g[i].father<<endl; } void bfs(struct queue *y,struct queue *y1,struct node *n) // 总的广度搜索的过程 { struct node nd12; inital_queue(y); inital_queue(y1); en_queue(y,n); en_queue(y1,n); while (1) { dequeue(y,&nd12); if (!isresult(&nd12)) {rule(y,y1,&nd12);} else { display(y1,y->front-1); return; } } } void main() // 主函数 { struct node root; root.container1 = 10; root.container2 = 0; root.container3 = 0; root.father = -1; bfs(&q1,&q2,&root); } 

 

这都是上学期的作业了，放网上留个纪念吧……一共八次实验还有几个忘题目了，代码倒还在，嘻嘻