結果
問題 | No.1198 お菓子配り-1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 23:30:05 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,531 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 87,244 KB |
実行使用メモリ | 92,480 KB |
最終ジャッジ日時 | 2023-08-22 13:52:53 |
合計ジャッジ時間 | 6,670 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 251 ms
92,364 KB |
testcase_01 | AC | 249 ms
92,396 KB |
testcase_02 | AC | 251 ms
92,276 KB |
testcase_03 | AC | 252 ms
92,464 KB |
testcase_04 | AC | 250 ms
92,360 KB |
testcase_05 | AC | 249 ms
92,212 KB |
testcase_06 | AC | 249 ms
92,296 KB |
testcase_07 | AC | 252 ms
92,280 KB |
testcase_08 | AC | 248 ms
92,400 KB |
testcase_09 | AC | 246 ms
92,400 KB |
testcase_10 | AC | 251 ms
92,288 KB |
testcase_11 | AC | 253 ms
92,464 KB |
testcase_12 | AC | 252 ms
92,320 KB |
testcase_13 | AC | 253 ms
92,480 KB |
testcase_14 | AC | 253 ms
92,300 KB |
testcase_15 | AC | 252 ms
92,296 KB |
testcase_16 | AC | 252 ms
92,412 KB |
testcase_17 | WA | - |
ソースコード
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: print(1) else: print(-1) if __name__ == '__main__': main()