[蓝桥杯] 等差数列 (Python 实现)
2022/1/13 12:04:27
本文主要是介绍[蓝桥杯] 等差数列 (Python 实现),对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
题目:
代码:
def gcd (a, b): return gcd(b, a % b) if b else a n = int(input()) nums = list(map(int,input().split(' '))) nums.sort() diff = [nums[i] - nums[i-1] for i in range(1,n)] temp = gcd(diff[0],diff[1]) for x in range(2,len(diff)): temp = gcd(temp, diff[x]) try: print(((nums[-1] - nums[0])//temp) + 1) except: print(len(nums))
这篇关于[蓝桥杯] 等差数列 (Python 实现)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-03-30开始python成长之路
- 2024-03-29python optparse
- 2024-03-29python map 函数
- 2024-03-20invalid format specifier python
- 2024-03-18pool.map python
- 2024-03-18threads in python
- 2024-03-14python Ai 应用开发基础训练,字符串,字典,文件
- 2024-03-13id3 algorithm python
- 2024-03-13sum array elements python
- 2024-03-12python colon equals