题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
import sys
def do(num):
# 循环
# 算第一个数字
# 递增所有的数字
# 数字转字符串+号拼接
l_str_num = [str(i) for i in range(num*(num-1)+1, num*(num-1)+2*num, 2)]
return '+'.join(l_str_num)
if __name__ == '__main__':
num =int(sys.stdin.readline().strip())
r = do(num)
print(r)
查看11道真题和解析