結果
問題 |
No.1498 Factorization from -1 to 1
|
ユーザー |
![]() |
提出日時 | 2025-03-20 20:48:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 313 ms / 3,000 ms |
コード長 | 1,804 bytes |
コンパイル時間 | 301 ms |
コンパイル使用メモリ | 82,768 KB |
実行使用メモリ | 120,420 KB |
最終ジャッジ日時 | 2025-03-20 20:49:00 |
合計ジャッジ時間 | 6,654 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 6 |
other | AC * 17 |
ソースコード
import sys def sieve(n): is_prime = [True] * (n + 1) is_prime[0] = is_prime[1] = False for i in range(2, int(n ** 0.5) + 1): if is_prime[i]: for j in range(i * i, n + 1, i): is_prime[j] = False primes = [i for i, val in enumerate(is_prime) if val] return primes def main(): max_i = 100001 primes = sieve(10**5) sieve_factors = [[] for _ in range(max_i + 1)] for p in primes: if p == 2: for j in range(1, max_i + 1, 2): sieve_factors[j].append(2) elif p % 4 == 1: a = 2 while True: if pow(a, (p - 1) // 2, p) == p - 1: break a += 1 k = (p - 1) // 4 x = pow(a, k, p) roots = [x, p - x] for root in roots: current = root if current == 0: current += p if current <= 0: current += p while current <= max_i: sieve_factors[current].append(p) current += p for i in range(1, max_i + 1): sieve_factors[i].sort() factors_list = [[] for _ in range(max_i + 1)] for i in range(1, max_i + 1): x = i * i + 1 temp = x factors = [] for p in sieve_factors[i]: while temp % p == 0: factors.append(p) temp //= p if temp > 1: factors.append(temp) factors_list[i] = factors input = sys.stdin.read().split() Q = int(input[0]) queries = list(map(int, input[1:Q+1])) for q in queries: print(' '.join(map(str, factors_list[q]))) if __name__ == "__main__": main()