Python：每日一题 27（答题领鱼币）

stone1

谢谢

yangzhijian

张大象

import itertools as t
count = 0
for i in t.permutations(range(1,10),9):
    a = list(i)       
    if sum(a[0:9:3]) ==  sum(a[1:9:3]) == sum(a[2:9:3]) == sum(a[0:3]) == sum(a[3:6]) == sum(a[6:9]) == sum(a[0:9:4]) == sum(a[2:7:2]):
        count+=1
        print('['+str(count)+']')
        print(' ',a[0:3])
        print(' ',a[3:6])
        print(' ',a[6:9])

renze

学习学习

gausser

# For import permutations
import itertools
import numpy

s = range(1, 10)
# lst is full arrangement of [1 - 10]: 9!
lst = list(itertools.permutations(s, 9))
count = 0

for FullArrange in lst:
    if FullArrange[0] + FullArrange[3] + FullArrange[6] == 15 and \
       FullArrange[1] + FullArrange[4] + FullArrange[7] == 15 and \
       FullArrange[2] + FullArrange[5] + FullArrange[8] == 15 and \
       FullArrange[0] + FullArrange[4] + FullArrange[8] == 15 and \
       FullArrange[2] + FullArrange[4] + FullArrange[6] == 15 and \
       FullArrange[0] + FullArrange[1] + FullArrange[2] == 15 and \
       FullArrange[3] + FullArrange[4] + FullArrange[5] == 15 and \
       FullArrange[6] + FullArrange[7] + FullArrange[8] == 15:
       TmpArray = numpy.array(FullArrange)
       TmpArray = TmpArray.reshape((3, 3)) # Change the shape of the array: 3 rows and 3 columns
       count += 1
       print "#" * 20
       print FullArrange
       print TmpArray
       
print "The total number is:", count

石小龙

这题有这么难吗，代码都这么长，算了，太难我就不做了，哈

shigure_takimi

allFifteen = [[i,j,k] for i in range(1,10) for j in range(1,10) for k in range(1,10) \
              if i!=j and j!=k and k!=i and i+j+k==15]

jiugongge = [[i,j,k] for i in allFifteen for j in allFifteen for k in allFifteen \
             if j[0] not in i and j[1] not in i and j[2] not in i and \
             j[0] not in k and j[1] not in k and j[2] not in k and \
             i[0] not in k and i[1] not in k and i[2] not in k and \
             i[0]+j[0]+k[0] == i[1]+j[1]+k[1] == i[2]+j[2]+k[2] == 15 and\
             i[0]+j[1]+k[2] == i[2]+j[1]+k[0] == 15]

for i in jiugongge:
    print('-------------------------')
    for j in i:
        print(j)


# 很多if，很暴力，但结果出来了。
>>> 
-------------------------
[2, 7, 6]
[9, 5, 1]
[4, 3, 8]
-------------------------
[2, 9, 4]
[7, 5, 3]
[6, 1, 8]
-------------------------
[4, 3, 8]
[9, 5, 1]
[2, 7, 6]
-------------------------
[4, 9, 2]
[3, 5, 7]
[8, 1, 6]
-------------------------
[6, 1, 8]
[7, 5, 3]
[2, 9, 4]
-------------------------
[6, 7, 2]
[1, 5, 9]
[8, 3, 4]
-------------------------
[8, 1, 6]
[3, 5, 7]
[4, 9, 2]
-------------------------
[8, 3, 4]
[1, 5, 9]
[6, 7, 2]

victor.xu

看看。

瞬秒爆加速

a = [(i,ii,iii) for i in range(1,10) for ii in range(1,10) for iii in range(1,10) if i!=ii and ii!=iii and i!=iii]
for x in a:
    for y in a:
        if (x[0] in y) or (x[1] in y) or (x[2] in y):
            continue
        for z in a:
            if (x[0] in z) or (x[1] in z) or (x[2] in z) or (y[0] in z) or (y[1] in z) or (y[2] in z):
                continue
            if x[2]+y[2]+z[2] ==x[1]+y[1]+z[1] == x[0]+y[0]+z[0] == sum(x) ==sum(y) ==sum(z) == x[0]+y[1]+z[2] == x[2]+y[1]+z[0]:
                print("-----")
                print(x)
                print(y)
                print(z)

大头目

#学习了

import itertools as t
a = t.permutations(range(1,10),9)
for i in a:
    i = list(i)
    if i[0]+i[4]+i[8]==15 and i[2]+i[4]+i[6]==15 and i[0]+i[1]+i[2]==15 and i[0]+i[3]+i[6]==15:
        if i[1]+i[4]+i[7]==15 and i[3]+i[4]+i[5]==15:
            print (i)



import numpy
from itertools import permutations as pt
comb = pt(range(1,10), 9)

def check(lst):
    return True if sum(lst[0:3]) == sum(lst[3:6]) == sum(lst[6:9]) == sum(lst[0:9:3]) \
                                == sum(lst[1:9:3]) == sum(lst[2:9:3]) == sum(lst[0:9:4]) == sum(lst[2:7:2]) else False

i = 0
for each in comb:
    if check(each):
        c = numpy.array(each)
        c = c.reshape((3, 3))
        i += 1
        print ('Number %d :' % i)
        print ('')
        print (c)
        print ('')
        print ('-' * 20)

zanglanju

凌九霄

from itertools import permutations

allarrangement = list(permutations([1, 2, 3, 4, 5, 6, 7, 8, 9], 9))
for i in allarrangement:
    if sum(i[0:3]) == sum(i[3:6]) == sum(i[6:9]) == sum(i[0:9:3]) == sum(i[1:9:3]) == sum(i[2:9:3]) == sum(i[0:9:4]) == sum(i[2:8:2]):
        print("{0}|{1}|{2}\n{3}|{4}|{5}\n{6}|{7}|{8}\n".format(i[0], i[1], i[2], i[3], i[4], i[5], i[6], i[7], i[8]))

Even_138

学习

jrro452

from itertools import permutations as pt
result = []
combol = pt(range(1,10),3)
for i in combol:
    num = []
    a, b, c = i
    if a+b+c==15:
        num.append(a)
        num.append(b)
        num.append(c)
        result.append(num)
combol2 = pt(result,3)
Finalresult = []
for x in combol2:
    num2 = []
    num1 = []
    A,B,C = x
    if A[0]+B[0]+C[0]==15 and A[1]+B[1]+C[1]==15 and A[2]+B[2]+C[2]==15 and A[0]+B[1]+C[2]==15 and A[2]+B[1]+C[0]==15:
        num2.append(A)
        num2.append(B)
        num2.append(C)
        num1.extend(A)
        num1.extend(B)
        num1.extend(C)
        if len(list(set(num1)))==9:
            Finalresult.append(num2)
print('满足要求的九宫格有%d组'%len(Finalresult))
print(Finalresult)

方法太笨了····

jrro452

jrro452 发表于 2018-5-23 17:07
方法太笨了····

结果：
满足要求的九宫格有8组
[[[2, 7, 6], [9, 5, 1], [4, 3, 8]], [[2, 9, 4], [7, 5, 3], [6, 1, 8]], [[4, 3, 8], [9, 5, 1], [2, 7, 6]], [[4, 9, 2], [3, 5, 7], [8, 1, 6]], [[6, 1, 8], [7, 5, 3], [2, 9, 4]], [[6, 7, 2], [1, 5, 9], [8, 3, 4]], [[8, 1, 6], [3, 5, 7], [4, 9, 2]], [[8, 3, 4], [1, 5, 9], [6, 7, 2]]]

萧丹夜

哈哈哈 不会

小强工作室

学习中

lyslyslys

感谢

sunyuanency

每天一学

hipppython

学习学习