結果
問題 | No.1198 お菓子配り-1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 23:31:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 240 ms / 2,000 ms |
コード長 | 1,541 bytes |
コンパイル時間 | 255 ms |
コンパイル使用メモリ | 87,256 KB |
実行使用メモリ | 92,628 KB |
最終ジャッジ日時 | 2023-08-22 13:53:12 |
合計ジャッジ時間 | 5,747 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
92,572 KB |
testcase_01 | AC | 237 ms
92,384 KB |
testcase_02 | AC | 234 ms
92,588 KB |
testcase_03 | AC | 232 ms
92,320 KB |
testcase_04 | AC | 233 ms
92,432 KB |
testcase_05 | AC | 233 ms
92,628 KB |
testcase_06 | AC | 232 ms
92,604 KB |
testcase_07 | AC | 233 ms
92,588 KB |
testcase_08 | AC | 234 ms
92,588 KB |
testcase_09 | AC | 234 ms
92,404 KB |
testcase_10 | AC | 234 ms
92,528 KB |
testcase_11 | AC | 233 ms
92,248 KB |
testcase_12 | AC | 238 ms
92,404 KB |
testcase_13 | AC | 234 ms
92,628 KB |
testcase_14 | AC | 234 ms
92,600 KB |
testcase_15 | AC | 233 ms
92,464 KB |
testcase_16 | AC | 230 ms
92,284 KB |
testcase_17 | AC | 237 ms
92,580 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 <= 2: print(-1) exit() if N % 2 == 1: print(1) else: if N % 4 == 0 and N > 4: print(1) else: print(-1) if __name__ == '__main__': main()