{"content":"任务描述 \n 本关任务：给定任意６张牌给甲、乙，设计一个程序判定“纸牌游戏－钓鱼”的胜者。 \n \n 相关知识 \n 游戏规则：将一副扑克牌去掉花牌和10，只留下1~9的，即扑克牌只有0-9之间的数字，平均分成二份，每人拿一份，不妨设为甲、乙二人，甲先拿出手中的第一张扑克牌放在桌上，然后乙也拿出手中的第一张扑克牌，并放在刚打出的扑克牌的上面。出牌时，如果谁打出的牌与桌上某张牌面相同，可将二张牌及中间所夹的牌全部取走，并依次放到手中牌的末尾，然后继续出牌，直到打出的牌与桌上的牌都不相同，就这样两人交替出牌。当一人手中没牌可出时，游戏结束，对手获胜。 \n \n 先来分析游戏中的几种操作，分别是出牌和赢牌，每个人的手牌可以设置成队列结构，这恰好对应队列的两个操作，出牌就是出队，赢牌就是入队。桌子可设置成一个栈的结构，每打出一张牌放到桌上就相当于入栈。当有人赢牌的时候，依次将牌从桌上拿走，这就相当于出栈。如果某人打出的牌与桌子上的某张牌相同，即可将两张牌以及中间所夹的牌全部取走，即全部出栈，并且加入此人的队列。当一个人手中的牌先出完时，游戏结束，对方获胜。 \n \n 本实训任务使用顺序栈和循环队列，顺序栈的头文件为sqstack.h，实现文件为sqstack.cpp，顺序队列的头文件为sqqueue.h，实现文件为sqqueue.cpp。 \n \n 根据游戏的规则，定义二个队列，一个栈，二个队列交替出队，一个队列出队时，首先要在栈中查找是否有元素和此队列出队的元素相同，在顺序栈中查找是否有某张牌时，可以参考 \n 顺序表按照值查找序号操作算法 \n \n 当一个队列出队时，若出队的元素和栈中的某个元素k相同，则赢牌，出队的元素进入自己的队列，再将栈中的元素挨个出栈直到k，每出栈一个，就插入赢牌队列，赢牌队列在将栈中牌拿完以后，必须继续出牌，当栈中没有与出队元素相同的牌时，轮到另一个队列出牌。当某队列为空时，游戏结束，非空队列代表者获胜。 \n \n int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) \n { \n // 在顺序栈L中查找第1个值与e满足compare()的元素的位序。 \n // 若找到，则返回其在L中的位序，否则返回0。 \n int i; \n SElemType *p; \n i = 0; // i的初值为第1个元素的位序 \n p = L.base; // p的初值为第1个元素的存储位置 \n int length = L.top-L.base; \n while (i <length && !(*compare)(*p++, e)) \n ++i; \n if (i < length) \n return i; \n else \n return -1; \n } \n 编程要求 \n 根据提示，在右侧编辑器补充代码，要注意的是出牌时，如果谁打出的牌与桌上某张牌面相同，将二张牌及中间所夹的牌全部取走后，应该继续出牌，直到打出的牌与桌上的牌都不相同。 \n \n 测试说明 \n 平台会对你编写的代码进行测试： \n \n 测试输入： \n 2 4 1 2 5 6 \n 3 1 3 5 6 4 \n 预期输出： \n 甲：4,1,2,5,6, \n 乙：1,3,5,6,4, \n 栈：2,3, \n 甲：1,2,5,6, \n 乙：3,5,6,4, \n 栈：2,3,4,1, \n 甲：6,1,1,2,4,3,2, \n 乙：5,6,4, \n 栈：5,3, \n 甲：1,2,4,3,2, \n 乙：4,5,6,3,5, \n 栈：6,1, \n 甲：2,4,3,2,1,4,1, \n 乙：5,6,3,5, \n 栈：6, \n 甲：4,3,2,1,4,1, \n 乙：6,3,5, \n 栈：6,2,5, \n 甲：2,1,4,1,3,3, \n 乙：5,6,4,5,2,6, \n 栈： \n 甲：1,4,1,3,3, \n 乙：6,4,5,2,6, \n 栈：2,5, \n 甲：4,1,3,3, \n 乙：4,5,2,6, \n 栈：2,5,1,6, \n 甲：3,3, \n 乙：4,4,5,6,1,5,2,2, \n 栈：6,1, \n 甲：3, \n 乙：4,5,6,1,5,2,2, \n 栈：6,1,4,3, \n 甲： \n 乙：6,1,5,2,2,4,3,4, \n 栈：6,1,5,3, \n 甲： \n 乙：6,1,5,2,2,4,3,4, \n 栈：6,1,5,3, \n 乙获胜 \n \n 输入说明 \n 第一行输入甲手中的6张牌； \n 第二行输入乙手中的6张牌。 \n \n 输出说明 \n 甲先出牌，如果发现桌面上有跟刚才打出的牌的数字相同的牌，则把从相同的那张牌开始的全部牌按次序放在自己手里的牌的末尾，再继续出牌，当桌面上没有跟刚才打出的牌的数字相同的牌时，分三行输出甲手里的牌，乙手里的牌，桌上的牌；同理，轮到乙出牌后，分三行输出甲手里的牌，乙手里的牌，桌上的牌，直到有一方获胜。# include <stdio.h> \n # include <stdlib.h> \n # include <string.h> \n \n typedef int SElemType; \n typedef int QElemType; \n \n # include \"sqstack.h\" \n # include \"sqqueue.h\" \n \n void output(QElemType s); \n void input(QElemType &s); \n void outputS(SElemType s); \n void inputS(SElemType &s); \n int comp(SElemType a, SElemType b); \n int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) ; \n \n int main() \n { \n \t SqQueue q1,q2; //定义二个队列，代表甲、乙手中的牌 \n \t SqStack s; //定义一个栈，代表桌面上的牌 \n \t int i,t,x,n; \n \t InitQueue(q1); \n \t InitQueue(q2); \n \t InitStack(s); \t \n \t for(i=1;i<=6;i++) \n \t { \n \t \t scanf(\"%d\",&t); \n \t EnQueue(q1,t); \n \t } \n \t for(i=1;i<=6;i++) \n \t { \n \t \t scanf(\"%d\",&t); \n \t \t EnQueue(q2,t); \n \t } \n // 请在这里补充代码，完成本关任务 \n /********** Begin **********/ \n \t \n \t \n \t /********** End **********/ \t \n return 0; \n } \n \n int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) \n { \n // 在顺序栈L中查找第1个值与e满足compare()的元素的位序。 \n // 若找到，则返回其在L中的位序，否则返回0。 \n int i; \n SElemType *p; \n i = 0; // i的初值为第1个元素的位序 \n p = L.base; // p的初值为第1个元素的存储位置 \n int length = L.top-L.base; \n while (i <length && !(*compare)(*p++, e)) \n ++i; \n if (i < length) \n \t return i; \n else \n \t return -1; \n } // LocateElem_Sq \n \n void output(QElemType s) \n { \n \t printf(\"%d,\",s); \t \n } \n \n void input(QElemType &s) \n { \t \n \t scanf(\"%d\",&s); \t \n } \n void outputS(SElemType s) \n { \n \t printf(\"%d,\",s); \t \n } \n \n void inputS(SElemType &s) \n { \t \n \t scanf(\"%d\",&s); \t \n } \n int comp(SElemType a, SElemType b) \n { \n \t if(a>b) \n \t \t return 0; \n \t else \n \t \t if(a == b) \n \t \t \t return 1; \n \t \t else \n \t \t \t return 0; \n }","multiMedia":[],"parsedQuery":["任务描述","\n","本关任务：给定任意６张牌给甲、乙，设计一个程序判定“纸牌游戏－钓鱼”的胜者。","\n","\n","相关知识","\n","游戏规则：将一副扑克牌去掉花牌和10，只留下1~9的，即扑克牌只有0-9之间的数字，平均分成二份，每人拿一份，不妨设为甲、乙二人，甲先拿出手中的第一张扑克牌放在桌上，然后乙也拿出手中的第一张扑克牌，并放在刚打出的扑克牌的上面。出牌时，如果谁打出的牌与桌上某张牌面相同，可将二张牌及中间所夹的牌全部取走，并依次放到手中牌的末尾，然后继续出牌，直到打出的牌与桌上的牌都不相同，就这样两人交替出牌。当一人手中没牌可出时，游戏结束，对手获胜。","\n","\n","先来分析游戏中的几种操作，分别是出牌和赢牌，每个人的手牌可以设置成队列结构，这恰好对应队列的两个操作，出牌就是出队，赢牌就是入队。桌子可设置成一个栈的结构，每打出一张牌放到桌上就相当于入栈。当有人赢牌的时候，依次将牌从桌上拿走，这就相当于出栈。如果某人打出的牌与桌子上的某张牌相同，即可将两张牌以及中间所夹的牌全部取走，即全部出栈，并且加入此人的队列。当一个人手中的牌先出完时，游戏结束，对方获胜。","\n","\n","本实训任务使用顺序栈和循环队列，顺序栈的头文件为sqstack.h，实现文件为sqstack.cpp，顺序队列的头文件为sqqueue.h，实现文件为sqqueue.cpp。","\n","\n","根据游戏的规则，定义二个队列，一个栈，二个队列交替出队，一个队列出队时，首先要在栈中查找是否有元素和此队列出队的元素相同，在顺序栈中查找是否有某张牌时，可以参考","\n","顺序表按照值查找序号操作算法","\n","\n","当一个队列出队时，若出队的元素和栈中的某个元素k相同，则赢牌，出队的元素进入自己的队列，再将栈中的元素挨个出栈直到k，每出栈一个，就插入赢牌队列，赢牌队列在将栈中牌拿完以后，必须继续出牌，当栈中没有与出队元素相同的牌时，轮到另一个队列出牌。当某队列为空时，游戏结束，非空队列代表者获胜。","\n","\n","int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) ","\n","{ ","\n"," // 在顺序栈L中查找第1个值与e满足compare()的元素的位序。","\n"," // 若找到，则返回其在L中的位序，否则返回0。","\n"," int i;","\n"," SElemType *p;","\n"," i = 0; // i的初值为第1个元素的位序","\n"," p = L.base; // p的初值为第1个元素的存储位置","\n"," int length = L.top-L.base;","\n"," while (i <length && !(*compare)(*p++, e)) ","\n"," ++i;","\n"," if (i < length) ","\n"," return i;","\n"," else ","\n"," return -1;","\n","}","\n","编程要求","\n","根据提示，在右侧编辑器补充代码，要注意的是出牌时，如果谁打出的牌与桌上某张牌面相同，将二张牌及中间所夹的牌全部取走后，应该继续出牌，直到打出的牌与桌上的牌都不相同。","\n","\n","测试说明","\n","平台会对你编写的代码进行测试：","\n","\n","测试输入：","\n","2 4 1 2 5 6","\n","3 1 3 5 6 4","\n","预期输出：","\n","甲：4,1,2,5,6,","\n","乙：1,3,5,6,4,","\n","栈：2,3,","\n","甲：1,2,5,6,","\n","乙：3,5,6,4,","\n","栈：2,3,4,1,","\n","甲：6,1,1,2,4,3,2,","\n","乙：5,6,4,","\n","栈：5,3,","\n","甲：1,2,4,3,2,","\n","乙：4,5,6,3,5,","\n","栈：6,1,","\n","甲：2,4,3,2,1,4,1,","\n","乙：5,6,3,5,","\n","栈：6,","\n","甲：4,3,2,1,4,1,","\n","乙：6,3,5,","\n","栈：6,2,5,","\n","甲：2,1,4,1,3,3,","\n","乙：5,6,4,5,2,6,","\n","栈：","\n","甲：1,4,1,3,3,","\n","乙：6,4,5,2,6,","\n","栈：2,5,","\n","甲：4,1,3,3,","\n","乙：4,5,2,6,","\n","栈：2,5,1,6,","\n","甲：3,3,","\n","乙：4,4,5,6,1,5,2,2,","\n","栈：6,1,","\n","甲：3,","\n","乙：4,5,6,1,5,2,2,","\n","栈：6,1,4,3,","\n","甲：","\n","乙：6,1,5,2,2,4,3,4,","\n","栈：6,1,5,3,","\n","甲：","\n","乙：6,1,5,2,2,4,3,4,","\n","栈：6,1,5,3,","\n","乙获胜","\n","\n","输入说明","\n","第一行输入甲手中的6张牌；","\n","第二行输入乙手中的6张牌。","\n","\n","输出说明","\n","甲先出牌，如果发现桌面上有跟刚才打出的牌的数字相同的牌，则把从相同的那张牌开始的全部牌按次序放在自己手里的牌的末尾，再继续出牌，当桌面上没有跟刚才打出的牌的数字相同的牌时，分三行输出甲手里的牌，乙手里的牌，桌上的牌；同理，轮到乙出牌后，分三行输出甲手里的牌，乙手里的牌，桌上的牌，直到有一方获胜。# include <stdio.h>","\n","# include <stdlib.h>","\n","# include <string.h>","\n","\n","typedef int SElemType;","\n","typedef int QElemType;","\n","\n","# include \"sqstack.h\"","\n","# include \"sqqueue.h\"","\n","\n","void output(QElemType s);","\n","void input(QElemType &s);","\n","void outputS(SElemType s);","\n","void inputS(SElemType &s);","\n","int comp(SElemType a, SElemType b);","\n","int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) ;","\n","\n","int main()","\n","{","\n","\t","SqQueue q1,q2; //定义二个队列，代表甲、乙手中的牌","\n","\t","SqStack s; //定义一个栈，代表桌面上的牌","\n","\t","int i,t,x,n;","\n","\t","InitQueue(q1);","\n","\t","InitQueue(q2);","\n","\t","InitStack(s);","\t","\n","\t","for(i=1;i<=6;i++)","\n","\t","{","\n","\t","\t","scanf(\"%d\",&t);","\n"," ","\t","EnQueue(q1,t);","\n","\t","}","\n","\t","for(i=1;i<=6;i++)","\n","\t","{","\n","\t","\t","scanf(\"%d\",&t);","\n","\t","\t","EnQueue(q2,t);","\n","\t","}","\n"," // 请在这里补充代码，完成本关任务","\n"," /********** Begin **********/ ","\n","\t","\n","\t","\n","\t","/********** End **********/","\t","\n"," return 0;","\n","}","\n","\n","int LocateElem_Sq(SqStack L, SElemType e, int (*compare)(SElemType, SElemType)) ","\n","{ ","\n"," // 在顺序栈L中查找第1个值与e满足compare()的元素的位序。","\n"," // 若找到，则返回其在L中的位序，否则返回0。","\n"," int i;","\n"," SElemType *p;","\n"," i = 0; // i的初值为第1个元素的位序","\n"," p = L.base; // p的初值为第1个元素的存储位置","\n"," int length = L.top-L.base;","\n"," while (i <length && !(*compare)(*p++, e)) ","\n"," ++i;","\n"," if (i < length) ","\n","\t"," return i;","\n"," else ","\n","\t"," return -1;","\n","} // LocateElem_Sq","\n","\n","void output(QElemType s)","\n","{","\n","\t","printf(\"%d,\",s);","\t"," ","\n","}","\n","\n","void input(QElemType &s)","\n","{ ","\t","\n","\t","scanf(\"%d\",&s);","\t","\n","}","\n","void outputS(SElemType s)","\n","{","\n","\t","printf(\"%d,\",s);","\t"," ","\n","}","\n","\n","void inputS(SElemType &s)","\n","{ ","\t","\n","\t","scanf(\"%d\",&s);","\t","\n","}","\n","int comp(SElemType a, SElemType b)","\n","{","\n","\t","if(a>b)","\n","\t","\t","return 0;","\n","\t","else","\n","\t","\t","if(a == b)","\n","\t","\t","\t","return 1;","\n","\t","\t","else","\n","\t","\t","\t","return 0;","\n","}"]}