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,input().split())

if a<0 and b<0:
    aa=a%2
    bb=b%2

    if (aa+bb)%2==1:
        print("Positive")
    else:
        print("Negative")
    exit()

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

if 0<a and 0<b:
    print("Positive")
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = tuple([int(j) for  j in input().split(' ')])

if N[1] == 0 or N[1] == 1:
    print("Zero")
elif N[0] > 0 and N[1] > 0:
    print("Positive")
elif N[0] < 0 and N[1] < 0:
    if (N[0] * - 1 - N[1] * - 1) % 2  == 0:
        print("Negative")
    else:
        print("Positive")
elif N[0] < 0 and N[1] > 1:
    print("Positive")

Submission status: Wrong Answer

Solution code:
SUM = 0
N = [int(j) for  j in input().split(' ')]
LIST = [j for j in range(N[0],N[1]+1)]

for i in range(1,len(LIST)):
    if SUM == 0:
        SUM = LIST[i-1] * LIST[i]
    else:
        SUM *= LIST[i]
if SUM < 0:
    print("Negative")
elif SUM > 0:
    print("Positive")
else:
    print("Zero")

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split()))
if a <= 0 <= b:  ### a と b の間に0を含む時
    print("Zero")
elif 0 < a <= b: ### a と b が正の場合
    print("Positive")
elif a <= b < 0: ### a と b が負の場合
    ### a と b の間に数字が偶数個なら正、奇数個なら負
    if b - a + 1 % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a < 0 and b < 0:
  for i in range(a,b+1):
    i += 1
  if i % 2 == 0:
    print('Positive')
  else:
    print('Negative')

elif a>0:
  print('Positive')

else:
  print('Zero')

Submission status: Wrong Answer

Solution code:
a,b = map(int,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, input().split())
zero = (a == 0 | b == 0) | (a < 0 and 0 < b) | (b < 0 and 0 < a)
negative_a = (a < 0 and 0 < b) and (a + b + 1) % 2 != 0
negative_b = (a < 0 | 0 < b) | (b < 0 | 0 < a)
if zero:
    print("Zero")
elif negative_a | negative_b:
    print("Negative")
else:
    print("Positive")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

elif a>0:
  if (b-a)%4==1 or (b-a)%4==2:
    ans ='Positive'
  else:
    ans = 'Negative'

elif a%2==1 and a<0:
  if (b-a)%4==0 or (b-a)%4==3:
    ans ='Positive'
  else:
    ans = 'Negative'

else:
  if (b-a)%4==1 or (b-a)%4==2:
    ans ='Positive'
  else:
    ans = 'Negative'
  
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
  print('Zero')
elif a > 0:
  print('Positive')
else:
  if a == b:
    print('Negative')
  elif (b - a) % 2:
    print('Negative')
  else:
    print('Positive')

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
  print('Zero')
elif a > 0:
  print('Positive')
else:
  if a == b:
    print('Netative')
  elif (b - a) % 2:
    print('Netative')
  else:
    print('Positive')

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
  print('Zero')
elif a > 0:
  print('Positive')
else:
  if a == b:
    print('Netative')
  elif b - a % 2:
    print('Netative')
  else:
    print('Positive')

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
  print('Zero')
elif a > 0:
  print('Positive')
else:
  if a == b:
    print('Netative')
  elif b - a % 2:
    print('Positive')
  else:
    print('Negative')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
  a, b = map(int,input().split())
  p, m = max(0,b-0), max(0,0-a)
  if abs(a) == b == 1:
    print("zero")
  elif m % 2 == 1:
    print("Negative")
  else:
    print("Positive")
  return 0
 
if __name__ == "__main__":
  solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


a, b = invr()
res = "Negative"


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

print(res)

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


a, b = invr()
res = "Negative"

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

print(res)

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


a, b = invr()
res = "Positive"

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

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


a, b = invr()
res = "Positive"

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())
if x*y > 0:
  print("Positive")
elif x*y < 0:
  print("Negative")
else:
  print("Zero")

Submission status: Wrong Answer

Solution code:
def resolve():
    a, b = map(int, input().split())
    if 0 in range(a, b+1):
        print('Zero')
    elif a >= 1 or len(range(a, 0)) % 2 == 0:
        print('Positive')
    else:
        print('Negative')

resolve()

Submission status: Wrong Answer

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

resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    a, b = map(int, input().split())
    if a >= 1:
        print('Positive')
    elif len(range(a, 0)) % 2 == 0:
        print('Positive')
    elif len(range(a, 0)) == 1:
        print('zero')
    else:
        print('Negative')

resolve()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=""):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)
###################################################
def main():
    a,b=map(int,input().split())
    if a<0 and b<0:
        print("Positive")
    elif a>0 and b>0:
        print("Positive")
    elif a<=0 and 0<=b:
        print("Zero")
main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=""):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)
###################################################
def main():
    a,b=map(int,input().split())
    if a<0 and b<0:
        print("Negative")
    elif a>0 and b>0:
        print("Positive")
    elif a<=0 and 0<=b:
        print("Zero")
main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a > 0:
    print('Positive')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, 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 > 0 and b > 0:
  print('Positive')
elif a == 0 or b == 0:
  print('0')
elif a * b < 0:
  print('0')
else:
  if (b - a) % 2 == 0:
    print('Negative')
  else:
    print('Positive')

Submission status: Wrong Answer

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 "Zero")

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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:
        print("Negative")

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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(0)
    else:
        if (b-a+1)%2 == 0:
            print('Positive')
        else:
            print('Negative')

if __name__ == '__main__':
    main()

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("Negetive")
else:
    print("Positive")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a * b <= 0:
    print("Zero")
elif b < 0:
    print("Negetive")
else:
    print("Positive")

Submission status: Wrong Answer

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-1+1
    if ans%2==0:
        print('Positive')
    else:
        print('Negative')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a*b>0:
    print("Positive")
elif a*b==0:
    print("Zero")
else:
    print("Negative")

Submission status: Wrong Answer

Solution code:
# from scipy.sparse import csr_matrix
# import string
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'
        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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a, b = map(int,input().split())

if b < 0:
    print("Negative")
elif 0 < a:
    print("Positive")
elif -1 * a == b:
    print("Zero")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m=input().strip("\n").split(" ")
a,b=int(m[0]),int(m[1])
if a>0:
    print("Positive")
elif b<0:
    if (b-a)%2:
        print("Negative")
    else:
        print("Positive")
else:
    print("Zero")

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b = MAP()

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