Problem:


Problem Statement

You are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.

Constraints

a and b are integers.

-10^9≤a≤b≤10^9

Partial Score

In test cases worth 100 points, -10≤a≤b≤10.

Input

The input is given from Standard Input in the following format:

a b

Output

If the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.

Sample Input 1

1 3

Sample Output 1

Positive

1×2×3=6 is positive.

Sample Input 2

-3 -1

Sample Output 2

Negative

(-3)×(-2)×(-1)=-6 is negative.

Sample Input 3

-1 1

Sample Output 3

Zero

(-1)×0×1=0.



Sample input:
1 3


Sample output:
Positive

Submission status: Accepted

Solution code:
a,b= list(map(int,input().split()))
if 0 < a:
    print("Positive")
elif b < 0:
    if abs(b-a) % 2 == 0:
        print("Negative")
    else:
        print("Positive")
else:
    print("Zero")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a==0 or b==0 or (a<0 and b>0):
  print("Zero")
elif a>0:
  print("Positive")
else:
  if (b-a)%2==0:
    print("Negative")
  else:
    print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 <= b:
    print("Zero")
elif a < 0 and b < 0:
    if (b + a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")
else:
    print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if 0<a and a<=b:
    print("Positive")
elif a<=b and b<0:
    if (b-a+1)%2==0:
        print("Positive")
    else:
        print("Negative")
elif a<=0 and 0<=b:
    print("Zero")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if 0<a:
  print('Positive')
elif b<0:
  print('Positive' if (b-a)%2==1 else 'Negative')
else:
  print('Zero')

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    if a < 0 and b > 0:
        print('Zero')
    elif a > 0 and b > 0:
        print('Positive')
    elif a == 0 or b == 0:
        print('Zero')
    else:
        if (abs(a) - abs(b) + 1) % 2 == 1:
            print('Negative')
        else:
            print('Positive')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if(a*b<=0):
	print("Zero")
elif(a>0):
	print("Positive")
elif((b-a+1)%2==0):
	print("Positive")
else:
	print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a <= 0 and b >= 0 or a == 0 or b == 0:
  print('Zero')
elif a < 0 and b < 0 and (b - a) % 2 == 0:
  print('Negative')
else:
  print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
# = list(map(int, input().split()))
# = [list(map(int, input().split())) for i in range(N)]

if a <0 and b>0:
    print("Zero")

elif a==0 or b==0:
    print("Zero")

elif a>0:
    print("Positive")

elif a<0 and b<0:
    if (a-b)%2==0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    if a>0:
        print('Positive')
    elif a<=0 and b>=0:
        print('Zero')
    elif b<0 and (b-a)%2==0:
        print('Negative')
    else:
        print('Positive')
resolve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    if a>0:
        print('Positive')
    elif a==0 or b==0:
        print('Zero')
    elif a<0 and b>0:
        print('Zero')
    elif b<0 and (b-a)%2==0:
        print('Negative')
    else:
        print('Positive')
resolve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a>0:
    print('Positive')
elif b>=0:
    print('Zero')
elif (b-a)%2==0:
    print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a <= 0 and b >= 0:
  print("Zero")
elif a < 0 and b < 0:
  if (a-b+2)%2 != 0:
    print("Positive")
  else:
    print("Negative")
elif a < 0:
  if -a%2 != 0:
    print("Positive")
  else:
    print("Negative")
else:
  print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a<=0 and b>=0:
  ans = 'Zero'
elif a>0:
  ans = 'Positive'
else:
  if (b-a)%2 == 0:
    ans = 'Negative'
  else:
    ans = 'Positive'
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>0 and b>0:
    print('Positive')
if a==0 or b==0:
    print('Zero')
if a<0 and b<0:
    if (a-b)%2!=0:
        print('Positive')
    else:
        print('Negative')
if a<0 and b>0:
    print('Zero')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a>0:
    print("Positive")
elif b >= 0 >= a:
    print("Zero")
elif (b-a+1)%2==0:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0 and b > 0:
  print('Positive')
elif a == 0 or b == 0:
  print('Zero')
elif a * b < 0:
  print('Zero')
else:
  if (b - a) % 2 == 0:
    print('Negative')
  else:
    print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a >= 1:
    print("Positive")
elif a <= 0 and 0 <= b:
    print("Zero")
elif a < 0 and b < 0:
    if (b - a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<=0 and b>=0:
    print("Zero")
elif (a<0 and b<0) and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Submission status: Accepted

Solution code:
def main():
    a, b = map( int, input().split())
    if a > 0:
        print("Positive")
        return
    if a <= 0 and b >= 0:
        print("Zero")
        return
    if (b-a+1)%2 == 0:
        print("Positive")
    else:
        print("Negative")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    a,b = readInts()
    judge = 0
    if a <= 0 <= b:
        pass
    elif a <= b < 0:
        if (abs(a) - abs(b) + 1)%2:
            judge = 2
        else:
            judge = 1
    else:
        judge = 1

    if judge == 0:#0がある
        print('Zero')
    elif judge == 1:#正
        print('Positive')
    else:
        print('Negative')
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
## libs ##
from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

def main():
    a, b = MII()
    if a <= 0 and 0 <= b :
        print('Zero')
        return None
    if a > 0:
        print('Positive')
        return None
    if b < 0:
        neg = a - b + 1
        if neg%2 == 0:
            print('Positive')
        else:
            print('Negative')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a > 0:
    ans = 1
elif a <= 0 and b >= 0:
    ans = 0
else:
    if (b-a+1)%2 == 0:
        ans = 1
    else:
        ans = -1
if ans == 1:
    print("Positive")
elif ans == 0:
    print("Zero")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b<= 0:
  print('Zero')
elif a>0:
  print('Positive')
else:
  if (b-a)%2==0:
    print('Negative')
  else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if ( a<0 and b>0 ) or ( a>0 and b<0 ) or a==0 or b==0:
	print('Zero')
else:
	if a>0 and b>0:
		print('Positive')
	else:
		c=b-a
		print('Positive' if c&1 else 'Negative')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a * b < 0:
	print('Zero')
elif a > 0:
	print('Positive')
else:
	diff = b - a
	print('Positive') if diff % 2 != 0 else print('Negative')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a,b=map(int,input().split())

if a>0:
    print("Positive")
elif a<=0 and b>=0:
    print("Zero")
else:
    if (a-b)%2==0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
import numpy as np
import sys

input = sys.stdin.readline

a,b  =  map(int,input().split())


cnt = b - a +1

if a <= 0 and b >= 0:
    print("Zero")
elif a > 0 and b > 0:
    print("Positive")
elif a < 0 and b < 0 and cnt%2 == 0:
    print("Positive")
elif a < 0 and b < 0 and cnt%2 == 1:
    print("Negative")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.readline
a,b=map(int,input().split())
if a>0:
    print("Positive")
    exit(0)
elif a<=0 and 0<=b:
    print("Zero")
    exit(0)
elif a<0 and b<0:
    num=b-a+1
    if num%2==0:
        print("Positive")
        exit(0)
    else:
        print("Negative")
        exit(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if b<0:
	print("Positive" if (b-a)%2 else "Negative")
elif a>0:
	print("Positive")
else:
	print("Zero")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
#０が含まれていたら0.あとは負の数で場合分け
if a<=0 and 0<=b:
  print("Zero")
  
elif a>0 and b>0:
  print("Positive")

elif a<0 and b<0:
  number = abs(a-b)+1
  if number%2 == 0:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a > 0 and b > 0:
    print("Positive")
elif (a == 0 or b == 0) or (a<0 and b>0):
    print("Zero")
elif a < 0 and b < 0:
    if (abs(a) - abs(b)) % 2 == 0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a > 0 and b > 0): print('Positive')
elif (a * b <= 0): print('Zero')
elif ((abs(a - b) + 1) % 2 == 0): print('Positive')
else: print('Negative')

Submission status: Accepted

Solution code:

a,b = map(int,input().split())

if a > 0:
    print("Positive")
elif a <= 0 and 0 <= b:
    print("Zero")
elif b < 0:
    if abs(b-a) % 2 == 1:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    a,b = readInts()
    if a <= 0 and 0 <= b:
        print("Zero")
        exit()
    if 1 <= a <= b:
        print("Positive")
    else:
        if (abs(b-a)+1)%2 == 0:
            print("Positive")
        else:
            print("Negative")

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

ans = ""
if a < 0 and b > 0:
    ans = "Zero"
elif a > 0:
    ans = "Positive"
else:
    ans = "Positive" if abs(a - b + 1) % 2 == 0 else "Negative"

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a <= 0 and b >= 0:
    print('Zero')
elif a > 0:
    print('Positive')
elif b < 0:
    if (b-a)%2 == 1:
        print('Positive')
    else:
        print('Negative')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a <= 0 and b >= 0:
    print("Zero")
elif a > 0:
    print("Positive")
elif b < 0:
    tmp = b-a
    if tmp %2 == 1:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a*b == 0 or a < 0 < b:
    ans = 'Zero'
elif a > 0 and b > 0:
    ans = 'Positive'
else:
    if (b - a) % 2 == 0:
        ans = 'Negative'
    else:
        ans = 'Positive'

print(ans)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A<=0<=B: print('Zero')
elif 0<A: print('Positive')
else: print('Positive' if (B-A+1)%2==0 else 'Negative')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if 0<a:
    ans = 'Positive'
elif b<0:
    ans = 'Positive' if (b-a)%2==1 else 'Negative'
else:
    ans = 'Zero'
print(ans)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b = map(int, input().split())
    if a <= 0 and b >= 0:
        print("Zero")
    elif a > 0:
        print("Positive")
    elif b < 0 and (abs(a - b) + 1) % 2 != 0:
        print("Negative")
    else:
        print("Positive")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 and b >= 0:
    print('Zero')
elif a > 0 or (b-a+1) % 2 == 0:
    print('Positive')
else:
    print('Negative')

Submission status: Accepted

Solution code:
# AGC 002: A – Range Product
a, b = [int(s) for s in input().split()]

if a > 0:
    print('Positive')
elif b < 0:
    if (b - a + 1) % 2 == 0:
        print('Positive')
    else:
        print('Negative')
elif a <= 0 <= b:
    print('Zero')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a <= 0 and b >= 0):
    print('Zero')
    exit()
elif(a < 0 and b < 0 and a < b):
    c = b - a + 1
    if (c % 2 == 0):
        print('Positive')
    else:
        print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/agc002/tasks/agc002_a
a, b = map(int, input().split())

if a > 0 and b > 0:
    print('Positive')
elif a <= 0 and 0 <= b:
    print('Zero')
else:
    d = b - a
    if d % 2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b <= 0:
    print('Zero')
elif a > 0 and b > 0:
    print('Positive')
else:
    if (b - a) % 2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 <= b:
    print("Zero")
    exit()

if a < 0 and b < 0:
    print("Positive" if (b - a + 1) % 2 == 0 else "Negative")
    exit()

print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a <= 0 <= b:
    print("Zero")
elif 1 <= a or (b-(a-1))%2 == 0:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    a,b = map(int, input().split())
    if a > 0:
        print('Positive')
    elif b>=0:
        print('Zero')
    else:
        if (b-a+1)%2 == 0:
            print('Positive')
        else:
            print('Negative')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
MOD = 10**9+7

def main():
    a, b = map(int, readline().split())
    l = b-a+1
    if a<=0 and 0<=b:
        ans = 'Zero'
    else:
        if l%2==0 or 0<a:
            ans = 'Positive'
        else:
            ans = 'Negative'
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split(' '))
if a<=0<=b:
    print("Zero")
elif a > 0 or (abs(b-a)%2!=0):
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
line = input().split(" ")
a = int(line[0])
b = int(line[1])

if a > 0:
  print("Positive")
elif a <= 0 and b >= 0:
  print("Zero")
else:
  c = b - a + 1
  if c % 2 == 0:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

if x <=0 and 0 <= y:
    print('Zero')
elif 0 < x:
    print('Positive')
elif y < 0:
    if (x-y+1)%2==0:
        print('Positive')
    else:
        print('Negative')

Submission status: Accepted

Solution code:
import numpy as np
a,b = map(int,input().split(' '))
if np.sign(a)==1 and np.sign(b) == 1:
    print('Positive')
elif np.sign(a) == -1 and np.sign(b) == 1:
    print('Zero')
elif np.sign(a) == -1 and np.sign(b) == -1:
    if (b - a + 1) % 2 == 0:
        print('Positive')
    else:
        print('Negative')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a > 0:
    print("Positive")
elif b < 0:
    print("Positive" if (b-a)%2 == 1 else "Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b = inpl()
if a>0 and b>0:
    res = 1
elif a*b<=0:
    res = 0
else:
    if abs(a-b)%2:
        res = 1
    else:
        res = -1
if res == 1:
    print('Positive')
elif res == 0:
    print('Zero')
else:
    print('Negative')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a * b <= 0:
    print("Zero")
elif a <= 0 and (b - a) % 2 == 0:
    print("Negative")
else:
    print("Positive")

Submission status: Accepted

Solution code:
def main():
    a, b = (int(i) for i in input().split())
    if a*b <= 0:
        print("Zero")
    elif 0 < a:
        print("Positive")
    else:
        if (b-a+1) % 2 == 0:
            print("Positive")
        else:
            print("Negative")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

a,b = map(int,input().split())
if a > 0:
  print("Positive")
elif a <= 0 and 0 <= b:
  print("Zero")
else:
  if (b-a) % 2 == 1:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0:
    print("Positive")
elif a == 0:
    print("Zero")
else:
    if b >= 0:
        print("Zero")
    else:
        if (b - a) % 2 == 0:
            print("Negative")
        else:
            print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a <= 0 and b >= 0:
    print("Zero")
elif a > 0:
    print("Positive")
else:
    l = b-a+1
    if l%2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
i = input().split()
a = int(i[0])
b = int(i[1])
if a < 0 and b > 0:
	print("Zero")  
elif a < 0 and b < 0:
	tmp = (a*-1) - (b*-1) + 1
	if tmp % 2 == 0:
		print("Positive")
	else:
		print("Negative")
else:
	print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a < 0 and b < 0:
    print("Positive") if (b - a + 1) % 2 == 0 else print("Negative")
elif a < 0 and b >= 0:
    print("Zero")
else:
    print("Positive")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b = LI()
if a <= 0 <= b:
    print('Zero')
elif a > 0:
    print('Positive')
elif b < 0:
    if (b - a) % 2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a<=0<=b:
    print('Zero')
else:
    if 0<a:
        print('Positive')
    else:
        if (b-a+1)%2==0:
            print('Positive')
        else:
            print('Negative')

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
if a>0:
  print("Positive")
elif b>=0 and a<=0:
  print("Zero")
else:
  if (b-a)%2==0:
    print("Negative")
  else:
    print("Positive")

Submission status: Accepted

Solution code:
# Problem A - Range Product

# input
a, b = map(int, input().split())

# calc
if (a==0 or b==0) or (a<0 and b>0) or (a>0 and b<0):
    print("Zero")
elif a>0 and b>0:
    print("Positive")
elif a<0 and b<0:
    nums = abs(b - a) + 1
    if nums%2==1:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a<=0<=b:
  print("Zero")
elif a<=b<0:
  if (b-a+1)%2 == 1:
    print("Negative")
  else:
    print("Positive")
else:
  print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a<=0 and 0<=b:
    print('Zero')
elif 0<a and 0<b:
    print('Positive')
else:
    ans = b-a+1
    if ans%2==0:
        print('Positive')
    else:
        print('Negative')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if (a>0 and b>0) or (((a+b) % 2)==1):
    print("Positive")
elif a<=0<=b:
    print("Zero")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a == 0 or b == 0 or (a <= 0 and b >= 0):
    print("Zero")
elif a>0 and b>0:
    print("Positive")
elif (a - b)%2 == 0:
    print("Negative")
else:
    print("Positive")

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
count=0
if A==0 or B==0:
	print("Zero")
	exit()
else:
	if A<0 and B>0:
		print("Zero")
	elif A>0:
		print("Positive")
	elif A<0 and B<0:
		if (abs(B)-abs(A))%2==0:
			print("Negative")
		else:
			print("Positive")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        a,b=map(int,input().split())
        if a==0 or b==0:
            return 'Zero'
        if a<0 and b>0:
            return 'Zero'
        else:
            if a<0 and b<0:
                if (b-a)%2==0:
                    return 'Negative'
                else:
                    return 'Positive'
            else:
                if a%2==0:
                    return 'Negative'
                else:
                    return 'Positive'
    print(main())
resolve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b > 0: ans = "Zero"
else:
  if abs(a-b+1) % 2 == 0: ans = "Positive"
  else: ans = "Negative"
print(ans)

Submission status: Accepted

Solution code:
a,b =map(int, input().split())

if b < 0:
    if (b-a+1)%2 == 0:
        print('Positive')
    else:
        print('Negative')
elif b >= 0 and a <= 0:
    print('Zero')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 <= b:
    print('Zero')
elif 0 < a:
    print('Positive')
else:
    if (b - a + 1) % 2 > 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 and 0 <= b:
    print("Zero")
elif 0 < a:
    print("Positive")
elif a < 0 and 0 <= b:
    print("Zero")
else:
    if abs(a - b) % 2 == 1:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a <= 0 <= b:
    print('Zero')
elif a > 0:
    print('Positive')
else:
    k = b-a + 1
    print('Negative' if k%2 else 'Positive')

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b = LI()
    if b < 0:
        if (b-a)&1:
            print("Positive")
        else:
            print("Negative")
    elif a <= 0:
        print("Zero")
    else:
        print("Positive")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a > 0 and b > 0:
    print("Positive")
elif a < 0 and b < 0:
    if (b-a+1)%2 == 0:
        print("Positive")
    else:
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    if a > 0 and b > 0:
        print('Positive')
    elif (a > 0) ^ (b > 0) or a == 0 or b == 0:
        print('Zero')
    else:
        if (a - b) % 2 != 0:
            print('Positive')
        else:
            print('Negative')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a<=0 and b>=0:
    print('Zero')
elif a<0 and b<0:
    if (b-a)%2==0:
        print('Negative')
    else:
        print('Positive')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if min(a,b)<0 and max(a,b)>0:
    print("Zero")
    exit()
if min(a,b)>0:
    print("Positive")
    exit()


c = -min(a,b) - max(a,b) + 1

if c%2==0:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b <= 0:
  print('Zero')
else:
  if a > 0 or abs(b-a) % 2 == 1:
    print('Positive')
  else:
    print('Negative')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b<=0:
    print("Zero")
elif a>0 and b>0:
    print("Positive")
else:
    if (b-a)%2==0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
a,b=list(map(int, input().split()))
if a<=0 and b>=0:
    print('Zero')
elif a<0 and b<0:
    if (a-b)%2==0:
        print('Negative')
    else:
        print('Positive')
else:
     print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

# p = max(1, b) - max(1, a) + 1
n = min(-1, b) - min(0, a) + 1

if a <= 0 <= b:
    print("Zero")
elif n % 2 == 0:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a > 0) & (b > 0):
    print('Positive')
elif (a <= 0) & (b >= 0):
    print('Zero')
else:
    if (b - a + 1) % 2 == 1:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a>0 and b>0:
  print("Positive")
  exit()
elif a<=0 and b>=0:
  print("Zero")
  exit()
elif a==0 or b==0:
  print("Zero")
elif a<0 and b<0:
  if (abs(a-b)+1)%2==0:
    print("Positive")
    exit()
  else:
    print("Negative")
    exit()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0 and b > 0:
    print("Positive")
elif a < 0 and b < 0:
    if (abs(a - b) + 1)%2 == 0:
        print("Positive")
    else:
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
# agc002_a.py
A, B = map(int,input().split())
if A<=0 and B>=0:
    print('Zero')
elif A>0 and B>0:
    print("Positive")
elif A<0 and B<0:
    if (A-B)%2==0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a*b < 0:
  print("Zero")
elif a > 0:
  print("Positive")
elif a == 0 or b == 0:
  print("Zero")
else:
  if (b-a)%2:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
ans=''

if a<=0 and b>=0:
  ans='Zero'
elif b<0:
  if (b-a+1)%2==0:
    ans='Positive'
  else:
    ans='Negative'
else:
  ans='Positive'
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a <= 0 and b >= 0:
    print("Zero")
elif a>0:
    print("Positive")
else:
    if abs(b-a)%2 == 0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
a,b=map(int,input().rstrip().split(' '))
if(a*b<=0):
  print("Zero")
else:
  if(a>0):
    print("Positive")
  else:
    if((b-a+1)%2==0):
      print("Positive")
    else:
      print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b < 0 or a*b==0:
    print('Zero')
elif 1<=a :
    print('Positive')
elif b <= -1 and abs(b-a) %2 ==0:
    print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a < 0 and b < 0:
    if (b - a) % 2 == 0:
        print('Negative')
    else:
        print('Positive')
elif a < 0 and b >= 0:
    print('Zero')
else:
    print('Positive')