有一个无限长的数字序列1,2,2,3,3,3,4,4,4,4,5,5,5,5,5。。。(数字序列从1开始递增,且数字k在该序列中正好出现k次),求第n项是多少
数据范围:
n = int(input()) for i in range(1, n+1): n = n - i if n <= 0: print(i) break
import math print(math.ceil((math.sqrt(8*int(input())+1)-1)/2))
class sequence: def nums(self): n = int(input()) i = 1 while n > 0: n -= i i += 1 return i - 1 if __name__ == "__main__": n = sequence() print(n.nums())