A=1,3,4,5,8,10,12,13,14,16,17,20,21,25,26,28 B=1,3,4,7,11,12,15,16,19,20,22,24,28,31,32 C=2,7,10,13,15,16,19,20,22,25,26,28,29,31,33 D=1,2,3,5,8,10,14,15,17,25,26,29,33 E=3,5,8,11,12,15,19,21,24,26,30,31,33 F=3,6,8,10,12,14,15,17,20,21,29,31 G=3,4,7,12,14,16,19,21,25,28,29,31 H=4,6,10,11,12,18,19,20,22,25,26,31

根据给定的数组 A、B、C、D、E、F、G、H，您想要找到所有不重复的6位数顺序组合。您可以使用上面提供的伪代码进行编程实现，以下是根据您提供的数据示例的实际代码（Python）：

from itertools import combinations

# 定义数组
A = [1,3,4,5,8,10,12,13,14,16,17,20,21,25,26,28]
B = [1,3,4,7,11,12,15,16,19,20,22,24,28,31,32]
C = [2,7,10,13,15,16,19,20,22,25,26,28,29,31,33]
D = [1,2,3,5,8,10,14,15,17,25,26,29,33]
E = [3,5,8,11,12,15,19,21,24,26,30,31,33]
F = [3,6,8,10,12,14,15,17,20,21,29,31]
G = [3,4,7,12,14,16,19,21,25,28,29,31]
H = [4,6,10,11,12,18,19,20,22,25,26,31]

# 合并所有数组
arrays = [A,B,C,D,E,F,G,H]

# 生成所有可能的6位数顺序组合
combinations_list = list(combinations([num for array in arrays for num in array], 6))

# 去除重复的组合
unique_combinations = list(set(combinations_list))

# 将组合转化为字符串
unique_combinations = ["".join(map(str, combination)) for combination in unique_combinations]

print(unique_combinations)

这段代码将打印出所有不重复的6位数顺序组合。请注意，代码中使用了 `itertools` 模块的 `combinations` 函数来生成所有可能的组合。希望这可以满足您的需求！如果您有任何其他问题，请随时提问。