帮助我，输出必须像这样 [英] help me the out put must like this

问题描述

第1种族:WIN 02 * 01
第2场比赛:FRP 12-01
第3场比赛:SHP 07

组合应根据输入内容
1. R1 WIN 02 – R2 FRP 12-01 – R3 SHP 07
2. R1 WIN 01 – R2 FRP 12-01 – R3 SHP 07
3. R1 WIN 02 – R2 FRP 12-01
4. R1 WIN 01 – R2 FRP 12-01
5. R1 WIN 02 – R3 SHP 07
6. R1 WIN 01 – R3 SHP 07
7. R2 FRP 12-01 – R3 SHP 07

Race no 1: WIN 02*01
Race no 2: FRP 12-01
Race no 3: SHP 07

the combination should like this according to the input
1. R1 WIN 02 – R2 FRP 12-01 – R3 SHP 07
2. R1 WIN 01 – R2 FRP 12-01 – R3 SHP 07
3. R1 WIN 02 – R2 FRP 12-01
4. R1 WIN 01 – R2 FRP 12-01
5. R1 WIN 02 – R3 SHP 07
6. R1 WIN 01 – R3 SHP 07
7. R2 FRP 12-01 – R3 SHP 07

推荐答案

好，你必须

• 首先生成所有比赛编号1的标签，即"R1 WIN 01"，"R1 WIN 02".您需要编写一个非常简单的解析器.

Well you have to

• First generate all the race no 1 labels, namely "R1 WIN 01", "R1 WIN 02". You need to write a very simple parser.

1. {"R1 WIN 01", "R2 FRP 12-01", "R3 SHP 07"}
2. {"R1 WIN 02", "R2 FRP 12-01", "R3 SHP 07"}

并生成所有重复的组合(不重复)(包含1个以上元素).您可以为此类任务编写递归函数.
最后订购结果列表.

祝你好运！

and generate all their combinations without repetitions (with more than 1 element). You may write a recursive function for such a task.
Finally order the list of results.

Good luck!

这篇关于帮助我，输出必须像这样的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！