Submission #6497637
Source Code Expand
import math
import bisect
def div(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def main():
S = int(input())
div_list = div(S)
index = len(div_list)//2
XY1 = [0,0]
XY2 = [div_list[index],0]
XY3 = [0,int(S/div_list[index])]
ans = XY1 + XY2 + XY3
print (*ans)
if __name__ == "__main__":
main()
Submission Info
| Submission Time | |
|---|---|
| Task | A - Triangle |
| User | LiquidMetalSlime |
| Language | PyPy3 (2.4.0) |
| Score | 0 |
| Code Size | 510 Byte |
| Status | TLE |
| Exec Time | 2106 ms |
| Memory | 40656 KiB |
Judge Result
| Set Name | Sample | All | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample-01.txt, sample-02.txt, sample-03.txt |
| All | 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, sample-01.txt, sample-02.txt, sample-03.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 01-01.txt | AC | 175 ms | 38384 KiB |
| 01-02.txt | AC | 180 ms | 38896 KiB |
| 01-03.txt | AC | 172 ms | 38512 KiB |
| 01-04.txt | TLE | 2105 ms | 38384 KiB |
| 01-05.txt | TLE | 2105 ms | 40624 KiB |
| 01-06.txt | TLE | 2106 ms | 38384 KiB |
| 01-07.txt | TLE | 2105 ms | 38384 KiB |
| 01-08.txt | TLE | 2105 ms | 38384 KiB |
| 01-09.txt | TLE | 2105 ms | 38384 KiB |
| 01-10.txt | TLE | 2106 ms | 38384 KiB |
| 01-11.txt | TLE | 2105 ms | 38384 KiB |
| 01-12.txt | TLE | 2105 ms | 38640 KiB |
| 01-13.txt | TLE | 2105 ms | 38384 KiB |
| sample-01.txt | AC | 170 ms | 38256 KiB |
| sample-02.txt | AC | 172 ms | 38256 KiB |
| sample-03.txt | TLE | 2105 ms | 40656 KiB |