Submission #6780527

---

Source Code Expand

# 2019/08/09
from itertools import accumulate
from bisect import bisect_left

n=int(input())
a=[0]+list(accumulate(list(range(1,n+1))))


def bsct(a,key):
    l=0
    r=len(a)
    mid=(l+r)//2
    while l<=r:
        if a[mid]==key:
            return mid
        elif a[mid]>key:
            r=mid-1
        else:
            l=mid+1
        mid=(l+r)//2
    return 0

res=bsct(a,n)
if res:
    print(res)
    exit()

idx=bisect_left(a,n)
rem=a[idx]-n

ans=list(range(1,idx+1))
del ans[rem]
print(*ans,sep='\n')

Submission Info

Judge Result