結果
問題 | No.1198 お菓子配り-1 |
ユーザー |
|
提出日時 | 2020-08-28 21:58:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 231 ms / 2,000 ms |
コード長 | 1,486 bytes |
コンパイル時間 | 218 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 100,992 KB |
最終ジャッジ日時 | 2024-11-16 09:25:05 |
合計ジャッジ時間 | 5,493 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 14 |
ソースコード
#!/usr/bin/env python # -*- coding: utf-8 -*- import sys # {{{ import os import time import re from pydoc import help import string import math from operator import itemgetter from collections import Counter from collections import deque from collections import defaultdict as dd import fractions from heapq import heappop, heappush, heapify import array from bisect import bisect_left, bisect_right, insort_left, insort_right from copy import deepcopy as dcopy import itertools # }}} # pre-defined{{{ sys.setrecursionlimit(10**7) INF = 10**20 GOSA = 1.0 / 10**10 MOD = 10**9+7 ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)] # can also use string module def LI(): return [int(x) for x in sys.stdin.readline().split()] def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()] def LF(): return [float(x) for x in sys.stdin.readline().split()] def LS(): return sys.stdin.readline().split() def I(): return int(sys.stdin.readline()) def F(): return float(sys.stdin.readline()) def DP(N, M, first): return [[first] * M for n in range(N)] def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)] from inspect import currentframe # }}} def solve(): n = int(input()) if (n == 1): print(-1) elif (n%2 == 1): print(1) elif (n == 4): print(-1) elif (n%4 == 0): print(1) else: print(-1) return 0 if __name__ == "__main__":# {{{ solve() # vim: set foldmethod=marker: }}}