Submission #18579374

Source Code Expand

def is_prime(n):
    if n == 1:
        return False
    for i in range(2,int(n**0.5)+1):
        if n % i == 0:
            return False
    return True



N = int(input())
arr = list(range(2,N+1))
x = 1
for i in range(2,N+1):
    found = False
    fact = 0
    for j in range(len(arr)):
        count = 0
        while True:
            if arr[j] % i == 0:
                found = True
                count += 1
                arr[j] //= i
            else:
                break
        fact = max(count, fact)
    if found:
        x *= i**fact
print(x+1)

Submission Info

Submission Time
Task A - Redundant Redundancy
User noyan
Language Python (3.8.2)
Score 300
Code Size 595 Byte
Status AC
Exec Time 28 ms
Memory 9216 KiB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 18
AC × 2
Set Name Test Cases
All sample_01.txt, sample_02.txt, testcase_1.txt, testcase_10.txt, testcase_11.txt, testcase_12.txt, testcase_13.txt, testcase_14.txt, testcase_15.txt, testcase_16.txt, testcase_2.txt, testcase_3.txt, testcase_4.txt, testcase_5.txt, testcase_6.txt, testcase_7.txt, testcase_8.txt, testcase_9.txt
Sample sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 28 ms 8924 KiB
sample_02.txt AC 19 ms 9216 KiB
testcase_1.txt AC 26 ms 9208 KiB
testcase_10.txt AC 18 ms 9032 KiB
testcase_11.txt AC 25 ms 9028 KiB
testcase_12.txt AC 28 ms 8920 KiB
testcase_13.txt AC 23 ms 9024 KiB
testcase_14.txt AC 18 ms 9080 KiB
testcase_15.txt AC 24 ms 8920 KiB
testcase_16.txt AC 18 ms 9080 KiB
testcase_2.txt AC 24 ms 8920 KiB
testcase_3.txt AC 20 ms 9212 KiB
testcase_4.txt AC 19 ms 9080 KiB
testcase_5.txt AC 20 ms 9100 KiB
testcase_6.txt AC 19 ms 8868 KiB
testcase_7.txt AC 24 ms 9152 KiB
testcase_8.txt AC 19 ms 9152 KiB
testcase_9.txt AC 28 ms 9152 KiB