(cache)Submission #63801984 - OMRON Corporation Programming Contest 2025 (AtCoder Beginner Contest 397)

Contest Duration: 2025-03-15(Sat) 21:00 - 2025-03-15(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #63801984

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import math
def find_solution(N):
    for d in range(1, int(math.sqrt(N)) + 1):
        if N % d == 0:
            k = N // d
            a = 3
            b = 3 * d
            c = d * d - k
            discriminant = b * b - 4 * a * c
            if discriminant >= 0:
                sqrt_disc = int(math.isqrt(discriminant))
                if sqrt_disc * sqrt_disc == discriminant:
                    y1 = (-b + sqrt_disc) // (2 * a)
                    y2 = (-b - sqrt_disc) // (2 * a)
                    for y in [y1, y2]:
                        if y > 0:
                            x = y + d
                            if x > 0:
                                print(x, y)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import math


def find_solution(N):
    for d in range(1, int(math.sqrt(N)) + 1):
        if N % d == 0:
            k = N // d
            a = 3
            b = 3 * d
            c = d * d - k
            discriminant = b * b - 4 * a * c
            if discriminant >= 0:
                sqrt_disc = int(math.isqrt(discriminant))
                if sqrt_disc * sqrt_disc == discriminant:
                    y1 = (-b + sqrt_disc) // (2 * a)
                    y2 = (-b - sqrt_disc) // (2 * a)
                    for y in [y1, y2]:
                        if y > 0:
                            x = y + d
                            if x > 0:
                                print(x, y)
                                return
    print(-1)


n = int(input())
find_solution(n)

Submission Info

Submission Time	2025-03-15 21:34:53
Task	D - Cubes
User	practicejoi
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	802 Byte
Status	TLE
Exec Time	2212 ms
Memory	80876 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 425

Status

× 3

AC	× 29
TLE	× 6

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	62 ms	76652 KiB
00_sample_01.txt	AC	62 ms	76428 KiB
00_sample_02.txt	AC	66 ms	80696 KiB
01_test_00.txt	AC	1545 ms	80504 KiB
01_test_01.txt	TLE	2212 ms	80328 KiB
01_test_02.txt	AC	67 ms	80784 KiB
01_test_03.txt	AC	69 ms	80428 KiB
01_test_04.txt	AC	66 ms	80776 KiB
01_test_05.txt	AC	63 ms	80772 KiB
01_test_06.txt	AC	64 ms	80716 KiB
01_test_07.txt	AC	63 ms	80616 KiB
01_test_08.txt	AC	65 ms	80764 KiB
01_test_09.txt	TLE	2016 ms	80576 KiB
01_test_10.txt	TLE	2211 ms	80704 KiB
01_test_11.txt	AC	61 ms	80508 KiB
01_test_12.txt	AC	62 ms	80700 KiB
01_test_13.txt	AC	63 ms	80640 KiB
01_test_14.txt	AC	62 ms	80804 KiB
01_test_15.txt	AC	61 ms	76640 KiB
01_test_16.txt	AC	61 ms	76364 KiB
01_test_17.txt	AC	62 ms	76356 KiB
01_test_18.txt	AC	62 ms	76272 KiB
01_test_19.txt	AC	61 ms	76324 KiB
01_test_20.txt	AC	61 ms	76480 KiB
01_test_21.txt	TLE	2211 ms	80652 KiB
01_test_22.txt	TLE	2211 ms	80580 KiB
01_test_23.txt	TLE	2211 ms	80416 KiB
01_test_24.txt	AC	59 ms	76336 KiB
01_test_25.txt	AC	60 ms	76720 KiB
01_test_26.txt	AC	60 ms	76460 KiB
01_test_27.txt	AC	60 ms	76368 KiB
01_test_28.txt	AC	60 ms	76324 KiB
01_test_29.txt	AC	59 ms	76632 KiB
01_test_30.txt	AC	61 ms	80732 KiB
01_test_31.txt	AC	61 ms	80876 KiB