結果
問題 | No.1528 Not 1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 22:17:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 269 ms / 2,000 ms |
コード長 | 1,986 bytes |
コンパイル時間 | 1,172 ms |
コンパイル使用メモリ | 86,820 KB |
実行使用メモリ | 108,476 KB |
最終ジャッジ日時 | 2023-08-23 15:15:34 |
合計ジャッジ時間 | 7,771 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 230 ms
92,032 KB |
testcase_01 | AC | 255 ms
102,212 KB |
testcase_02 | AC | 242 ms
94,596 KB |
testcase_03 | AC | 237 ms
95,692 KB |
testcase_04 | AC | 260 ms
105,280 KB |
testcase_05 | AC | 238 ms
93,412 KB |
testcase_06 | AC | 243 ms
98,472 KB |
testcase_07 | AC | 248 ms
102,092 KB |
testcase_08 | AC | 253 ms
98,836 KB |
testcase_09 | AC | 240 ms
93,556 KB |
testcase_10 | AC | 241 ms
96,176 KB |
testcase_11 | AC | 230 ms
92,156 KB |
testcase_12 | AC | 232 ms
92,068 KB |
testcase_13 | AC | 226 ms
92,160 KB |
testcase_14 | AC | 228 ms
92,224 KB |
testcase_15 | AC | 230 ms
92,228 KB |
testcase_16 | AC | 229 ms
91,976 KB |
testcase_17 | AC | 226 ms
91,932 KB |
testcase_18 | AC | 256 ms
103,336 KB |
testcase_19 | AC | 269 ms
108,476 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) if N == 1: print(1) exit() if N == 3 or N == 5: print(-1) exit() if N % 2 == 0: ans = [] for i in range(2, N+1, 2): ans.append(i) print(*ans) else: A = [] juge = [False] * (N+1) for i in range(1, N+1): if i == 6: continue else: if i % 2 == 0: A.append(i) juge[i] = True A.append(6) for i in range(1, N+1): if i % 3 == 0: if juge[i] == False: A.append(i) print(*A[:N//2+1]) if __name__ == '__main__': main()