[已解决]征集答案，我只写出一半，还是硬编码

wp231957 · 发表于 2020-2-16 17:28:20

马上注册，结交更多好友，享用更多功能^_^

您需要登录才可以下载或查看，没有账号？立即注册

x

本帖最后由 wp231957 于 2020-2-16 17:32 编辑

要求，生成一系列的二维数组（我推算是8192组），
①维数4*4
②基础填充数据1，3，5，7
③主对角线，也就是索引（0 0）（1 1）（2 2）（3 3）均为1
④其余对称点乘积为1（互为倒数）也就是说索引之和相等的，比如1 0 与0 1 3 2 与2 3等

最佳答案

月排行榜 / 总排行榜

xdhuch

2020-2-16 21:40:05

用代码实现了下，分析在9楼，你检查一下吧

import itertools
def Traversal_4_4():
ns = (1,3,5,7,1/3,1/5,1/7)
res = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
poss = ((1,0),(2,0),(2,1),(3,0),(3,1),(3,2))
num = 0;
for arr in itertools.product(ns, repeat=6):
for i in range(6):
res[poss[i][0]][poss[i][1]] = round(arr[i], 4)
res[poss[i][1]][poss[i][0]] = round(1/arr[i], 4)
print(res)
num = num+1
print(num)
if __name__ == '__main__' :
Traversal_4_4()

复制代码

跳转到最佳答案楼层

阴阳神万物主 · 发表于 2020-2-16 18:32:21

本帖最后由阴阳神万物主于 2020-2-16 18:35 编辑

提问：对称点的对称方式是中心对称还是轴对称？
索引之和相等的话，有1+3=4=2+2，这算对称？
还有还有，3、5、7的填充规则是？

wp231957 · 发表于 2020-2-16 18:51:48

阴阳神万物主发表于 2020-2-16 18:32
提问：对称点的对称方式是中心对称还是轴对称？
索引之和相等的话，有1+3=4=2+2，这算对称？
还有还有，3 ...

1、我给你部分数据：

[1, 7, 7, 7], ['0.1429', 1, 5, 5], ['0.1429', '0.2000', 1, 1], ['0.1429', '0.2000', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 5], ['0.1429', '0.2000', 1, 3], ['0.1429', '0.2000', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 5], ['0.1429', '0.2000', 1, 5], ['0.1429', '0.2000', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 5], ['0.1429', '0.2000', 1, 7], ['0.1429', '0.2000', '0.1429', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 7], ['0.1429', '0.2000', 1, 1], ['0.1429', '0.1429', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 7], ['0.1429', '0.2000', 1, 3], ['0.1429', '0.1429', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 7], ['0.1429', '0.2000', 1, 5], ['0.1429', '0.1429', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 5, 7], ['0.1429', '0.2000', 1, 7], ['0.1429', '0.1429', '0.1429', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 1], ['0.1429', '0.1429', 1, 1], ['0.1429', '1.0000', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 1], ['0.1429', '0.1429', 1, 3], ['0.1429', '1.0000', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 1], ['0.1429', '0.1429', 1, 5], ['0.1429', '1.0000', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 1], ['0.1429', '0.1429', 1, 7], ['0.1429', '1.0000', '0.1429', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 3], ['0.1429', '0.1429', 1, 1], ['0.1429', '0.3333', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 3], ['0.1429', '0.1429', 1, 3], ['0.1429', '0.3333', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 3], ['0.1429', '0.1429', 1, 5], ['0.1429', '0.3333', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 3], ['0.1429', '0.1429', 1, 7], ['0.1429', '0.3333', '0.1429', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 5], ['0.1429', '0.1429', 1, 1], ['0.1429', '0.2000', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 5], ['0.1429', '0.1429', 1, 3], ['0.1429', '0.2000', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 5], ['0.1429', '0.1429', 1, 5], ['0.1429', '0.2000', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 5], ['0.1429', '0.1429', 1, 7], ['0.1429', '0.2000', '0.1429', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 7], ['0.1429', '0.1429', 1, 1], ['0.1429', '0.1429', '1.0000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 7], ['0.1429', '0.1429', 1, 3], ['0.1429', '0.1429', '0.3333', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 7], ['0.1429', '0.1429', 1, 5], ['0.1429', '0.1429', '0.2000', 1]]
[[1, 7, 7, 7], ['0.1429', 1, 7, 7], ['0.1429', '0.1429', 1, 7], ['0.1429', '0.1429', '0.1429', 1]]
共计:4096 组数据

复制代码

2、1 3 5 7 都要填到了除了规则3 规则4 之外
3、所谓对称就是（1,3） (3,1) (0,2) (2,0) 等等

阴阳神万物主 · 发表于 2020-2-16 19:33:35

wp231957 发表于 2020-2-16 18:51
1、我给你部分数据：

2、1 3 5 7 都要填到了除了规则3 规则4 之外

给出的数据，第一例就没有3，与 “1 3 5 7 都要填到了”矛盾。

wp231957 · 发表于 2020-2-16 19:43:05

阴阳神万物主发表于 2020-2-16 19:33
给出的数据，第一例就没有3，与 “1 3 5 7 都要填到了”矛盾。

4000多条呢我只是复制了结尾的一部分数据啊

wp231957 · 发表于 2020-2-16 19:44:31

阴阳神万物主发表于 2020-2-16 19:33
给出的数据，第一例就没有3，与 “1 3 5 7 都要填到了”矛盾。

我是说 1357都要走到了，没说必须在一个数组里全都有
本题目第一个符合要求的就是全 1 数组

阴阳神万物主 · 发表于 2020-2-16 19:51:39

本帖最后由阴阳神万物主于 2020-2-16 19:53 编辑

wp231957 发表于 2020-2-16 19:44
我是说 1357都要走到了，没说必须在一个数组里全都有
本题目第一个符合要求的就是全 1 数组

哦，是这个意思啊，看来和我一开始猜的一样。

阴阳神万物主 · 发表于 2020-2-16 20:10:40

我写了个生成器，理论上应该没有重复的，得到的结果是62208组，你检查一下生成规则是否正确

def create():
ns = (1,3,5,7,1/1,1/3,1/5,1/7)
res = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
n = [0]*6
le = len(ns)
poss = ((1,0),(2,0),(2,1),(3,0),(3,1),(3,2))
while n[0]<le:
for i in range(6):
res[poss[i][0]][poss[i][1]] = ns[n[i]]
res[poss[i][1]][poss[i][0]] = ns[n[i]-4]
yield res
n[i] += 1
while i and n[i]>5:
n[i] = 0
i -= 1
n[i] += 1
if __name__ == '__main__':
print(len(list(create())))

复制代码

xdhuch · 发表于 2020-2-16 20:29:53

如果把这个二维数组用4*4的表格表示的话，只有6个格子的数值可以变化，变化取值为：1,3,5,7,0.3333,0.2,0.1429共7个数，那么共有7^6=117649个组合。

我这么理解对吗？

wp231957 · 发表于 2020-2-16 20:32:11

阴阳神万物主发表于 2020-2-16 20:10
我写了个生成器，理论上应该没有重复的，得到的结果是62208组，你检查一下生成规则是否正确

现在进入手机模式，等明天我看
不过肯定没那么多就是了

wp231957 · 发表于 2020-2-16 20:33:12

xdhuch 发表于 2020-2-16 20:29
如果把这个二维数组用4*4的表格表示的话，只有6个格子的数值可以变化，变化取值为：1,3,5,7,0.3333,0.2,0.1 ...

还有对称点互为倒数，

xdhuch · 发表于 2020-2-16 20:49:17

wp231957 发表于 2020-2-16 20:33
还有对称点互为倒数，

红圈中6个格子的数确定的话，对称点的数就为固定值啊

wp231957 · 发表于 2020-2-16 20:57:45

xdhuch 发表于 2020-2-16 20:49
红圈中6个格子的数确定的话，对称点的数就为固定值啊

好像是这样，就是不知道有没有重复的

wp231957 · 发表于 2020-2-16 21:16:03

阴阳神万物主发表于 2020-2-16 20:10
我写了个生成器，理论上应该没有重复的，得到的结果是62208组，你检查一下生成规则是否正确

你这重复的还真多啊？？？

[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]
[[1, 7, 3, 3], [0.1429, 1, 3, 3], [0.3333, 0.3333, 1, 3], [0.3333, 0.3333, 0.3333, 1]]

复制代码

wp231957 · 发表于 2020-2-16 21:17:44

阴阳神万物主发表于 2020-2-16 20:10
我写了个生成器，理论上应该没有重复的，得到的结果是62208组，你检查一下生成规则是否正确

原本想写一个校验代码来着，可是发现肉眼就可以发现了

你看看代码是不是和你的一致：

def create():
ns = (1,3,5,7,1,0.3333,0.2,0.1429)
res = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
n = [0]*6
le = len(ns)
poss = ((1,0),(2,0),(2,1),(3,0),(3,1),(3,2))
while n[0]<le:
for i in range(6):
res[poss[i][0]][poss[i][1]] = ns[n[i]]
res[poss[i][1]][poss[i][0]] = ns[n[i]-4]
yield res
n[i] += 1
while i and n[i]>5:
n[i] = 0
i -= 1
n[i] += 1
if __name__ == '__main__':
lst=list(create())
for x in lst:
print(x)

复制代码

840613937 · 发表于 2020-2-16 21:34:22

提示: 作者被禁止或删除内容自动屏蔽

阴阳神万物主 · 发表于 2020-2-16 21:35:29

wp231957 发表于 2020-2-16 21:17
原本想写一个校验代码来着，可是发现肉眼就可以发现了

你看看代码是不是和你的一致：

一致的。

xdhuch · 发表于 2020-2-16 21:40:05

这个最佳答案由 xdhuch 给出，感谢 xdhuch 的回答。

单击隐藏图章

用代码实现了下，分析在9楼，你检查一下吧

import itertools
def Traversal_4_4():
ns = (1,3,5,7,1/3,1/5,1/7)
res = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
poss = ((1,0),(2,0),(2,1),(3,0),(3,1),(3,2))
num = 0;
for arr in itertools.product(ns, repeat=6):
for i in range(6):
res[poss[i][0]][poss[i][1]] = round(arr[i], 4)
res[poss[i][1]][poss[i][0]] = round(1/arr[i], 4)
print(res)
num = num+1
print(num)
if __name__ == '__main__' :
Traversal_4_4()

复制代码

wp231957 · 发表于 2020-2-16 21:56:46

840613937 发表于 2020-2-16 21:34
我太笨了，没看懂懂那个基础填充 1 3 5 7 是啥意思是每个数组里必须要包含 1 3 5 7 任意一个数吗 ...

就类似包含重复的全排列，只不过又加了两个限制

wp231957 · 发表于 2020-2-16 21:57:39

xdhuch 发表于 2020-2-16 21:40
用代码实现了下，分析在9楼，你检查一下吧

感觉和八楼代码差不多，他的代码那重复的可是很多

账号		自动登录	找回密码
密码			立即注册

840613937 840613937 当前离线 UID 415826 日志相册贡献荣誉积分 157 狗仔卡头像被屏蔽	发表于 2020-2-16 21:34:22 \| 显示全部楼层提示: 作者被禁止或删除内容自动屏蔽
	小甲鱼最新课程 -> https://ilovefishc.com
	回复支持反对使用道具举报显身卡

[已解决]征集答案，我只写出一半，还是硬编码

马上注册，结交更多好友，享用更多功能^_^

浏览过的版块