Submission #6439598
Source Code Expand
from itertools import combinations from fractions import gcd import math n = int(input()) mx = 55555 ans = [] primes = [2] for i in range(3, mx, 2): if all(i % p != 0 for p in primes): primes.append(i) if i % 5 == 1: ans.append(i) if len(ans) == n: break print(*ans)
Submission Info
Submission Time | |
---|---|
Task | D - Five, Five Everywhere |
User | itopost |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 338 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 5564 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | in01.txt, in02.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 75 ms | 5564 KB |
in02.txt | AC | 38 ms | 5052 KB |
sample_01.txt | AC | 34 ms | 5052 KB |
sample_02.txt | AC | 35 ms | 5052 KB |
sample_03.txt | AC | 34 ms | 5052 KB |