結果
問題 | No.1528 Not 1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 22:15:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,950 bytes |
コンパイル時間 | 322 ms |
コンパイル使用メモリ | 87,044 KB |
実行使用メモリ | 109,000 KB |
最終ジャッジ日時 | 2023-08-23 15:15:21 |
合計ジャッジ時間 | 8,977 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 227 ms
92,212 KB |
testcase_01 | AC | 250 ms
102,176 KB |
testcase_02 | AC | 235 ms
95,004 KB |
testcase_03 | AC | 241 ms
95,740 KB |
testcase_04 | AC | 263 ms
105,784 KB |
testcase_05 | AC | 239 ms
93,504 KB |
testcase_06 | AC | 243 ms
98,436 KB |
testcase_07 | AC | 251 ms
102,036 KB |
testcase_08 | AC | 249 ms
98,832 KB |
testcase_09 | AC | 233 ms
93,744 KB |
testcase_10 | AC | 239 ms
96,352 KB |
testcase_11 | WA | - |
testcase_12 | AC | 220 ms
92,036 KB |
testcase_13 | AC | 227 ms
92,220 KB |
testcase_14 | AC | 226 ms
92,472 KB |
testcase_15 | AC | 224 ms
92,224 KB |
testcase_16 | AC | 227 ms
91,944 KB |
testcase_17 | AC | 221 ms
92,264 KB |
testcase_18 | AC | 253 ms
103,436 KB |
testcase_19 | AC | 267 ms
109,000 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 or 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()