# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99587 | IvanBevanda | Uzastopni (COCI17_uzastopni) | Cpython 3 | 1052 ms | 66560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
N = int(input())
A = []
for i in range (1, (N//2)+2):
A.append(i)
B = []
for i in range (-1, -(len(A)+1), -1):
B.append(A[i])
if sum(B) == N:
print (str(B[-1]) + " " + str(B[0]))
elif sum(B) < N:
continue
elif sum(B) > N:
B.pop(0)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |