python 一行代码

1.输出曼德勃罗(Mandelbrot)图

print('\n'.join([''.join(['*' if abs((lambda a:lambda z,c,n:a(a,z,c,n))(lambda s,z,c,n:z if n==0 else s(s,z*z+c,c,n-1))(0,0.02*x+0.05j*y,40))<2 else ' ' for x in range(-80,20)]) for y in range(-20,20)]))

2.输出九九乘法表

print('\n'.join([' '.join(['%s*%s=%-2s'%(y,x,x*y) for y in range(1,x+1)]) for x in range(1,10)]))

3.输出心型

print('\n'.join([''.join([('AndyLove'[(x-y)%8]if((x*0.05)**2+(y*0.1)**2-1)**3-(x*0.05)**2*(y*0.1)**3<=0 else' ')for x in range(-30,30)]) for y in range(15,-15,-1)]))

4.输出螺旋

exec("""\nfrom turtle import *\nfor i in range(500):\n forward(i)\n left(91)\n""")

5.输出素数

print(' '.join([str(item) for item in filter(lambda x:not[x%i for i in range(2,x) if x%i==0],range(2,101))]))

6.输出斐波那契数列

print([x[0] for x in [(a[i][0],a.append([a[i][1],a[i][0]+a[i][1]])) for a in ([[1,1]],) for i in range(30)]])

7.实现快排算法

quicksort=lambda array:array if len(array)<=1 else quicksort([item for item in array[1:] if item<=array[0]])+[array[0]]+quicksort([item for item in array[1:] if item>array[0]])
array=[9,11,88,32,8]
print(quicksort(array))

8.输出单线迷宫

• cmd中输入

python -c "while 1:import random;print(random.choice('||-'),end='')"

9.开启Web服务

• cmd中输入

python -m http.server:8080
#然后在浏览器地址栏输入127.0.0.1:8080即可访问

10.模拟老虎机

• cmd中输入

python -c "import random;p=lambda:random.choice('7♪♫◄☼☽');[print('|'.join([p(),p(),p()]),end='\r') for i in range(8**5)]”

11.八皇后问题

[__import__('sys').stdout.write('\n'.join('.' * i + 'Q' + '.' * (8-i-1) for i in vec) + "\n========\n") for vec in __import__('itertools').permutations(range(8)) if 8 == len(set(vec[i]+i for i in range(8))) == len(set(vec[i]-i for i in range(8)))]

12.2维数组降维

ab=[[1,2,3],[5,8],[7,8,9]]
print([i for item in ab for i in item])

13.求2¹⁰⁰⁰各位数的和

print(sum(map(int,str(2**1000))))