【蓝桥杯真题7 难度:中等】杨辉三角形 2022.12.1

Cccf$

1. import math
   
2. def FirstAppear(n):
   
3.     ans = [((i * (i + 1) // 2) + j + 1) for i in range(n + 1) for j in range(n // 2 + 2) if math.comb(i,j) == n]
   
4.     return ans[0]
   
5. 
   
6. FirstAppear(6)
   
7. 13
   
8. FirstAppear(154)
   
9. 11937
   
10. FirstAppear(456)
    
11. 104198

复制代码