Submission details
Task:Alien Invasion II
Sender:Wu xiaobo
Submission time:2020-09-19 13:33:13 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#10.76 sdetails
#2--details
#3--details

Code

# num = input()
#
# for add in range(100000):
#     cur = int(str(add) + num)
#     for j in range(2, int(cur ** 0.5) + 1):
#         if cur % j == 0:
#             print(cur)
#             print('{} {}'.format(j, cur // j))
#             break
#     else:
#         continue
#     break


def detect_prime(n):
    for j in range(2, int(n ** 0.5) + 1):
        if n % j == 0:
            return j
    return -1


num = input()
ans = detect_prime(int(num))
if ans != -1:
    print(num)
    print('{} {}'.format(ans, num // ans))
else:
    for n in range(int('1' + num), 100000):
        ans = detect_prime(n)
        if ans != -1:
            print(n)
            print('{} {}'.format(ans, n // ans))
            break

Test details

Test 1

Verdict:

input
2368469234876449

correct output
22368469234876449
3 7456156411625483

user output
(empty)

Test 2

Verdict:

input
292929292929292929292929292931

correct output
129292929292929292929292929293...

user output
(empty)

Test 3

Verdict:

input
292929292929292929292929292979

correct output
129292929292929292929292929297...

user output
(empty)