利用莱布尼茨公式计算π

from tqdm import trange
pi = 0
for i in trange(1000000000):
    if i%2 == 0:
        pi += 1/(2*i+1)
    else:
        pi -= 1/(2*i+1)
pi = pi*4
print(pi)

理论上迭代次数越大，数就越接近π