input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(eval(input()))
... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(eval(input()))
... | p02660 |
from collections import deque
n = int(eval(input()))
def factorization(n):
retval = []
tmp = n
for i in range(2, int(-(-n**.5//1))+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
retval.append([i, ... | n = int(eval(input()))
def factorization(n):
retval = []
tmp = n
for i in range(2, int(-(-n**.5//1))+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
retval.append([i, cnt])
if tmp != 1:
... | p02660 |
# coding: utf-8
# Your code here!
import bisect
line=[i*(i+1)//2 for i in range(10**7+1)]
N=int(eval(input()))
if N==1:
print((0))
exit()
do=[0 for i in range(10**6+1)]
for i in range(2,int(N**0.5)+1):
while N%i==0:
N/=i
do[i]+=1
ans=0
judge=True
for _,item in en... | # coding: utf-8
# Your code here!
import bisect
line=[i*(i+1)//2 for i in range(10**6+1)]
N=int(eval(input()))
do=[0 for i in range(10**6+1)]
for i in range(2,int(N**0.5)+1):
while N%i==0:
N/=i
do[i]+=1
ans=0 if N==1 else 1
for _,item in enumerate(do):
index=(bisect.bis... | p02660 |
# -*- coding: utf-8 -*-
import collections
# factrize
def factorize(target_number):
factor = 2
factor_list = []
while factor * factor <= target_number:
while target_number % factor == 0:
target_number //= factor
factor_list.append(factor)
factor += 1
if... | # -*- coding: utf-8 -*-
import collections
# factrize
def factorize(target_number):
factor_list = []
while target_number % 2 == 0:
factor_list.append(2)
target_number //= 2
factor = 3
while factor * factor <= target_number:
while target_number % factor == 0:
... | p02660 |
import math
import sys
from collections import Counter
N = int(eval(input()))
Ns = N
Nso = []
i = 0
if N == 1:
print((0))
sys.exit()
Nruto = math.sqrt(N)
Nruto = math.floor(Nruto)
# 素因数分解していきますpart2
for i in range(2, Nruto+1):
while N % i == 0:
N = N//i
Nso.append(i)
... | from collections import Counter
import sys
import math
N = int(eval(input()))
M = N
Nso = []
Nruto = math.sqrt(N)
Nruto = math.ceil(Nruto)
for i in range(2, Nruto+1):
while N % i == 0:
N = N//i
Nso.append(i)
if N == 1:
break
Nruto = math.sqrt(N)
Nruto = math.floor(... | p02660 |
#-------------------------------------------------------------------
import sys
def p(*_a):
_s=" ".join(map(str,_a))
#print(_s)
sys.stderr.write(_s+"\n")
#-------------------------------------------------------------------
import math
def factorize(n):
ret, a = [], n
for i in range(2, int(n**0.5)+... | #-------------------------------------------------------------------
import sys
def _p(*_a):
_s=" ".join(map(str,_a))
#print(_s)
sys.stderr.write(_s+"\n")
#-------------------------------------------------------------------
import math
def factorize(n):
ret, a = [], n
for i in range(2, int(n**0.5)... | p02660 |
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
N = int(eval(input()))
def prime_factorize(n):
ret = []
for i in range(2, int(n ** (1 / 2)) + 1):
if i > n:break
while n % i == 0:
n //= i
ret.append(i)
if n != 1:
ret.append(n)
... | import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
def prime_factorize(n):
ret = []
for i in range(2, int(n ** (1 / 2)) + 1):
if i > n:break
cnt = 0
while n % i == 0:
n //= i
cnt += 1
if cnt > 0:
ret.append((i, cnt))
if n != 1:
... | p02660 |
import math
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
nf2 = 0
while n % 2 == 0:
nf2 += 1
n //= 2
if nf2 != 0:
ret[2] = nf2
nf3 = 0
while n % 3 == 0:
nf3 += 1
n //= 3
if nf3 != 0:
ret[3] = nf3
# n = append_fact... | import math
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
nf2 = 0
while n % 2 == 0:
nf2 += 1
n //= 2
if nf2 != 0:
ret[2] = nf2
nf3 = 0
while n % 3 == 0:
nf3 += 1
n //= 3
if nf3 != 0:
ret[3] = nf3
# n = append_fact... | p02660 |
from math import floor, sqrt
def func(x):
return floor((sqrt(1 + 8 * x) - 1) / 2)
N = int(eval(input()))
limit = floor(sqrt(N))
primes = [2]
count = 0
flag = True
p = 2
while 1:
#print(p,N)
isprime = True
if N == 1:
break
if p > sqrt(N):
count += 1
... | from math import floor, sqrt
def func(x):
return floor((sqrt(1 + 8 * x) - 1) / 2)
N = int(eval(input()))
limit = floor(sqrt(N))
primes = [2]
count = 0
flag = True
p = 2
while 1:
#print(p,N)
isprime = True
if N == 1:
break
if p > sqrt(N):
count += 1
... | p02660 |
def f(exponent):
#reurns how many times a prime raised to exponent can be used
step = 1
cumul = 0
count = 0
while( cumul <= exponent):
cumul += step
count +=1
step +=1
return count - (1 if cumul > exponent else 0)
def answer(n):
if n == 1: return 0
res = 0
on = n
p = True
for d in rang... | def f(exponent):
#reurns how many times a prime raised to exponent can be used
step = 1
cumul = 0
count = 0
while( cumul <= exponent):
cumul += step
count +=1
step +=1
return count - (1 if cumul > exponent else 0)
def answer(n):
if n == 1: return 0
res = 0
for d in range(2, int(n ** 0.5) +... | p02660 |
use_list = []
def make_prime(n):
array = {}
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt = cnt + 1
temp = temp // i
array[i] = cnt
if temp != 1:
a... | import math
import sys
from collections import Counter
import time
N = int(eval(input()))
Ns = N
def create_sosu(n, max, Nso):
for i in range(2, max+1):
if n % i == 0:
while n % i == 0:
n = n // i
Nso.append(i)
return create_sosu(n,... | p02660 |
def sieve(x):
"""
Sieve of Eratosthenes
:param x: max value
:return: list of bool
"""
is_prime = [True] * (x + 1)
is_prime[0] = is_prime[1] = False
for i in range(2, x + 1):
if is_prime[i]:
for j in range(i * 2, x + 1, i):
is_prime[j] = ... | from collections import defaultdict
def sieve(x):
"""
Sieve of Eratosthenes
:param x: max value
:return: list of bool
"""
is_prime = [True] * (x + 1)
is_prime[0] = is_prime[1] = False
for i in range(2, x + 1):
if is_prime[i]:
for j in range(i * 2, x... | p02660 |
def sieve(x):
"""
Sieve of Eratosthenes
:param x: max value
:return: list of bool
"""
is_prime = [True] * (x + 1)
is_prime[0] = is_prime[1] = False
for i in range(2, x + 1):
if is_prime[i]:
for j in range(i * 2, x + 1, i):
is_prime[j] = ... | from math import sqrt
from collections import defaultdict
n = int(eval(input()))
d = defaultdict(int)
for i in range(2, int(sqrt(n)) + 10):
while n % i == 0:
d[i] += 1
n //= i
if n != 1:
d[n] += 1
ans = 0
for v in list(d.values()):
mn = 1
while v >= mn:
v -=... | p02660 |
import math
n = int(eval(input()))
prime = []
insu = {}
for i in range(2, math.ceil(math.sqrt(n))):
if i > n:
break
flag = 0
for p in prime:
if i%p == 0:
flag = 1
break
if flag == 0:
prime.append(i)
while n%i == 0:
if i i... | import math
n = int(eval(input()))
prime = []
insu = {}
max_itr = math.ceil(math.sqrt(n))+1
try_range = [2] + list(range(3, max_itr, 2))
for i in try_range:
if i > max_itr:
break
if n%i == 0:
flag = 0
for p in prime:
if i%p == 0:
flag = 1
... | p02660 |
n = int(eval(input()))
def factorization(n):
arr = []
if n == 1:
return arr
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
... | n = int(eval(input()))
def factorization(n):
arr = []
if n == 1:
return arr
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i== 0:
cnt += 1
temp //= i
arr.append([i,... | p02660 |
# Import
from collections import deque
# I/O
def read(): return eval(input())
def read_int(): return int(eval(input()))
def read_array(type=int): return list(map(type, input().split()))
def read_tupple(type=None):
tmp = input().split()
if type is None: return list(map(int, tmp))
assert len(tmp) =... | # Import
from collections import deque
import math
# I/O
def read(): return eval(input())
def read_int(): return int(eval(input()))
def read_array(type=int): return list(map(type, input().split()))
def read_tupple(type=None):
tmp = input().split()
if type is None: return list(map(int, tmp))
asse... | p02660 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | p02660 |
def d_div_game():
N=int(eval(input()))
def prime_factorization_dict(n):
"""nを素因数分解したときの素数とその指数の辞書"""
from collections import defaultdict
if n == 1:
return {2: 0} # 1は素数の0乗の積とみなす
i, table = 2, defaultdict(int)
while i**2 <= n:
while n % ... | def d_div_game():
def prime_factorization_dict(n):
"""n を素因数分解したときの素数とその指数の辞書"""
from collections import defaultdict
if n == 1:
return {2: 0} # 1 は素数の 0 乗の積とみなす
i, table = 2, defaultdict(int)
while i**2 <= n:
while n % i == 0:
... | p02660 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[... | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[... | p02660 |
import sys
from collections import defaultdict
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_factorize(n):
a = defaultdict(int)
while n % 2 == 0:
a[2] += 1
n //= 2
f = 3
while ... | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
... | p02660 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
... | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
... | p02660 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
... | import collections
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
n = int(... | p02660 |
def prime_decomposition(n):
i = 2
table = []
while i * i <= n:
while n % i == 0:
n //= i
table.append(i)
i += 1
if n > 1:
table.append(n)
return table
from itertools import groupby
N = int(eval(input()))
P = prime_decomposition(N)
ans =... | from itertools import groupby
n =int(eval(input()))
def prime_decomposition(n):
i = 2
table = []
while i * i <= n:
while n%i == 0:
n //= i
table.append(i)
i += 1
if n > 1:
table.append(n)
return table
from itertools import groupby
ans = 0
p = prime_decomposition(n)
... | p02660 |
import sys
sys.setrecursionlimit(10000)
input = sys.stdin.readline
def f(v, vs):
kminmax = 0
r = 0
rkoma = 0
fff = 0
ffmx = 0
for u in d[v]:
if u in vs:
continue
vs.add(u)
k1, koma, ff = f(u, vs)
if k1 > kminmax:
kminmax = ... | import sys
sys.setrecursionlimit(10000)
input = sys.stdin.readline
def f(v, vs):
kminmax = rkoma = fff = ffmx = 0
for u in d[v]:
if u in vs:
continue
vs.add(u)
k1, koma, ff = f(u, vs)
if k1 > kminmax:
kminmax, ffmx = k1, ff
rkoma += k... | p03021 |
N=int(eval(input()))
S=list(map(int,input().split()))
lenS=len(S)
T=[]
for i in range(1,N+1):
T.append(abs(i-(N+1-i)))
T.sort()
S.sort()
for i in range(N):
if T!=S:
print((0))
exit()
ans=1
nagasa=lenS//2
for i in range(nagasa):
ans=(ans*2)%(10**9+7)
print(... | N=int(eval(input()))
S=list(map(int,input().split()))
lenS=len(S)
T=[]
for i in range(1,N+1):
T.append(abs(i-(N+1-i)))
T.sort()
S.sort()
for i in range(N):
if T[i]!=S[i]:
print((0))
exit()
ans=1
nagasa=lenS//2
for i in range(nagasa):
ans=(ans*2)%(10**9+7)
... | p03846 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
f=1
for i in range(n):
if i%2==n%2 and i+1!=a[i] or i%2==(n+1)%2 and i!=a[i]:
f=0
break
if f==0:print((0))
else:print(((2**(n//2))%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
A=(2**(n//2))%(10**9+7)
for i in range(n):
if i%2==n%2 and i+1!=a[i] or i%2==(n+1)%2 and i!=a[i]:
A=0
break
print(A) | p03846 |
N = int(eval(input()))
line = list(map(int, input().split()))
n = N - 1
ans = 1
while(len(line) >= 0):
c = line.count(n)
if (len(line) == 0):
print((ans % (10**9+7)))
break
if len(line) == 1 and line[0] == 0:
print((ans % (10**9+7)))
break
elif c != 2:
... | N = int(eval(input()))
line = list(map(int, input().split()))
n = N - 1
ans = 1
line.sort()
s = len(line)
index = s - 1
while(index > 1):
if line[index] == n and line[index-1] == n:
ans *= 2
n = n - 2
index = index - 2
else:
print((0))
break
if index == 1... | p03846 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
a_dict = {}
for v in a:
if v in a_dict:
a_dict[v] += 1
else:
a_dict[v] = 1
can = True
if n % 2 == 0:
possible_list = [i for i in range(1, n, 2)]
for k, v in list(a_dict.items()):
if v != 2 or k not in po... | n = int(eval(input()))
a = [int(i) for i in input().split()]
a_dict = {}
for v in a:
if v in a_dict:
a_dict[v] += 1
else:
a_dict[v] = 1
can = True
if n % 2 == 0:
possible_list = {i: True for i in range(1, n, 2)}
for k, v in list(a_dict.items()):
if v != 2 or k not... | p03846 |
import sys
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
if(n%2==0):
if(0 in a):
print((0))
sys.exit()
else:
num=0
for i in range(1,n,2):
if(a.count(i)==2):
num+=1
a.remove(i)
a.remove(i)
else:
print((0))
sys.exit(... | import sys
n=int(eval(input()))
a=list(map(int,input().split()))
lis=[0 for i in range(n)]
for i in a:lis[i]+=1
if(1):
if(lis[0]!=n%2):
print((0))
sys.exit()
num=0
for i in range(1,n):
if(i%2==n%2):
if(lis[i]!=0):
print((0))
sys.exit()
else:
if(lis[i]!=2... | p03846 |
n = int(eval(input()))
A = list(map(int,input().split()))
if n%2 == 0:
for i in range(1,n,2):
if not A.count(i) == 2:
print((0))
break
else:
print((2**(n//2)%(10**9+7)))
else:
if not A.count(0) == 1:
print((0))
else:
for i in range(2... | n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
if n%2 == 0:
for i in range(n):
if i%2 == 0:
if not A[i] == i+1:
print((0))
break
else:
if not A[i] == i:
print((0))
break
els... | p03846 |
N = int(input().strip())
A = list(map(int, input().strip().split()))
if N % 2 == 1:
if A.count(0) != 1:
print((0))
else:
if not all([A.count(i) == 2 for i in range(2, N, 2)]):
print((0))
else:
print((2 ** ((N - 1) // 2) % (10**9 + 7)))
else:
if not all([A.count(i) == 2 for i... | N = int(input().strip())
A = list(sorted(map(int, input().strip().split())))
if N % 2 == 0:
for i in range(0, N, 2):
if A[i] != A[i+1]:
print((0))
break
else:
print((2**(N // 2) % 1000000007))
else:
if A[0] != 0:
print((0))
else:
for i in range(1, N, 2):
if A[i]... | p03846 |
num = int(eval(input()))
mem = list(map(int, input().split()))
mod = 10 ** 9 + 7
flag = True
while 0 in mem:
mem.remove(0)
for i in mem:
if not mem.count(i) == 2:
flag = False
break
if flag:
print((int((2 ** (int(len(mem)) / 2) % mod))))
else:
print((0)) | num = int(eval(input()))
mem = list(map(int, input().split()))
dic = {}
mod = 10 ** 9 + 7
zeros = 0
flag = True
for i in range(num):
temp = mem[i]
if not temp == 0:
dic.setdefault(str(temp), 0)
dic[str(temp)] += 1
else:
zeros += 1
for key in dic:
if not dic[key] =... | p03846 |
n = int(eval(input()))
A = list(map(int, input().split()))
set_A = set(A)
ans = 1
if n%2==0:
for a_i in set_A:
if A.count(a_i)!=2:
ans = 0
break
else:
if A.count(0)!=1:
ans = 0
set_A.remove(0)
for a_i in set_A:
if A.count(a_i)!=2:
ans = 0
break
... | n = int(eval(input()))
A = list(map(int, input().split()))
set_A = set(A)
ans = 1
if n%2==0:
if n//2 != len(set(A)):
ans = 0
else:
if A.count(0)!=1:
ans = 0
set_A.remove(0)
if (n-1)//2 != len(set_A):
ans = 0
if ans!=0:
ans = 2**(len(set_A))
print((ans%(10**9+7))) | p03846 |
import sys
readline = sys.stdin.readline
def resolve():
N = int(eval(input()))
# A = input().replace(" ", "")
A = readline().rstrip().split()
import collections
counter = collections.Counter(A)
if N % 2 == 1:
if counter["0"] != 1:
print("0")
return
... | import sys
readline = sys.stdin.readline
def resolve():
N = int(eval(input()))
# A = input().replace(" ", "")
# A = readline().rstrip().split()
A = input().split()
import collections
counter = collections.Counter(A)
if N % 2 == 1:
if counter["0"] != 1:
print(... | p03846 |
import sys
readline = sys.stdin.readline
def resolve():
N = int(eval(input()))
# A = input().replace(" ", "")
# A = readline().rstrip().split()
A = input().split()
import collections
counter = collections.Counter(A)
if N % 2 == 1:
if counter["0"] != 1:
print(... | def resolve():
N = int(eval(input()))
# A = list(input().replace(" ", "")) -> WA
A = input().split() # -> AC
import collections
counter = collections.Counter(A)
if N % 2 == 1:
if counter["0"] != 1:
print("0")
return
for k, v in list(counter.items... | p03846 |
n=int(eval(input()))
ai=[int(x) for x in input().split()]
if (ai.count(0)==1 or ai.count(0)==0)and all([ai.count(i)==0 or ai.count(i)==2 for i in range(1,n)]):
nd=n//2
ans=1
for i in range(nd):
ans*=2
ans%=10**9+7
print(ans)
else:
print((0)) | n=int(eval(input()))
ai=[int(x) for x in input().split()]
#print(len(set(ai)), -(-n // 2))
if (ai.count(0)==0 or ai.count(0)==1) and len(set(ai))==-(-n//2):
ans=1
for i in range(n//2):
ans*=2
ans%=10**9+7
print(ans)
else:
print((0)) | p03846 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
mod = 10 ** 9 + 7
i = 0
res = 0
if N == 1:
if A[0] == 0:
print((1))
else:
print((0))
exit(0)
if N % 2 == 1:
res = 1
i = 1
if A[0] == A[1]:
print((0))
exit(0)
if A[0] == 1:
print((0))
exit(0)
... | N = int(eval(input()))
A = sorted(map(int,input().split()))
B = []
if N%2:
B = [0]
for i in range(N//2):
B += [(i + 1)*2]*2
else:
for i in range(N//2):
B += [i*2 + 1]*2
#print(A, B)
#print(B)
if A==B:
print((2**(N//2)%((10**9) + 7)))
else:
print((0))
| p03846 |
n=int(eval(input()))
a=list(map(int,input().split()))
flag=0
if n%2==0:
b=list(range(1,n,2))
for i in range(n//2):
if a.count(b[i])!=2:
print("0")
flag+=1
break
if n%2==1:
c=list(range(0,n,2))
for i in range(n//2):
if i==0:
... | n=int(eval(input()))
a=list(map(int,input().split()))
flag=0
A=a.sort()
num=[]
if n%2==0:
for i in range(1,n,2):
num.append(i)
num.append(i)
if n%2==1:
num=[0]
for i in range(2,n,2):
num.append(i)
num.append(i)
if num==a:
print((2**(n//2)%(10**9+7)))
... | p03846 |
n = int(eval(input()))
a = input().split()
int_a =[]
for i in range(len(a)):
int_a.append(int(a[i]))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2 ** syou
print((answer % ((10 ** 9) + 7)))
else:
print("0")
| n = int(eval(input()))
int_a = list(map(int, input().split()))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2 ** syou
print((answer % ((10 ** 9) + 7)))
else:
print("0")
| p03846 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
if n%2 == 0: # 人数が偶数の場合に不整合があるか確認
for i in range(0,n,2):
if a[i] != i+1 or a[i+1] != i+1:
print((0))
exit()
else: # 人数が奇数の場合に不整合があるか確認
if a[0] != 0: # 差分が0存在していることを確認
print((0))
exit()
else:
for i in range... | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
if n%2 == 0: # 人数が偶数の場合に不整合があるか確認
for i in range(0,n,2):
if a[i] != i+1 or a[i] != a[i+1]:
print((0))
exit()
else: # 人数が奇数の場合に不整合があるか確認
if a[0] != 0: # 差分が0存在していることを確認
print((0))
exit()
else:
for i in rang... | p03846 |
from collections import Counter
N = int( eval(input()))
A = Counter(list( map( int, input().split())))
Q = 10**9 + 7
ans = 1
for i in range(N-1, 0, -2):
if A[i] == 2:
ans *= 2
ans %= Q
else:
ans = 0
break
if N%2 == 1:
if A[0] != 1:
ans = 0
print(ans)
| from collections import Counter
N = int( eval(input()))
A = Counter(list( map( int, input().split())))
Q = 10**9 + 7
ans = 1
for i in range(N-1, 0, -2):
if A[i] == 1:
ans = 0
break
if N%2 == 1:
if A[0] != 1:
ans = 0
print((ans*pow(2,N//2,Q))) | p03846 |
import sys
n = int(eval(input()))
a = list(map(int, input().split()))
def beki(n):
ans = 1
for _ in range(int(n)):
ans = (ans * 2) % (10 ** 9 + 7)
return int(ans)
if n % 2 == 0:
i = 1
while True:
if i in a:
a.remove(i)
else:
print((... | n = int(eval(input()))
a = list(map(int, input().split()))
def beki(n):
ans = 1
for _ in range(int(n)):
ans = (ans * 2) % (10 ** 9 + 7)
return int(ans)
if n % 2 == 0:
hikaku = []
for i in range(1, n, 2):
hikaku += [i, i]
if sorted(a) == hikaku:
print((beki... | p03846 |
n=int(eval(input()));print(([0,2**(n//2)%(10**9+7)][sorted(map(int,input().split()))==[(i+n%2)//2*2+1-n%2for i in range(n)]])) | n=int(eval(input()));print(([0,pow(2,(n//2),(10**9+7))][sorted(map(int,input().split()))==[i+(i+n+1)%2for i in range(n)]])) | p03846 |
n=int(eval(input()));print(([0,pow(2,(n//2),(10**9+7))][sorted(map(int,input().split()))==[i+(i+n+1)%2for i in range(n)]])) | n=int(eval(input()));print(([0,2**(n//2)%(10**9+7)][sorted(map(int,input().split()))==[i+(i+n+1)%2for i in range(n)]])) | p03846 |
n=int(eval(input()))
#データを並び替える
rowdata=[int(i) for i in input().split()]
rowdata.sort()
#nが偶数の時
if n%2==0:
check=[]
a=1
for i in range(1,n,2):
check.append(i)
check.append(i)
if check==rowdata:
for i in range(int(n/2)):
a*=2
a=a%10000000... | n=int(eval(input()))
a=[int(i) for i in input().split()]
def somosomo(a):
ans=[]
if n%2==1:
ans.append(0)
for i in range(1,n//2+1):
ans.append(i*2)
ans.append(i*2)
b=sorted(a)
if b==ans:
return True
return False
else:... | p03846 |
mod = 10 ** 9 + 7
N = int(eval(input()))
A = [int(a) for a in input().split()]
# Nが偶数ならAiは全て奇数、Nが奇数なら Aiは全て偶数でなければならない,なぜなら、2x + Ai = N - 1を満たすxが自然数(非負整数)でなければならないから
# さらに、Nが奇数の時はfor i in range(0, N, 2) において 0が１個、それ以外のiが２個ずつ存在しなければならず(これはAiが全て偶数であることも満たしている)、
# Nが偶数の時はfor i in range(1, N, 2) において 全てのiが２個ずつ存在しなけれ... | mod = 10 ** 9 + 7
N = int(eval(input()))
A = [int(a) for a in input().split()]
A.sort()
if N % 2 != 0:
if A[0] == 0:
for i in range(2, N, 2):
if not (A[i] == i and A[i-1] == i):
print((0))
exit()
order_count = 2 ** ((N - 1) // 2) % mod
els... | p03846 |
import sys
from collections import Counter
MOD = 10 ** 9 + 7
n, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
if n & 1:
if c.get(0, 0) != 1:
print((0)); return
for i in range(1 + (n & 1), n, 2):
if c.get(i, 0) != 2:
print((0)); return
print((pow(2, n... | import sys
from collections import Counter
MOD = 10 ** 9 + 7
n, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
if n & 1:
if c[0] != 1:
print((0)); return
for i in range(1 + (n & 1), n, 2):
if c[i] != 2:
print((0)); return
print((pow(2, n // 2, MOD)))
... | p03846 |
n = int(eval(input()))
a = list(map(int,input().split()))
A = list(set(a))
flag = True
if n%2==0:
if a.count(0)>0:
flag=False
else:
for i in A:
if a.count(i)!=2:
flag=False
break
else:
if a.count(0)!=1:
flag=False
else:
A.pop(A.index(0))
for j in A:
... | n = int(eval(input()))
a = list(map(int,input().split()))
A = list(set(a))
flag = True
if n%2==0:
if a.count(0)>0 or len(A)!=len(a)//2:
flag=False
else:
if a.count(0)!=1 or len(A)!=len(a)//2+1:
flag=False
if flag==True:
print(((2**(n//2))%(10**9+7)))
else:
print((0)) | p03846 |
from collections import defaultdict
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
m = n % 2 == 0
cnt = defaultdict(int)
for a in A:
if (a % 2 == 0) == m:
print((0))
exit()
cnt[a] += 1
if cnt[a] > 2 or cnt[0] > 1:
print((0))
ex... | from collections import defaultdict
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
m = n % 2 == 0
cnt = defaultdict(int)
for a in A:
if (a % 2 == 0) == m:
print((0))
exit()
cnt[a] += 1
if cnt[0] > 1:
print((0))
exit(0)
del cnt[0]
f... | p03846 |
n = int(eval(input()))
l = list(map(int,input().split()))
s = 1
if n%2!=0:
l1 = [i for i in range(0,n,2)]
for i in l1:
a = l.count(i)
if ( (i==0 and a==1) or (i!=0 and a==2)):
s *= 2
else:
s = 0
break
else:
s //= 2
else:
l1 = [i for i in range(1,n,2)]
for i in... | n = int(eval(input()))
l = list(map(int,input().split()))
s = 1
if n%2!=0:
if l.count(0)!=1:
s =0
else:
l.remove(0)
if len(set(l))==(n-1)//2:
s = 2**((n-1)//2)
else:
s =0
else:
if len(set(l))==n//2:
s = 2**(n//2)
else:
s = 0
print((int(s)%(10**9+7)))
... | p03846 |
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
if N % 2 == 0:
for i in range(1, N, 2):
if A.count(i) != 2:
print((0))
exit()
else:
if A.count(0) != 1:
print((0))
exit()
for i in range(2, N, 2):
if A.count(i)... | N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
if N % 2 == 0:
# print(A[0:N:2])
# print(A[1:N+1:2])
if A[0:N:2] != A[1:N+1:2]:
print((0))
exit(0)
else:
if A[0] != 0:
print((0))
exit()
if A[1:N-1:2] != A[2:N:2]:
... | p03846 |
MOD = 1000000007
n = int(eval(input()))
l = list(map(int,input().split()))
a = {}
for i in l:
if i in a:
a[i] += 1
else:
a[i] = 1
cur = 1 if n % 2 == 0 else 0
ok = True
while cur < n:
x = 1 if cur == 0 else 2
if cur in a and a[cur] != x:
ok = False
brea... | MOD = 1000000007
n = int(eval(input()))
l = list(map(int,input().split()))
a = {}
for i in l:
if i in a:
a[i] += 1
else:
a[i] = 1
cur = 1 if n % 2 == 0 else 0
ok = True
while cur < n:
x = 1 if cur == 0 else 2
if not cur in a or a[cur] != x:
ok = False
b... | p03846 |
N = int(eval(input()))
A = list(map(int, input().split(' ')))
false_flag = 0
if N % 2 == 0:
count_ = 1
else:
if A.count(0) != 1:
false_flag = 1
count_ = 2
while count_ < N and false_flag == 0:
if A.count(count_) != 2:
false_flag = 1
count_ += 2
if false_flag == 0:
... | N = int(eval(input()))
A = list(map(int, input().split(' ')))
false_flag = 0
'''
if N % 2 == 0:
count_ = 1
else:
if A.count(0) != 1:
false_flag = 1
count_ = 2
while count_ < N and false_flag == 0:
if A.count(count_) != 2:
false_flag = 1
count_ += 2
'''
count_list =... | p03846 |
import sys
n=int(eval(input()))
array=[int(i) for i in input().split()]
if n%2==0:
sub=1
else:
sub=2
if array.count(0) != 1:
print((0))
sys.exit()
for i in range(sub,n,2):
if array.count(i) != 2:
print((0))
sys.exit()
print((2**int(n/2))) | import sys
n=int(eval(input()))
array=list(map(int, input().split()))
if not (0<=min(array) and max(array)<n):
print((0))
sys.exit()
if n%2==0:
if (n**2)/2 != sum(array):
print((0))
sys.exit()
else:
if (n**2-1)/2 != sum(array):
print((0))
sys.exit()
su... | p03846 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
s = 0
if n % 2 == 0:
b = [int(i) for i in range(n) if i % 2 == 1]
for i in b:
c = a.count(i)
if c != 2:
s = 1
break
ans = 2 ** len(b) % (10**9 + 7)
else:
b = [int(i) for i in range(n) if i % ... | n = int(eval(input()))
a = [int(i) for i in input().split()]
s = 0
b = 0
d = [0]*n
if n % 2 == 0:
for i in a:
d[i] += 1
for i in range(1,n,2):
if d[i] != 2:
s = 1
break
else:
b += 1
ans = 2 ** b % (10**9 + 7)
else:
for i in a:
... | p03846 |
N = int(eval(input()))
m = [2 * ((i - 1 + N % 2) // 2) + 1 - N % 2 for i in range(1, N + 1)]
for i, a in enumerate(sorted([int(a) for a in input().split()])):
if m[i] != a:
ret = 0
break
else:
ret = 2 ** (N // 2)
print((ret % (10 ** 9 + 7))) | N = int(eval(input()))
if [2 * ((i - 1 + N % 2) // 2) + 1 - N % 2 for i in range(1, N + 1)] == sorted([int(a) for a in input().split()]):
print(((2 ** (N // 2)) % (10 ** 9 + 7)))
else:
print((0)) | p03846 |
import collections
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
count = 0
if N == 1:
if A[0] == 0:
ans = 1
else:
print((0))
if N % 2 == 0:
for i in range(1, int(N/2)+1):
if A.count(i*2-1) == 2:
count += 1
else:
ans... | import collections
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
A = collections.Counter(A)
ans = 1
count = 0
if N == 1:
if A[0] == 1:
ans = 1
else:
ans = 0
elif N % 2 == 0:
for i in range(1, int(N/2)+1):
if A[i*2-1] == 2:
count += ... | p03846 |
N = int(eval(input()))
A = input().split()
X = [0] * (N // 2)
count = 0
num = 2 ** (len(A) - len(set(A)))
for a in A:
k = A.count(str(a))
if k == 2:
count += 1
else:
pass
K = 2 ** (count/2)
if A.count('0') == 2:
print((0))
elif K == num:
print((int(K)))
el... | N = int(eval(input()))
o, h = N%2, N//2
arr = [0]*h
for a in map(int, input().split()):
if a > 0:
arr[a//2 - o] += 1
if all(c == 2 for c in arr):
print(((1 << h) % (10**9 + 7)))
else:
print((0)) | p03846 |
N=int(eval(input()))
A=list(map(int,input().split()))
count=0
ans=1
if(N%2==0):
flag=True
for i in range(N//2):
try:
A.remove(2*i+1)
try:
A.remove(2*i+1)
count+=1
ans=(ans*2)%(10**9+7)
except:
flag=False
break
except:
flag=Fals... | N=int(eval(input()))
A=list(map(int,input().split()))
count=0
ans=1
A.sort()
if(N%2==0):
flag=True
for i in range(N):
if(i%2==0):
if(A[i]!=i+1):
flag=False
break
else:
if(A[i]!=i):
flag=False
break
else:
ans=(ans*2)%(10**9+7)
else:
... | p03846 |
import sys
imput=sys.stdin.readline
import collections
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
ans=1
if n%2==1 and collections.Counter(a)[0]==1:
for i in range(2,n,2):
if collections.Counter(a)[i]!=2:
print((0))
break
else:
ans=... | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
if n%2==1:
b=[i for i in range(2,n,2)]
b=b*2
b.sort()
#print(a,b)
b=[0]+b
if a==b:
print((2**(n//2)%(10**9+7)))
else:
print((0))
elif n%2==0:
b=[i for i in range(1,n,2)]
b=b*2
b.sort()
... | p03846 |
import sys
#計算量O(n/2)
N = int(eval(input()))
A = list(map(int,input().split()))
amari = 10**9 + 7
A.sort()
if N % 2 == 0:
for i in range(1,N,2):
if A.count(i) != 2:
print("0")
sys.exit()
else:
if A.count(0) != 1:
print("0")
sys.exit()
for i ... | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
amari = 10**9 + 7
ans = []
han = 0
if N % 2 == 0:
han = 1
else:
han = 0
A.insert(0,0)
ans = list(int(i) for i in range(han,N,2))
ans += ans
ans.sort()
if ans == A:
print((2**(N//2) % amari))
else:
print("0") | p03846 |
n = int(eval(input()))
a = list(map(int,input().split()))
sa = sorted(a)
if n % 2 == 0:
k = 1
l = 0
else:
k = 0
l = 1
a=1000000007
flag = True
for i,s in enumerate(sa):
if ((i+l)//2)*2+k != s:
flag = False
if flag:
print((2**(n//2) % a))
else:
print((0))
| n = int(eval(input()))
a = list(map(int,input().split()))
if n%2==0:
if sorted(a) != [(k//2)*2+1 for k in range(n)]:
print((0))
else:
ans = 2**(n//2)
print((ans % (10**9+7)))
else:
if sorted(a)!= [0]+[(k//2+1)*2 for k in range(n-1)]:
print((0))
else:
... | p03846 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
if N % 2 == 0:
for i in list(range(1, N, 2)):
if A.count(i) != 2:
ans = 0
break
else:
if A.count(0) == 1:
for i in list(range(2, N, 2)):
if A.count(i) != 2:
... | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
if N % 2 == 0:
if len(A) != 2*len(set(A)):
ans = 0
else:
if A.count(0) == 1:
A.remove(0)
if len(A) != 2*len(set(A)):
ans = 0
else:
ans = 0
if ans == 0:
print((0))
else:
prin... | p03846 |
import sys
import math
import itertools
import bisect
from copy import copy,deepcopy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def L(): retur... | import sys
import math
import itertools
import bisect
from copy import copy,deepcopy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def L(): retur... | p03846 |
n = int(eval(input()))
a = list(map(int,input().split()))
if n%2==0:
k = 0
else:
k = 1
if k==0:
for i in range(1,n,2):
if a.count(i)!=2:
print((0))
else:
print(((2**(n//2))%(10**9+7)))
else:
if a.count(0)!=1:
print((0))
else:
for i in... | n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a)
mod = 10**9+7
if n%2==0:
k = 0
else:
k = 1
if k==0:
for i in range(1,n,2):
if a[i]!=i or a[i-1]!=i:
print((0))
exit()
else:
print((2**(n//2)%mod))
else:
if a[0]!=0:
... | p03846 |
def inpl(): return input().split()
n = int(eval(input()))
a = sorted(list(map(int, inpl())))
p = 10 ** 9 + 7
ans = 1
i = (n - 1) % 2
j = 0
while (i + j) < n:
cnt = a.count(i + j)
if (j % 2 == 0):
if cnt != 2:
if not((cnt == 1) and (((i + j) == 0) or ((i + j) == (n - 1)))):
... | def inpl(): return input().split()
n = int(eval(input()))
a = sorted(list(map(int, inpl())))
p = 10 ** 9 + 7
if a[0] == 0:
st = 1
next_value = 2
else:
st = 0
next_value = 1
ans = 1
found = False
for i in range(st, n):
if (next_value == a[i]):
if found:
ne... | p03846 |
N=int(eval(input()))
A=[int(x) for x in input().split()]
if N%2==1:
if A.count(0)!=1:
print((0))
exit()
elif A.count(0)==1:
for i in range(1,N//2):
if A.count(2*i)==2:
pass
else:
print((0))
exit()
else... | N=int(eval(input()))
A=[int(x) for x in input().split()]
mod=10**9+7
A=sorted(A)
if N%2==0:
if all(A[i]==A[i+1] and A[0]==1 and A[1]==1 and A[i]-2==A[i-2] for i in range(2,N,2)):
print(((2**(N//2))%mod))
else:
print((0))
else:
if all(A[0]==0 and A[i]==A[i-1] and A[i]-2==A[i-2] an... | p03846 |
i=input
n=int(i())
print(([0,pow(2,n//2,10**9+7)][sorted(i().split(),key=int)==[str((j+n%2)//2*2+1-n%2)for j in range(n)]])) | i=input
n=int(i())
print(([0,pow(2,n//2,10**9+7)][sorted(map(int,i().split()))==[(j+n%2)//2*2+1-n%2for j in range(n)]])) | p03846 |
i=input
n=int(i())
print(([0,pow(2,n//2,10**9+7)][sorted(map(int,i().split()))==[(j+n%2)//2*2+1-n%2for j in range(n)]])) | i=input
n=int(i())
print(([0,pow(2,n//2,10**9+7)][sorted(map(int,i().split()))==[j+(j+n+1)%2for j in range(n)]])) | p03846 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
flag = True
if N % 2 == 1:
# 奇数個の場合、0,2,2,4,4,～みたいに並んでるはず
if A[0] == 0:
for i in range(1, N, 2):
if A[i] != i+1 or A[i+1] != i+1:
flag = False
break
if flag:
ans = 2**(N//2) % (10**9+7)
else... | N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9+7
if N % 2 == 1: # 0を2個にする
A.append(0)
A.sort()
od = tuple(A[::2])
ev = tuple(A[1::2])
# Ai と Biで、ある値の登場する回数が等しくなかった場合、明らかに答えは 0
if od == ev:
comb = (2**(N//2)) % MOD
print(comb)
else:
# 左右対称じゃなく報告と矛盾
print((0)) | p03846 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
sa=set(a)
f=True
if n%2==0:
if sa=={int(i) for i in range(1,n,2)}:
for i in range(1,n,2):
if a.count(i)!=2:
f=False
break
else:
f=False
else:
if a.count(0)==1:
for i in ... | n=int(eval(input()))
a=[int(i) for i in input().split()]
a.sort()
f=True
if n%2==0:
for i in range(n):
if a[i]!=i//2*2+1:
f=False
break
else:
for i in range(n):
if a[i]!=(i+1)//2*2:
f=False
break
print((2**(n//2)%(10**9+7) if f else 0... | p03846 |
N = int(eval(input()))
evenFlg = False
flg = False
lastIndex = int((N - (N % 2))/2)
if N % 2 == 0: evenFlg = True
ary = [2 for i in range(lastIndex)]
l = list(map(int, input().split()))
# for i in range(lastIndex):
# ary.append(2)
if not evenFlg: ary.insert(0, 1)
for r in range(N):
if evenFlg:
... | N = int(eval(input()))
A = list(map(int, input().split()))
ans = pow(2, N // 2)
# 0*1 2*2 4*2 2^N/2*2
check = [0 for p in range(0, N // 2 + N % 2)]
for o in A:
check[o // 2] += 1
for q in range(0, N // 2 + N % 2):
if q == 0 and N % 2 == 1:
if check[q] != 1:
ans = 0
b... | p03846 |
from functools import reduce
def main():
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
# 1e10
# 初期値用:十分小さい数(-100億)
# -1e10
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# スペース区切りで標準入力を配列として読み込み
# 入力:2 4 5 7
... | from functools import reduce
import bisect
def main():
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
# 1e10
# 初期値用:十分小さい数(-100億)
# -1e10
# mod用
p=10**9+7
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# ... | p03846 |
from functools import reduce
import bisect
def main():
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
# 1e10
# 初期値用:十分小さい数(-100億)
# -1e10
# mod用
p=10**9+7
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# ... | from functools import reduce
import bisect
def main():
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
# 1e10
# 初期値用:十分小さい数(-100億)
# -1e10
# mod用
p=10**9+7
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# ... | p03846 |
n = int(eval(input()))
a = list(map(int,input().split()))
if n%2 == 0:
for i in range(1,n//2+1):
if a.count(i*2-1) != 2:
print((0))
exit()
print((2**(n//2)))
else:
if a.count(0) != 1:
print((0))
exit()
for i in range(1,n//2):
if a.count(i*2) != 2:
print((0))
... | n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
m = 10**9+7
if n%2 == 0:
l = []
for i in range(1,n//2+1):
l.append(i*2-1)
l.append(i*2-1)
if a != l:
print((0))
exit()
print((2**(n//2) %m))
else:
l = [0]
for i in range(1,n//2+1):
l.append(i*2)
l.app... | p03846 |
N=int(eval(input()))
*A,=sorted(map(int,input().split()))
def f(x):
for i in range(x,N,2):
if A[i-1]!=i or A[i]!=i:
return 0
return 1
a=1
if N%2==0:a=f(1)
else:
if A[0]!=0:a=0
else:a=f(2)
print((2**(N//2)%(10**9+7)*a)) | N=int(eval(input()))
*A,=sorted(map(int,input().split()))
def f(x):
for i in range(x,N,2):
if A[i-1]!=i or A[i]!=i:
return 0
return 1
a=1
if N%2==0:a=f(1)
else: a=A[0]==0 and f(2)
print((2**(N//2)%(10**9+7)*a)) | p03846 |
N = int(eval(input()))
a = list(map(int,input().split()))
aa = dict.fromkeys(a)
f = 0
cnt = 0
for i in aa:
if i == 0:
if a.count(0) == 1:
continue
else:
f = 1
else:
if a.count(i) == 2:
cnt += 1
else:
f = 1
if f == 0:
print((pow(2, cnt)))
else:
print((... | mod = 1000000007
N = int(eval(input()))
a = list(map(int,input().split()))
data = [0]*N
for i in a:
data[i] += 1
cnt = 0
for i in range(1,len(data)):
if data[i] == 2:
cnt += 1
elif data[i] == 0:
continue
else:
print((0))
exit()
print((pow(2, cnt) %mod)) | p03846 |
def examC(mod):
N = I()
A = LI()
num = (N+1)%2
loop = (N+1)//2
cur = int(1)
if num==0:
A.append(0)
cur = cur/2
for i in range(loop):
if A.count(i*2+num)!=2:
cur = int(0)
break
cur = int(cur*2)%mod
print(cur)
i... | def examC(mod):
N = I()
A = LI()
num = (N+1)%2
loop = (N+1)//2
cur = int(1)
L = [0]*loop
if num==0:
L[0] +=1
for i in range(N):
L[A[i]//2] += 1
if L[A[i]//2]>=3:
cur = int(0)
break
for _ in range(N//2):
cur = (cur... | p03846 |
INFTY = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
if N%2==0:
flag = 0
for i in range(1,N,2):
if A.count(i)==2:
pass
else:
flag = 1
break
else:
flag = 0
for i in range(2,N,2):
if A.count(i)==2:
... | INFTY = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
if A[i] not in C:
C[A[i]] = 0
C[A[i]] += 1
if N%2==0:
flag = 0
for i in range(1,N,2):
if i in C and C[i]==2:
pass
else:
flag = 1
... | p03846 |
from functools import reduce
if __name__ == "__main__":
n = int(eval(input()))
a = [int(x) for x in input().split()]
x = [0]*n
if n % 2 == 0:
for i in a:
if i % 2 != 1:
print((0))
exit()
else:
for i in a:
if i % 2 ... | from functools import reduce
if __name__ == "__main__":
n = int(eval(input()))
a = [int(x) for x in input().split()]
x = [0]*n
"""if n % 2 == 0:
for i in a:
if i % 2 != 1:
print(0)
exit()
else:
for i in a:
if i % 2... | p03846 |
def read_input():
n = int(eval(input()))
alist = list(map(int, input().split()))
return n, alist
def possibility_check(n, alist):
occurs = {}
for a in alist:
if a in list(occurs.keys()):
occurs[a] += 1
else:
occurs[a] = 1
if n % 2:
... |
def read_input():
n = int(eval(input()))
alist = list(map(int, input().split()))
return n, alist
def possibility_check(n, alist):
alist.sort()
if n % 2:
even = [x for x in range(2, n) if x % 2 == 0]
comp = [0] + even + even
comp.sort()
else:
... | p03846 |
n = int(eval(input()))
a = list(map(int, input().split()))
if n % 2 == 0:
for i in range(n//2):
if not a.count(2*i+1) == 2:
print((0))
break
else: print((2**(n//2) % 1000000007))
else:
for i in range(1,n//2+1):
if not a.count(2*i) == 2:
print((0... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
if n % 2 == 1:
if a[0] != 0:
print((0))
else:
for i in range(2, n, 2):
if not i == a[i-1] == a[i]:
print((0))
break
else: print(((2**(n//2))%1000000007))
else:
... | p03846 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
import itertools
count = 0
check = tuple([int(abs((N-i+1)- i)) for i in range(1,N+1)])
import math
flag = True
for i in check[0:math.ceil(N/2)]:
if A.count(i) != 2 and i != 0:
flag = False
if A.count(i) != 1 and i == 0:
fl... | N = int(eval(input()))
A = [int(i) for i in input().split()]
import itertools
count = 0
check = [int(abs((N-i+1)- i)) for i in range(1,N+1)]
flag = sorted(A) == sorted(check)
if flag:
print((2 ** (N//2) % (10 ** 9 + 7)))
else:
print((0))
| p03846 |
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
num_map = [0] * ((n + 2 - 1) // 2)
for i in range(n):
num_map[a[i] // 2] += 1
res = 1
if n % 2 == 1:
if num_map[0] != 1:
print((0))
else:
for i in range(1, (n + 2 - 1) // 2):
if num_map[i] ... | n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
num_map = [0] * ((n + 2 - 1) // 2)
for i in range(n):
num_map[a[i] // 2] += 1
res = 2 - n % 2
if num_map[0] != 2 - n % 2:
print((0))
else:
for i in range(1, (n + 2 - 1) // 2):
if num_map[i] != 2:
p... | p03846 |
n=int(eval(input()))
a=list(map(int,input().split()))
if n%2==0:
for i in range(0,n,2):
if a.count(i+1)!=2:
print((0))
exit()
else:
if a.count(0)!=1:
print((0))
exit()
else:
for i in range(2,n,2):
if a.count(i)!=2:
print((0))
exit()
print((... | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
if n%2==0:
for i in range(0,n,2):
if a[i]!=i+1 or a[i+1]!=i+1:
print((0))
exit()
else:
if a[0]!=0:
print((0))
exit()
for i in range(2,n,2):
if a[i-1]!=i or a[i]!=i:
print((0))
exit()
... | p03846 |
N = int(eval(input()))
A = list(map(int,input().split()))
f = True
if N%2==0:
for i in range(1,N,2):
if A.count(i)!=2:
f = False
else:
for i in range(2,N,2):
if A.count(i)!=2:
f = False
if f:
print((pow(2,N//2,10**9+7)))
else:
print((0)) | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
if N%2==0:
B = [2*(i//2)+1 for i in range(N)]
else:
B = [2*(i//2) for i in range(1,N+1)]
if A==B:
print((pow(2,N//2,10**9+7)))
else:
print((0))
| p03846 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
flg = True
if N%2 == 0:
for i in range(1, N, 2): flg &= A.count(i) == 2
else:
flg &= A.count(0) == 1
for i in range(2, N+1, 2): flg &= A.count(i) == 2
print((2**(N//2) if flg else 0))
| N = int(eval(input()))
A = sorted([int(x) for x in input().split()])
flg = True
if N%2 == 0:
for i in range(0, N//2): flg &= A[2*i] == A[2*i+1] == 2*i+1
else:
flg &= A[0] == 0
for i in range(1, (N+1)//2): flg &= A[2*i-1] == A[2*i] == 2*i
def modpow(n, r, m):
if r == 0: return 1
if r%2 == 0: retu... | p03846 |
from collections import Counter
N = int(eval(input()))
src = list(map(int,input().split()))
ctr = Counter(src)
def valid():
if N%2:
if ctr[0] != 1: return False
i = 2
while i <= N:
if ctr[i] != 2: return False
i += 2
else:
i = 1
wh... | from collections import Counter
N = int(eval(input()))
src = list(map(int,input().split()))
ctr = Counter(src)
def is_valid(ctr):
if N%2:
if ctr[0] != 1:
return False
for i in range(2,N,2):
if ctr[i] != 2:
return False
else:
for i in ... | p03846 |
N = int(eval(input()))
A = list(map(int, input().split()))
if N % 2 == 0:
for i in range(1, N, 2):
if A.count(i) != 2:
print((0))
exit()
print((int((2 ** (N/2)) % (10*9 + 7))))
else:
for j in range(0, N, 2):
if j == 0:
if int(A.count(j)) != 1:... | N = int(eval(input()))
A = list(map(int, input().split()))
#if N % 2 == 0:
# for i in range(1, N, 2):
# if A.count(i) != 2:
# print(0)
# exit()
# print(int((2 ** (N/2)) % (10*9 + 7)))
#else:
# for j in range(0, N, 2):
# if j == 0:
# if int(A.count(j))... | p03846 |
from sys import exit
N = int(eval(input()))
A = list(map(int, input().split()))
if N % 2 == 0:
for i in range(N // 2):
if A.count(i * 2 + 1) != 2:
print((0))
exit()
else:
continue
print((int(2 ** (N / 2)) % (10 ** 9 + 7)))
else:
n = 0
if A... | N = int(eval(input()))
a = list(map(int, input().split()))
a_comb = []
mod = 10 ** 9 + 7
for i in range(N):
a_comb.append(abs(i - (N - 1 - i)))
if sorted(a_comb) == sorted(a):
print((2 ** (N // 2) % mod))
else:
print((0)) | p03846 |
import sys
N = int(eval(input()))
alist = list(map(int,input().split()))
flg = True
if N == 1:
if alist[0] == 0:
print((1))
else:
print((0))
sys.exit()
inf = 10 ** 9 + 7
if N % 2 == 0:
for i in range(N)[1::2]:
if alist.count(i) != 2:
flg = False
else:
... | import sys
N = int(eval(input()))
alist = list(map(int,input().split()))
flg = True
if N == 1:
if alist[0] == 0:
print((1))
else:
print((0))
sys.exit()
inf = 10 ** 9 + 7
alist.sort()
if N % 2 == 0:
for i in range(N)[1::2]:
if alist[i-1] != i or alist[i] != i:
... | p03846 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
b = [i for i in range(n)[::-1]]
e = all(d[i] == 2 if n % 2 == 0 else d[i] ==
1 if i == 0 else d[i] == 2 for i in b[::2])
if not e:
print((0))
exit()
a... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
b = [i for i in range(n)[::-1]]
if not all([d[i] == 2, d[i] == 1][n % 2 and i == 0] for i in b[::2]):
print((0))
else:
ans = 1
for v in list(d.values()):
... | p03846 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
b = [i for i in range(n)[::-1]]
if not all([d[i] == 2, d[i] == 1][n % 2 and i == 0] for i in b[::2]):
print((0))
else:
ans = 1
for v in list(d.values()):
... | N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
if N % 2 == 0:
if 0 in A or len(set(A)) != N//2:
flag = False
else:
if len([0 for a in A if a == 0]) != 1 or len(set(A)) != N//2+1:
flag = False
if flag:
print((2**(N//2) % (10**9+7)))
else:
print((0)) | p03846 |
from functools import reduce
INF = int(1e9+7)
def main():
N, *An = list(map(int, open(0).read().split()))
An.sort()
if N % 2:
if [0] + [i for i in range(2, N, 2) for j in range(2)] == An:
print((reduce(lambda x, y: (x << 1) % INF, list(range(N // 2)), 1)))
return
... | INF = int(1e9+7)
def main():
N, *An = list(map(int, open(0).read().split()))
An.sort()
if N % 2:
if [0] + [i for i in range(2, N, 2) for j in range(2)] == An:
print((2 ** (N // 2) % INF))
return
else:
if [i for i in range(1, N, 2) for j in range(2)] =... | p03846 |
n=int(eval(input()))
a=list(map(int,input().split()))
if n%2==1:
if a.count(0)==1 and all(a.count(2*i)==2 for i in range(1,n//2+1)):print((2**(n//2)%(10**9+7)))
else: print((0))
else:
if all(a.count(2*i+1)==2 for i in range(n//2)):print((2**(n//2)%(10**9+7)))
else: print((0)) | n=int(eval(input()))
a=sorted(list(map(int,input().split())))
if n%2==1:
if a[0]==0 and all(a[i]==2*((i+1)//2) for i in range(1,n)):print((2**(n//2)%(10**9+7)))
else: print((0))
else:
if all(a[i]==2*(i//2)+1 for i in range(n)):print((2**(n//2)%(10**9+7)))
else: print((0)) | p03846 |
from math import ceil
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
CA = Counter(A)
SCA = sorted(list(CA.items()), key=lambda x:x[0])
if len(CA) != ceil(N / 2):
print((0))
exit()
if N % 2 == 0:
for i, j in zip(SCA, list(range(ceil(N / 2)))):
if not... | n = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
A.sort()
if n % 2 == 0:
if A[::2] == A[1::2] == [i for i in range(1, n + 1, 2)]:
ans = 2 ** (n // 2)
else:
ans = 0
else:
if A == [0] or A[1::2] == A[2::2] == [i for i in range(2, n + 1, 2)]:
ans = 2 ** (n // 2)
... | p03846 |
n = int(eval(input()))
l = list(map(int, input().split()))
mod = 10**9 + 7
def f():
memo = {}
for i in l:
if i in memo:
memo[i] += 1
else:
memo[i] = 1
for k, v in list(memo.items()):
if k == 0 and not v == 1:
return 0
elif not k == 0 and not v == 2:
retu... | n = int(eval(input()))
l = list(map(int, input().split()))
mod = 10**9+7
if n % 2 == 0 and len(set(l)) == n//2:
print((2**(n//2)%mod))
elif not n % 2 == 0 and l.count(0) == 1:
print((2**((n-1)//2)%mod))
else:
print((0)) | p03846 |
import math
N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
if N%2 == 0:
if 0 in A or len(set(A)) != N//2:
flag = False
else:
if len([0 for a in A if a == 0]) != 1 or len(set(A)) != N//2 + 1:
flag = False
if flag:
print((2**(math.floor(N/2))%(10**9+7)))... | import math
N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
if N%2 == 0:
if 0 in A or len(set(A)) != N//2:
flag = False
else:
if len([0 for a in A if a == 0]) != 1 or len(set(A)) != N//2 + 1:
flag = False
if flag:
print((2**((N//2))%(10**9+7)))
else:
... | p03846 |
def resolve():
n = int(eval(input()))
S = list(map(int, input().split()))
if n % 2 == 0:
sum_a = (1 + max(S)) * (n // 2)
else:
sum_a = (2 + max(S)) * (n // 2)
if sum(S) == sum_a:
ans = pow(2, n // 2, (10 ** 9 + 7))
else:
ans = 0
print(ans)
if _... | def resolve():
n = int(eval(input()))
MOD = 10**9+7
S = list(map(int, input().split()))
if n % 2 == 0:
sn = (1 + (n-1)) * (n // 2)
else:
sn = (2 + (n-1)) * (n//2)
ss = sum(S)
print(((2**(n//2))%MOD if ss == sn else 0))
if __name__ == '__main__':
resolve... | p03846 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
if n%2==1:
dummy = [0]
for i in range(1, 1+(len(a)-1)//2):
dummy.append(2*i)
dummy.append(2*i)
if sorted(a) == dummy:
ans = 2**((len(a)-1)//2)
else:
dummy = []
for i in range(1, 1+(len(a))//2):
... | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
if len(a)%2==1:
tmp = [0]
for i in range((len(a)-1)//2):
tmp.append((i+1)*2)
tmp.append((i+1)*2)
if a == tmp:
ans = (2**((len(a)-1)//2))%(10**9+7)
else:
ans = 0
else:
tmp = []
for i ... | p03846 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.