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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

if a > 0:
  print "Positive"

elif b >= 0:
  print "Zero" #Fate/Zeroは神アニメ

else:
  if b - a % 2 == 0:
    print "Positive"
  else:
    print "Negative"

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m = map(int,raw_input().split())
arr = [1]*n
x = [False]*n
f = True
counter = 0
for i in xrange(m) :
    a,b = map(int,raw_input().split())
    if x[a-1] :
        x[b-1] = True
    arr[a-1] -= 1
    arr[b-1] += 1
    if arr[a-1] == 0 :
        x[a-1] = False
for j in x :
    if j  :
        counter += 1
print counter

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, raw_input().split(" "))
def f(arr):
    return reduce(lambda x, y: x*y, arr)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split() ]
multi_sum = 1
for i in range(a,b):
    if not i:
        print("Zero")
    multi_sum *= i
if multi_sum > 0:
    print("Positive")
elif multi_sum < 0:
    print("Negative")

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split() ]
multi_sum = 1
for i in range(a,b):
    multi_sum *= i
if multi_sum > 0:
    print("Positive")
elif multi_sum < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Wrong Answer

Solution code:
def product(m, d, n):
    if (n == 0):
        return 1
    else:
        return m * product(m + d, d, n - 1)

a,b = [int(i) for i in input().split() ]
d = 1
n = abs(b) - abs(a)
multi_sum = product(a, d, n)
if multi_sum > 0:
    print("Positive")
elif multi_sum < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Wrong Answer

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

A, B = map(int, input().split())
if A < 0:
    if B < 0:
        print('Negative' if abs(B)%2 else 'Positive')
    else:
        print('Zero')
else:
    print('Positive')

Submission status: Wrong Answer

Solution code:
a, b = map(int, raw_input().split(" "))
def f(arr):
    return reduce(lambda x, y: x*y, arr)

if a == 0 or b == 0:
    print "Zero"
elif f(range(a,b+1)) < 0:
    print "Negative"
else:
    print "Positive"

Submission status: Wrong Answer

Solution code:
from functools import reduce

a,b = [int(i) for i in input().split() ]
multi_sum = reduce(lambda x,y:x*y,[ i for i in range(a,b) ])
if multi_sum > 0:
    print("Positive")
elif multi_sum < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A, B = map(int, input().split())
if A < 0:
    if B < 0:
        print('Negative')
    else:
        print('Zero')
else:
    print('Positive ')

Submission status: Wrong Answer

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

print 'Zero' if (a<0 and b>0) or (a==0 or b==0) else 'Negetive' if b<0 and (a-b)%2==0  else 'Positive'
exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def f(x):
    if x>0:return 1
    elif x<0:return -1
    elif x==0:
        return 0


a,b=list(map(int,input().split()))
if a<= 0 and b>=0:
    print('Zero')

if (a<0 and b<0) :
    if (b-a) %2:
        print('Positive')
    else:
        print('Negattive')

if (a>0 and b>0):
    print("Positive")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print 'Positive' if a*b>0 else 'Negetive' if a*b<0 else 'Zero'

Submission status: Time Limit Exceeded

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

count = 1

for i in range(a,b+1):
    count *= i

if count == 0:
    print("Zero")
elif count > 0:
    print("Positive")
else:
    print("Negative")

Submission status: Time Limit Exceeded

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

ans = 1
for i in range(a, b + 1):
    ans *= i

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
elif ans == 0:
    print("Zero")
else:
    pass

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
   c=c*i
if c>0:
    print("Positive")
elif c<0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split(' '))
result = 1
for i in range(a, b+1):
	result *= i
print('Positive' if result > 0 else 'Zero' if result == 0 else 'Negative')

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
ans = 1
for i in range(a , b + 1):
    ans *= i

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
elif ans == 0:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
A = list(map(int, input().split()))
A.sort()
a = A[0]
b = A[1]
ans = a

for i in range(1, b-a+1):
    ans *= a + i
    i += 1

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
s = 1
for i in range(a, b+1):
  s *= i
print("Positive" if s > 0 else "Negative" if s < 0 else "Zero")

Submission status: Time Limit Exceeded

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

cnt=0
if (a>0 and b<0) or (a<0 and b>0):
  ans="Zero"
elif a==0 or b==0:
  ans="Zero"
elif a>0 and b>0:
  ans="Positive"
elif a<0 and b<0:
  a,b=a*-1,b*-1
  for i in range(b,a+1):
    cnt+=1
  if cnt%2==0:
    ans="Positive"
  else:
    ans="Negative"
    
print(ans)

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
n = 1
L = []
for i in range(min(a, b), max(a, b)+1):
  n = n * i
if n == 0:
  print('Zero')
elif n > 0:
  print('Positive')
else:
  print('Negative')

Submission status: Time Limit Exceeded

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

sum = 1

for i in range(a,b+1):
    sum *= i
    
if sum < 0:
    print("Negative")
elif sum == 0:
    print("Zero")
else:
    print("Positive")

Submission status: Time Limit Exceeded

Solution code:
a,b = map(int,input().split())
ans = 1
for i in range(a,b+1):
  ans *= i
if ans > 0:
  print("Positive")
elif ans < 0:
  print("Negative")
elif ans == 0:
  print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = [int(i) for i in input().split()]
s = 1
for i in range(a, b+1):
    s *= i
if s > 0:
    print("Positive")
elif s == 0:
    print("Zero")
else:
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
#40
import sys
a,b = map(int,input().split())
cou = 0

if a<=0 and b>=0:
    print("Zero")
    sys.exit()
elif a>=0 and b<=0:
    print("Zero")
    sys.exit()
    
if a>0 and b>0:
    print("Positive")
    sys.exit()
else:
    cou = 1
    while a != b:
        cou +=1
    if cou %2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
neg_count = 0
for i in range(a, b+1) :
    if i < 0 :
        neg_count += 1
    elif i == 0 :
        neg_count = -1
        break
    else :
        continue

if neg_count == -1 :
    print("Zero")
elif neg_count % 2 == 0 :
    print("Positive")
else :
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
ne=[]
po=[]
for i in range(a,b+1):
    if i<0:
        ne.append(i)
    if i>0:
        po.append(i)
    if i==0:
        print("Zero")
        exit()
if len(po)==0:
    print("Positive" if len(ne)%2==0 else "Negative")
else:
    print("Positive")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
c = 1
for i in range(a, b+1):
    c *= i
if c==0:
    print("Zero")
elif c>0:
    print("Positive")
else:
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
minus = 0
for i in range(a, b + 1):
    if i == 0:
        print('Zero')
        break
    elif i < 0:
        minus += 1
else:
    if minus % 2:
        print('Negative')
    else:
        print('Positive')

Submission status: Time Limit Exceeded

Solution code:
##!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase


def main():
    pass


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

a, b = map(int, input().split())
c = 1
for i in range(a, b+1):
    c *= i
if c>0:
    print("Positive")
elif c<0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    pass


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()


a, b = map(int, input().split())
c = 1
for i in range(a, b+1):
    c *= i
if c>0:
    print("Positive")
elif c<0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
c = 1
for i in range(a, b+1):
    c *= i
if c>0:
    print("Positive")
elif c<0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
c = 1
for i in range(a, b+1):
    c = c * i
if c > 0:
    print("Positive")
if c < 0:
    print("Negative")
if c == 0:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
product=1
for i in range(a,b+1):
  product=product*i
  if i==0:
    print("Zero")
    break
if (product)>0:
  print("Positive")
elif (product)<0:
  print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
product=1
for i in range(a,b+1):
  product=product*i
if (product)>0:
  print("Positive")
elif (product)<0:
  print("Negative")
elif (product)==0:
  print("Zero")

Submission status: Time Limit Exceeded

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

for i in range(a, b+1):
    p *= i
if p > 0:
    print("Positive")
elif p < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a = list(map(int,input().split()))
s = 1
for i in range(a[0],a[1]):
    s *= i
s *= a[1]
if s < 0:
    print("Negative")
elif s > 0:
    print("Positive")
else:
    print("Zero")

Submission status: Time Limit Exceeded

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

while a <= b:
    p *= a
    a += 1

if p > 0:
    print("Positive")
elif p == 0:
    print("Zero")
else:
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
import sys
from math import factorial, fabs
a, b = map(int, input().split())
try:
    if factorial(b)/factorial(a)==0:
        print("Zero")
        sys.exit()
except:
    if 0 in range(a, b+1):
        print("Zero")
        sys.exit()       
    c=0
x=True
if (fabs(a)-fabs(b))%2==0 and (b<0):
    x=False
a, b= fabs(a), fabs(b)
fin=int(factorial(b)/factorial(a))
if fin==0 and factorial(b)/factorial(a)!=0:
    fin=int(factorial(a)/factorial(b))
if x==False:
    fin*=-1
if fin==0:
    ans="Zero"
elif fin<0:
    ans="Negative"
else:
    ans="Positive"
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import numpy
l=[]
a, b = map(int, input().split())
for i in range(a, b+1):
    l.append(i)
a=numpy.prod(l)
if a==0:
    ans="Zero"
elif a<0:
    ans="Negative"
else:
    ans="Positive"
print(ans)

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
for i in range (a,b):
  a *= i
if a < 0 :
  print("Negative")
elif a==0:
  print("Zero")
elif a> 0:
  print("Positive")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
for i in range(a, b):
  a *= i
if a < 0 :
  print("Negative")
elif a == 0:
  print("Zero")
else:
  print("Positive")

Submission status: Time Limit Exceeded

Solution code:
a,b = map(int, input().split())
L = []
for i in range (a,b+1):
  L.append(i)
P = 1
for j in L:
  P *= j
if P > 0:
  print('Positive')
elif P == 0:
  print('Zero')
else:
  print('Negative')

Submission status: Time Limit Exceeded

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

for i in range(a, b + 1):
    ans = ans * i

if ans > 0:
    print("Positive")
elif ans == 0:
    print("Zero")
elif ans < 0:
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
K=1
for i in range(a,b+1):
    K*=i
if K>0:
    print('Positive')
elif K<0:
    print('Negative')
else:
    print('Zero')

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
    if i==0:
        print('Zero')
        exit()
    c*=i

if c>0:
    print('Positive')
else:
    print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
    c*=i

if c>0:
    print('Positive')
elif c==0:
    print('Zero')
else:
    print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
ans=1
for i in range(a,b+1):
  ans*=i
if ans>0:
  print('Positive')
elif ans<0:
  print('Negative')
else:
  print('Zero')

Submission status: Time Limit Exceeded

Solution code:
a,b = map(int,input().split())
A = [i for i in range(a,b+1)]
if a > 0:
    print('Positive')
elif 0 in A:
    print('Zero')
elif len(A)%2 == 0:
    print('Positive')
else:
    print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
ans = 1
B = b + 1

for i in range(a, B):
    ans *= i

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
elif ans == 0:
    print("Zero")

Submission status: Time Limit Exceeded

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

ans = 1

for i in range(a,b+1):
  ans *= i
  
if ans > 0:
  print('Positive')
  
elif ans==0:
  print('Zero')
  
else:
  print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
p = 1
for i in range(a, b + 1):
    p *= i
if p > 0:
    print("Positive")
elif p == 0:
    print("Zero")
else:
    print("Negative")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
num = 1
for i in range(a, b+1):
    num *= i

if num == 0:
    print('Zero')
elif num < 0:
    print('Negative')
else:
    print('Positive')

Submission status: Time Limit Exceeded

Solution code:
a,b = map(int, input().split())
ans = 1
for i in range(a,b+1):
    ans*=i
print('Positive' if ans>0 else 'Zero' if ans == 0 else 'Negative')

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
a, b = map(int, input().split())
c = [i for i in range(a, b+1)]

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

Submission status: Time Limit Exceeded

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

while True:
    p *= a
    a += 1

    if b < a:
        break

if 0 < p:
    print('Positive')
elif p < 0:
    print('Negative')
else:
    print('Zero')

Submission status: Time Limit Exceeded

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

sum = 1

for i in range(a,b+1):
    
    sum = sum*i

if sum < 0:
    print("Negative")
elif sum ==0:
    print("Zero")
else:
    print("Positive")

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int, input().split())
ans=1
if a <= 0 and b >= 0:
  print('Zero')
  exit(0)
for i in range(a, b+1):
  ans = ans*i
if ans>0:
  print('Positive')
else:
  print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int, input().split())
ans=1
for i in range(a, b+1):
  ans = ans*i
if (ans==0):
  print('Zero')
elif ans>0:
  print('Positive')
else:
  print('Negative')

Submission status: Time Limit Exceeded

Solution code:
x,b = map(int,input().split())
for i in range(x+1,b+1):
    x=x*i
if x>0:
    print("Positive")
elif x<0:
    print("Negative")
elif x==0:
    print("Zero")

Submission status: Time Limit Exceeded

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()
    a_to_b = [i for i in range(a,b+1)]
    if 0 in a_to_b:
        print('Zero')
        return None
    neg = [i for i in a_to_b if i < 0]
    if len(neg)%2 == 0:
        print('Positive')
    else:
        print('Negative')

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys
import numpy as np
input = sys.stdin.buffer.readline
a,b=map(int,input().split())
L=[i for i in range(a,b+1)]
L1=np.array(L)
L2=np.prod(L1)
print("Positive" if L2>0 else "Zero" if L2==0 else "Negative")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
lst = [i for i in range(a, b + 1)]

ans = ""
if a < 0 and b > 0:
    ans = "Zero"
elif a > 0:
    ans = "Positive"
else:
    ans = "Positive" if len(lst) % 2 == 0 else "Negative"

print(ans)

Submission status: Time Limit Exceeded

Solution code:
def sign(x):
    return (x > 0) - (x < 0)

a, b = map(int, input().split())
lst = [sign(i) for i in range(a, b + 1)]

num = 1
for l in lst:
    num *= int(l)

ans = ""
if num > 0:
    ans = "Positive"
elif num < 0:
    ans = "Negative"
else:
    ans = "Zero"
print(ans)

Submission status: Time Limit Exceeded

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

if 0 in c:
    print('Zero')
elif len([k for k in c if k < 0]) % 2 == 0:
    print('Positive')
else:
    print('Negative')

Submission status: Time Limit Exceeded

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

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

minus = 0
for i in range(a, b+1):
    if i < 0:
        minus += 1

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

Submission status: Time Limit Exceeded

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()

cnt = 0
for i in range(min(a,b),max(a,b)+1):
    if i<0:
        cnt += 1

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

Submission status: Time Limit Exceeded

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

lis = [i for i in range(a,b+1)]

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

Submission status: Time Limit Exceeded

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

lis = [i for i in range(a,b+1)]

if a>0 and b>0:
  print("Positive")
  exit()
elif a<=0 and b>=0:
  print("Zero")
  exit()

cnt = 0
for i in lis:
  if i<0:
    cnt +=1
  else:
    break
    
if cnt%2==0:
  print("Positive")
else:
  print("Negative")

Submission status: Time Limit Exceeded

Solution code:
from functools import reduce 

ans=1
a,b=map(int,input().split())
if a<0 and b>0:
    print ("Zero")
else:
    ans=reduce((lambda x, y: x * y), range(a,b+1)) 
    if ans>0:
        print ("Positive")
    else:
        print ("Negative")

Submission status: Time Limit Exceeded

Solution code:
ans=1
a,b=map(int,input().split())
if a<0 and b>0:
    print ("Zero")
else:
    for i in (range(a,b+1)):
        ans*=i
    if ans>0:
        print ("Positive")
    else:
        print ("Negative")

Submission status: Time Limit Exceeded

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

for i in range(a,b+1):
  num+=1
  
if a>0 and b>0 or a<0 and b<0 and num%2==0:
  print("Positive")
  
elif a<0 and b<0 and num%1==0 or a<0 and b<0:
  print("Negative")
  
else:
  print("Zero")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
ans=1
for i in range(a,(b+1)):
	ans*=i
if(ans>0):
	print('Positive')
elif(ans<0):
	print('Negative')
elif(ans==0):
	print('Zero')

Submission status: Time Limit Exceeded

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

for i in range(a,b+1):
  ans*=i

print("Positive" if ans>0 else "Negative"if ans<0 else "Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = [int(i) for i in input().split()]
if 0 <= a and 0 >= b:
    print('Zero')
    exit()
if a > 0:
    print('Positive')
    exit()
c = b
while a != b:
    c *= a
    a += 1
print('Positive' if c > 0 else 'Zero' if c == 0 else 'Negative')

Submission status: Time Limit Exceeded

Solution code:
a, b = [int(i) for i in input().split()]
c = b
while a != b:
    c *= a
    a += 1
print('Positive' if c > 0 else 'Zero' if c == 0 else 'Negative')

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
count=0
if a<=0 and b>=0:
    print('Zero')
else:
    for i in range(a,b+1):
        if i<0:
            count+=1
    if count%2==1:
        print('Negative')
    else:
        print('Positive')

Submission status: Time Limit Exceeded

Solution code:
a,b = map(int,input().split())
if a <= 0 and b >= 0:
    print('Zero')
else:
    cnt = len([1 for i in range(a,b+1) if i < 0])
    if cnt % 2 == 0:
        print('Positive')
    else:
        print('Negative')

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
ans = 1
for i in range(a,(b+1)):
    ans = ans*i

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
ans = []
c = 0
for i in range(a,b+1):
    ans.append(i)
    if i < 0:
        c += 1

if ans.count(0) == 1:
    print("Zero")
elif c % 2 != 0:
    print("Negative")
else:
    print("Positive")

Submission status: Time Limit Exceeded

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

for i in range(a,b+1):
    ans.append(i)

if ans.count(0) == 1:
    print("Zero")
    exit()

c = 0

for i in ans:
    if i < 0:
        c += 1

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

Submission status: Time Limit Exceeded

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

for i in range(a, b+1):
    ans *= i
    if ans == 0:
        break

if ans > 0: print('Positive')
elif ans < 0: print('Negative')
else: print('Zero')

Submission status: Time Limit Exceeded

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

for i in range(a, b+1):
    ans *= i
if(ans != 0):
    print("Positive" if ans > 0 else "Negative")
else:
    print("Zero")

Submission status: Time Limit Exceeded

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

A = 1

for i in range(a,b+1):
  A *= i

if A == 0:
  print("Zero")
elif A > 0:
  print("Positive")
else:
  print("Negative")