input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
for j in range(n):
if a[j] == i + 1:
b.append(str(j+1))
break
print((' '.join(b)))
| n = int(eval(input()))
a = list(map(int,input().split()))
b = [0 for i in range(n)]
for i in range(n):
b[a[i] - 1] = str(i + 1)
print((' '.join(b))) | p02899 |
n = int(eval(input()))
ai = list(map(int, input().split()))
ans = []
for i in range(1, n+1):
ans.append(ai.index(i)+1)
ans = list(map(str, ans))
print((" ".join(ans)))
| n = int(eval(input()))
ai = list(map(int, input().split()))
ans = [None]*n
for i in range(n):
ans[ai[i]-1] = i+1
ans = list(map(str, ans))
print((" ".join(ans)))
| p02899 |
n = int(eval(input()))
ans = ""
a = list(map(int,input().split()))
for i in range(n):
b = a.index(i+1)
ans += str(b+1)
if i != n-1:
ans += " "
print(ans) | n = int(eval(input()))
b = ""
ans = [0 for i in range(n)]
a = list(map(int,input().split()))
for i in range(n):
ans[a[i]-1] = i+1
for i in range(n):
b += str(ans[i])
if i != n-1:
b += " "
print(b) | p02899 |
N = int(eval(input()))
records = [(order, index + 1) for index, order in
enumerate(map(int, input().split(' ')))]
def get_index(record):
order, index = record
return str(index)
print((' '.join(map(get_index, sorted(records)))))
| N = int(eval(input()))
A = tuple(map(int, input().split(' ')))
A = [(a, index) for index, a in enumerate(A, start=1)]
print((' '.join([str(index) for _, index in sorted(A)])))
| p02899 |
N=int(eval(input()))
A=list(map(int,input().strip().split()))
B=[A.index(n)+1 for n in range(1,N+1)]
print((" ".join(list(map(str,B))))) | N=int(eval(input()))
A=list(map(int,input().strip().split()))
B=[-1 for n in range(N)]
for n in range(len(A)):
B[A[n]-1]=n+1
print((" ".join(list(map(str,B)))))
| p02899 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def main():
N = II()
A = LI()
order = [0]*N
for i,a in enumerate(A):
order[a-1] = i+1
ans = ""
for a in order:
ans += (str(a)+" ")
print(ans[:-1])
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def main():
N = II()
A = LI()
order = [0]*N
for i,a in enumerate(A):
order[a-1] = i+1
order = list(map(str,order))
print(" ".join(order))
main()
| p02899 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def main():
N = II()
A = LI()
order = [0]*N
for i,a in enumerate(A):
order[a-1] = i+1
order = list(map(str,order))
print(" ".join(order))
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
mo = 10**9+7
def main():
n = II()
a = LI()
ans=[]
for i,x in enumerate(a,1):
ans.append([i,x])
ans.sort(key=lambda x: x[1])
printH(row[0] for row in ans)
if __name__ == '__main__':
main()
| p02899 |
N = int(eval(input()))
A = list(map(int, input().split()))
answer = []
for i in range(N):
for j in range(N):
if A[j] == i+1:
answer.append(j+1)
print((' '.join(map(str, answer))))
| N = int(eval(input()))
A = list(map(int, input().split()))
B = {}
for i in range(N):
B[A[i]] = i+1
answer = sorted(B.items())
ac=[]
for i in range(N):
ac.append(answer[i][1])
print((' '.join(map(str, ac))))
| p02899 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a.index(i+1)+1)
print((' '.join(map(str,b)))) | n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(list(range(len(a))), key=lambda k: a[k])
for i in range(n):
b[i]+=1
print((' '.join(map(str,b)))) | p02899 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int , input().split()))
ans = [0]*n
cnt = 1
for i in a:
ans[i-1] =cnt
cnt += 1
print((" ".join(map(str,ans))))
if __name__=="__main__":
main()
| import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int , input().split()))
ans = [0]*n
for i, num in enumerate(a):
ans[num-1] = i+1
print((" ".join(map(str,ans))))
if __name__=="__main__":
main()
| p02899 |
n = int(eval(input()))
array = list(map(int, input().split()))
map = {}
for i in range(n):
map[array[i]] = str(i+1)
print((" ".join([map[i] for i in range(1, n+1)]))) | n = int(eval(input()))
array = list(map(int, input().split()))
map = {array[i]:str(i+1) for i in range(n)}
print((" ".join([map[i] for i in range(1, n+1)]))) | p02899 |
N = int(eval(input()))
A = list(map(int, input().split(" ")))
d = {}
for a in A:
d[A.index(a) + 1] = a
ans = [str(k) for k, _ in sorted(list(d.items()), key=lambda x: x[1])]
print((" ".join(ans)))
| N = int(eval(input()))
A = list(map(int, input().split(" ")))
d = dict(list(zip(list(range(N)), A)))
ans = [str(k + 1) for k, _ in sorted(list(d.items()), key=lambda x: x[1])]
print((" ".join(ans)))
| p02899 |
n = int(eval(input()))
nums = list(map(int, input().split()))
result = []
minNum = min(nums)
while(len(result) != n):
result.append(str(nums.index(minNum) + 1))
nums[nums.index(minNum)] = 10**5 + 1
minNum += 1
print(((" ").join(result))) | n = int(eval(input()))
nums = list(map(int, input().split()))
pairlist = []
for i in range(len(nums)):
pairlist.append([i, nums[i]])
sortedPairList = sorted(pairlist, key=lambda item: item[1])
result = []
for i in sortedPairList:
result.append(str(i[0]+1))
print((" ".join(result))) | p02899 |
N = int(eval(input()))
inputData = input().split()
A = [int(x) for x in inputData]
B = [0] * N
ans = ''
for i, num in enumerate(A):
B[num-1] = i + 1
for j in B:
ans = ans + ' ' + str(j)
print((ans[1:])) | N = int(eval(input()))
inputData = input().split()
A = [int(x) for x in inputData]
B = [0] * N
ans = ''
for i, num in enumerate(A):
B[num-1] = i + 1
print((' '.join(map(str, B)))) | p02899 |
_ = eval(input())
A = list(map(int, input().split()))
li = list()
for i, n in enumerate(A):
li.append((i + 1, n))
li.sort(key=lambda x: x[1])
ans = ""
for y in li:
ans = ans.__add__(str(y[0]) + " ")
print((ans.strip())) | _ = eval(input())
A = list(map(int, input().split()))
li = sorted( enumerate(A, 1), key=lambda x: x[1])
print((" ".join([str(i[0]) for i in li]))) | p02899 |
n = int(input())
h = [int(i) for i in input().split()]
num = []
for i in range(len(h)):
num += [h.index(i+1)+1]
print(*num, sep=" ")
| n = int(eval(input()))
h = [int(i) for i in input().split()]
num = [0 for i in range(n)]
for i in range(len(h)):
num[h[i]-1] = i+1
print((' '.join(map(str, num)))) | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
for i in range(1, n+1):
for j in range(0, n):
if a[j] == i:
ans.append(j+1)
print((' '.join(map(str, ans)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append([i, a[i]])
b = sorted(b, key=lambda x: x[1])
c = []
for k, v in b:
c.append(k+1)
print((' '.join(map(str, c)))) | p02899 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(1, n+1):
num = a.index(i)
b.append(num+1)
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
for i in range(0, n):
b[a[i]-1] = i + 1
print((' '.join(map(str, b)))) | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
result = sorted(zip(a, indices))
ans = "{}".format(result[0][1])
for i in range(n)[1::]:
ans += " {}".format(result[i][1])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
ans = list([str(x[1]) for x in sorted(zip(a, indices))])
print((" ".join(ans)))
| p02899 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = []
for i in range(1, n+1):
ans.append(str(a.index(i)+1))
print((' '.join(ans))) | n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = [0]*n
for i in range(n):
ans[a[i]-1] = str(i+1)
print((' '.join(ans))) | p02899 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
t = []
for i in range(N):
t.append(str(A.index(i + 1) + 1))
print((' '.join(t))) | N = int(eval(input()))
A = [int(i) for i in input().split()]
d = {v: str(k + 1) for k, v in enumerate(A)}
print((' '.join([v for _, v in sorted(d.items())]))) | p02899 |
n=int(eval(input()))
a=[int(_) for _ in input().split()]
ans=[]
for i in range(n):
m=min(a)
ans.append(str(a.index(m)+1))
a[a.index(m)]=10**6
print((' '.join(ans))) | n=int(eval(input()))
a=[int(_) for _ in input().split()]
ans=[0]*n
for i in range(n):
ans[a[i]-1]=i+1
print((' '.join(map(str,ans)))) | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
for i in range(1, n+1):
for j in range(n):
if a[j] == i:
ans.append(str(j+1))
print((" ".join(ans))) | n = int(eval(input()))
a = list(map(int, input().split()))
l = []
for i in range(n):
l.append([a[i], i+1])
l = sorted(l)
ans = []
for j in range(n):
ans.append(str(l[j][1]))
print((" ".join(ans))) | p02899 |
N = int(input())
A = list(map(int, input().split()))
dic = {i:0 for i in range(1, N + 1)}
for i in range(N):
a = A[i]
dic[a] = i + 1
for i in range(1, N + 1):
print(dic[i], end="")
if i != N:
print(" ", end="")
print()
| N = int(eval(input()))
A = list(map(int, input().split()))
a = [0] * N
for i in range(N):
a[A[i] - 1] = str(i + 1)
res = " ".join(a)
print(res) | p02899 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
print((" ".join([str(A.index(i)+1) for i in range(1,N+1)]))) | N = int(eval(input()))
A = ["0"]*N
for a,i in zip(input().split(), list(range(1,N+1))):
A[(int(a)-1)] = str(i)
print((" ".join(A))) | p02899 |
n = int(eval(input()))
an = [int(num) for num in input().split()]
answer = []
for index in range(1,len(an)+1):
answer.append(str(an.index(index)+1))
print((" ".join(answer))) | n = int(eval(input()))
an = [int(num) for num in input().split()]
answer = [0 for _ in range(n)]
for index in range(n):
answer[an[index] - 1] = str(index + 1)
print((" ".join(answer))) | p02899 |
a=int(eval(input()))
b=list(map(int,input().split()))
c=[]
for i in range(a):
c.append(b.index(i+1)+1)
result = ' '.join(map(str,c))
print(result) | a=int(eval(input()))
b=list(map(int,input().split()))
c=[0]*a
"""
for i in range(a):
c.append(b.index(i+1)+1) #おそらく計算量O(N^2)
"""
for i in range(a):
c[b[i]-1]=i+1
result = ' '.join(map(str,c))
print(result) | p02899 |
from operator import itemgetter
def main():
A = {k + 1: v for k, v in enumerate(map(int, open(0).read().split()[1:]))}
# value `昇順
print((" ".join([str(i[0]) for i in sorted(list(A.items()), key=itemgetter(1))])))
return
main()
| def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * N
for k, v in enumerate(A, 1):
ans[v - 1] = k
print((" ".join([str(a) for a in ans])))
return
main()
| p02899 |
def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * N
for k, v in enumerate(A, 1):
ans[v - 1] = k
print((" ".join([str(a) for a in ans])))
return
main()
| def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * N
for k, v in enumerate(A, 1):
ans[v - 1] = k
print((" ".join(map(str, ans))))
return
main()
| p02899 |
N=int(eval(input()))
A=list(input().split())
shusseki_jun=[' ' for _ in range(N)]
for i in range(N):
shusseki_jun[i] = str(A.index(str(i+1))+1)
print((' '.join(shusseki_jun)))
| N=int(eval(input()))
A=list(input().split())
shusseki_jun=[' ' for _ in range(N)]
for i in range(N):
ind = A[i]
shusseki_jun[int(ind)-1] = str(i+1)
print((' '.join(shusseki_jun)))
| p02899 |
n=int(eval(input()))
a=list(map(int,input().split()))
num=[i for i in range(1,n+1)]
order=dict(list(zip(num,a)))
order2=sorted(list(order.items()),key=lambda x:x[1])
ans=[]
for i in range(n):
ans.append(order2[i][0])
print((' '.join([str(n) for n in ans]))) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=['-']*n
for i in range(n):
ans[a[i]-1]=str(i+1)
print((' '.join(ans))) | p02899 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = list()
for i in range(1, N + 1):
ans.append(str(a.index(i) + 1))
print((' '.join(ans))) | N = int(eval(input()))
a = list(map(int, input().split()))
ans = [-1] * N
for i in range(N):
ai = a[i]
ans[ai - 1] = str(i + 1)
print((' '.join(ans))) | p02899 |
N=int(eval(input()))
A=list(map(int,input().split()))
l=len(A)
x=[]
for i in range(l):
m=A.index(min(A))
x.append(m+1)
A[m]=10**5+1
x=[str(a) for a in x]
L=' '.join(x)
print(L) | N=int(eval(input()))
A=list(map(int,input().split()))
L=[0]*N
for i in range(N):
L[A[i]-1]=i+1
L=[str(a) for a in L]
print((' '.join(L))) | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(1,n+1):
b.append(a.index(i)+1)
b =list(map(str,b))
print((" ".join(b))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
for i in range(n):
b[a[i]-1] = i+1
print((" ".join(map(str,b)))) | p02899 |
n = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
tmp = A.index(i+1)
ans[i] = tmp+1
print((' '.join([str(n) for n in ans]))) | n = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*n
for i,j in enumerate(A):
ans[j-1] = i+1
print((' '.join([str(n) for n in ans]))) | p02899 |
n = int(eval(input()))
a = [ int(i) for i in input().split()]
b = []
for i in range(1,n+1):
j = a.index(i)
b.append(str(j+1))
print((" ".join(b))) | n = int(eval(input()))
a = [ int(i) for i in input().split()]
b = [""] * n
for i, ai in enumerate(a):
b[ai-1] = str(i+1)
print((" ".join(b))) | p02899 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = [A.index(i)+1 for i in range(1,N+1)]
print((' '.join(map(str, ans))))
| N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*N
# ans = [A.index(i)+1 for i in range(1,N+1)]
for i in range(N):
ans[A[i]-1] = i+1
print((' '.join(map(str, ans))))
| p02899 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans=[str(a.index(i)+1) for i in range(1,n+1)]
print((" ".join(ans))) | n = int(eval(input()))
a = list(map(int,input().split()))
ans=[0]*n
for k,i in enumerate(a):
ans[i-1]=str(k+1)
print((" ".join(ans))) | p02899 |
N = int(eval(input()))
A = list(map(int, input().split()))
result = []
for i in range(1, N+1):
result.append(A.index(i) + 1)
print((' '.join(map(str, result))))
| N = int(eval(input()))
A = list(map(int, input().split()))
result = [0] * (N + 1)
for i in range(1, N+1):
result[A[i - 1]] = i
print((' '.join(map(str, result[1::]))))
| p02899 |
N = int(eval(input()))
A = list(map(int,input().split()))
print_str = ''
for i in range(N):
if i != N-1:
print_str += str(A.index(i+1)+1) + ' '
else:
print_str += str(A.index(i+1)+1)
print(print_str)
| N = int(eval(input()))
A = list(map(int,input().split()))
student = [0] * N
for i in range(N):
student[A[i]-1] = i + 1
print((' '.join(map(str, student)))) | p02899 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans =[]
for i in range(1,N+1):
AN = A.index(i)
ans.append(AN+1)
ans2 = [str(ans[i]) for i in range(len(ans))]
print((" ".join(ans2))) | N = int(eval(input()))
A = list(map(int,input().split()))
AN = list(enumerate(A))
sAN = sorted(AN, key=lambda x: x[1])
ans = []
for i in range(N):
ans.append(sAN[i][0]+1)
ans2 = [str(ans[i]) for i in range(len(ans))]
print((" ".join(ans2))) | p02899 |
def main():
n=int(eval(input()))
l=list(map(int,input().split()))
k=[0]*n
for i in range(1,n+1):
k[i-1]=str(l.index(i)+1)
print((" ".join(k)))
if __name__ == '__main__':
main() | def main():
n=int(eval(input()))
l=list(map(int,input().split()))
k=[0]*n
for i in range(1,n+1):
k[l[i-1]-1]=str(i)
print((" ".join(k)))
if __name__ == '__main__':
main() | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(1, n+1):
b.append(a.index(i)+1)
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
for i in range(n):
b[a[i]-1] = i+1
print((' '.join(map(str, b)))) | p02899 |
stdin = open(0).read().rstrip().split('\n')
N = int(stdin[0])
A = list(map(int,stdin[1].split()))
ans =[0]*N
for i in range(N):
ans[i] = A.index(i+1)+1
print((' '.join(map(str,ans)))) | stdin = open(0).read().rstrip().split('\n')
N = int(stdin[0])
A = list(map(int,stdin[1].split()))
ans =[0]*N
for i in range(N):
ans[A[i]-1] = i+1
print((' '.join(map(str,ans)))) | p02899 |
n = int(input())
al = list(map(int, input().split()))
l = []
for i in range(n):
l.append(al.index(i + 1) + 1)
print(*l, sep = ' ')
| n = int(input())
al = list(map(int, input().split()))
cl = []
for j in range(n):
cl.append([al[j], j + 1])
cl.sort()
bl = []
for i in range (n):
bl.append(cl[i][1])
print(*bl, sep=' ')
| p02899 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = ""
for i in range(1, n+1):
ans = ans + str(a.index(i)+1) + " "
print((ans.rstrip()))
| n = int(eval(input()))
a = list(map(int,input().split()))
ans = []
for i in range(1, n+1):
ans.append("")
for i in range(n):
tmp = i + 1
ans[a[i]-1] = str(tmp)
print((' '.join(ans)))
| p02899 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = []
for i in range(1, N+1):
ans.append(A.index(i)+1)
print((' '.join(map(str, ans)))) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0]*N
for i, a in enumerate(A):
ans[int(a-1)] = str(i+1)
print((' '.join(map(str, ans)))) | p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
for i in range(1, n+1):
ans.append(a.index(i) + 1)
print((' '.join(map(str,ans)))) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
ans[a[i] - 1] = i + 1
print((' '.join(map(str,ans)))) | p02899 |
n=int(eval(input()))
b=[]
a=list(map(int,input().split()))
for i in range(n):
b.append(str(a.index(i+1)+1))
print((' '.join(b))) | n=int(eval(input()))
b=['']*n
a=list(map(int,input().split()))
for i in range(n):
b[a[i]-1]=str(i+1)
print((' '.join(b))) | p02899 |
n = int(eval(input()))
h =list(map(int, input().split()))
a = []
for i in range(n):
a.append(i)
a[i] = i+1
for i in range (n-1):
for j in range(n-1, i ,-1):
if h[j] < h[j-1]:
tmp = h[j]
h[j] = h[j-1]
h[j-1] = tmp
tmp = a[j]
a[j] = a[j-1]
a[j-1] = tmp
# print(h)
print((' '.join(map(str, a)))) | n = int(eval(input()))
h_kari =list(map(int, input().split()))
h = []
for i in range(n):
h.append([h_kari[i],i+1])
h.sort()
ans = [h[i][1] for i in range(n)]
print((' '.join(map(str, ans))))
| p02899 |
n = int(eval(input()))
a = list(map(int, input().split()))
out = [""] * n
count = 0
out_str = ""
for i in range(n):
out_str += str(a.index(i + 1) + 1) + " "
print((out_str[:-1]))
| n = int(eval(input()))
a = list(map(int, input().split()))
out = [""] * n
out_str = ""
for i in range(n):
out[a[i] - 1] = str(i + 1)
out_str = " ".join(out)
print(out_str) | p02899 |
N = int(eval(input()))
As = list(map(int, input().split()))
ordList = []
for i in range(1,N+1):
ordList.append(str(As.index(i)+1))
print((' '.join(ordList))) | N = int(eval(input()))
As = list(map(int, input().split()))
ordList = [None] * N
noCount = 1
for i in As:
ordList[i-1] = str(noCount)
noCount += 1
print((' '.join(ordList))) | p02899 |
N=int(eval(input()))
L=list(map(int,input().split()))
R=list()
for i in range(1,N+1):
R.append(L.index(i)+1)
print((" ".join(list(map(str,R))))) | N=int(eval(input()))
L=list(map(int,input().split()))
R=[0]*N
for i in range(0,N):
R[L[i]-1]=i+1
print((" ".join(list(map(str,R))))) | p02899 |
# 2020/04/22
# AtCoder Beginner Contest 142 - C
# Input
n = int(eval(input()))
a = list(map(int,input().split()))
tbl = [-1] * (n+1)
# Calc
for i in range(n):
tbl[a[i]] = i+1
# Output
ans = str(tbl[1])
for i in range(2, n+1):
ans = ans + " " + str(tbl[i])
print(ans) | # 2020/04/22
# AtCoder Beginner Contest 142 - C
# Input
n = int(eval(input()))
a = list(map(int,input().split()))
tbl = [-1] * (n+1)
# Calc
for i in range(n):
tbl[a[i]] = i+1
tbl.pop(0)
# Output
print((' '.join(map(str, tbl))))
| p02899 |
N = int(input())
A = tuple(map(int, input().split()))
l = len(A)
for i in range(l):
print(A.index(i+1)+1, end='')
if i == l - 1:
print()
else:
print(' ', end='')
| N = int(input())
A = tuple(map(int, input().split()))
ans = []
for i, j in enumerate(A):
ans.append((j, i+1))
ans.sort()
for i, j in ans:
print(j, end='')
if i == len(ans):
print()
else:
print(' ', end='')
| p02899 |
A, B = list(map(int, input().split()))
if A == 1 and B == 13:
winner = "Alice"
elif A == 13 and B == 1:
winner = "Bob"
elif A > B:
winner = "Alice"
elif A < B:
winner = "Bob"
else:
winner = "Draw"
print(winner) | A, B = [int(x) if int(x)> 1 else 14 for x in input().split()]
if A > B:
print('Alice')
if A == B:
print('Draw')
if A < B:
print('Bob') | p03803 |
# AliceとBobは、2人で1枚ポーカーを行います。
# 1枚ポーカーは、トランプを用いて行う2人ゲームです。
#
# 今回使用するトランプでは、各カードに 1 から 13 までの数が書かれています。
# カードの強さは、カードに書かれている数で決まり，強さの基準は以下の通りです。
# 弱 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 強
#
# 1枚ポーカーは以下の手順で行います。
#
# 各プレイヤーは、トランプからカードを1枚選んで、自分の手札とします。
# 両プレイヤーは、手札を見せ合います。強いカードを持っているプレイヤーが勝ちです。
# なお、両プレイヤーの持っているカードの強さが同じ場合は引き分けです。
# 2人の対戦を眺めていたあなたは、AliceとBobの手札を知ることができます。
# Aliceが持っているカードに書かれている数は A、Bobが持っているカードカードに書かれている数は Bです。
# 2人の代わりに、勝敗を判定するプログラムを作ってください。
input_alice, input_bob = list(map(int,input().split()))
result = 'ret'
if input_alice > input_bob:
if input_bob == 1: # Bobがエースなので勝ち～
result = 'Bob'
else:
result = 'Alice'
elif input_alice < input_bob:
if input_alice == 1: # Aliceがエースなので勝ち～
result = 'Alice'
else:
result = 'Bob'
else:
result = 'Draw' # どっちも同じ手札なので引き分け～
print(result)
| # AliceとBobは、2人で1枚ポーカーを行います。
# 1枚ポーカーは、トランプを用いて行う2人ゲームです。
#
# 今回使用するトランプでは、各カードに 1 から 13 までの数が書かれています。
# カードの強さは、カードに書かれている数で決まり，強さの基準は以下の通りです。
# 弱 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 強
#
# 1枚ポーカーは以下の手順で行います。
#
# 各プレイヤーは、トランプからカードを1枚選んで、自分の手札とします。
# 両プレイヤーは、手札を見せ合います。強いカードを持っているプレイヤーが勝ちです。
# なお、両プレイヤーの持っているカードの強さが同じ場合は引き分けです。
# 2人の対戦を眺めていたあなたは、AliceとBobの手札を知ることができます。
# Aliceが持っているカードに書かれている数は A、Bobが持っているカードカードに書かれている数は Bです。
# 2人の代わりに、勝敗を判定するプログラムを作ってください。
input_alice, input_bob = list(map(int,input().split()))
result = 'ret' # 結果格納用
if input_alice > input_bob: # Aの方がBより大きい
if input_bob == 1:
result = 'Bob' # Bobがエースなので勝ち～
else:
result = 'Alice'
elif input_alice < input_bob: # Bの方がAより大きい
if input_alice == 1:
result = 'Alice' # Aliceがエースなので勝ち～
else:
result = 'Bob'
else:
result = 'Draw' # どっちも同じ手札なので引き分け～
print(result) # 結果出力～
| p03803 |
a,b=list(map(int,input().split()))
if( a == 1):
a = 14
if(b == 1):
b = 14
if( a < b):
print('Bob')
elif(b < a):
print('Alice')
else:
print('Draw') | a,b=list(map(int,input().split()))
a=(a+12)%14
b=(b+12)%14
print((['Draw','Bob','Alice'][(a<b)-(a>b)])) | p03803 |
lst = list(map(int,input().split()))
if lst[1] != 1 and lst[0] > lst[1] :
print('Alice')
elif lst[0] != 1 and lst[0] < lst[1]:
print('Bob')
elif lst[1] == 1 and lst[0] != 1:
print('Bob')
elif lst[0] == 1 and lst[1] != 1:
print('Alice')
else:
print('Draw') | lst = [14 if x == 1 else x for x in map(int,input().split())]
if lst[1] != 1 and lst[0] > lst[1] :
print('Alice')
elif lst[0] != 1 and lst[0] < lst[1]:
print('Bob')
else:
print('Draw')
| p03803 |
A, B = list(map(int, input().split()))
if A == B:
print("Draw")
elif A != 1 and B != 1:
if A < B:
print("Bob")
else:
print("Alice")
elif A == 1:
print("Alice")
elif B == 1:
print("Bob")
| A, B = list(map(int, input().split()))
if A == B:
print('Draw')
elif A == 1 or B < A and B != 1:
print('Alice')
else:
print('Bob')
| p03803 |
# AliceのスコアAとBobのスコアBを整数で入力
A,B = list(map(int,input().split()))
# AとBが同じならDrawを出力
if A == B:
print("Draw")
# Aが1がBより大きいならAliceを出力
elif A == 1 or A > B and B!= 1 :
print("Alice")
# Bの方が強ければBobを出力
else:
print("Bob") | # AliceのスコアAとBobのスコアBを整数で入力
A,B = list(map(int,input().split()))
# AとBが同じならDrawを出力
if A == B:
print("Draw")
# Aが1か、Bが1でなく且つAがBより大きいならAliceを出力
elif A == 1 or B!= 1 and A > B:
print("Alice")
# Bの方が強ければBobを出力
else:
print("Bob")
| p03803 |
a,b=list(map(int, input().split()))
if a==1:
k=14
else:
k=a
if b==1:
m=14
else:
m=b
if k>m:
print("Alice")
elif k==m:
print("Draw")
else:
print("Bob") | a , b =(list(map(int , input().split())))
if a==1:
a=a+13
if b==1:
b=b+13
if a>b :
print("Alice")
elif a<b:
print("Bob")
else:
print("Draw")
| p03803 |
a,b = list(map(int,input().split()))
if a == 1 and a != b :
print("Alice")
elif b == 1 and b != a:
print("Bob")
elif (a != 1 and b != 1) and a > b:
print("Alice")
elif (a != 1 and b != 1) and a < b:
print("Bob")
elif a == b:
print("Draw") | a,b = list(map(int,input().split()))
if a == b == 1:
print("Draw")
elif a == 1:
print("Alice")
elif b == 1:
print("Bob")
else:
if a > b:
print("Alice")
elif a < b:
print("Bob")
elif a == b:
print("Draw") | p03803 |
from collections import defaultdict
def main():
A, B = list(map(int, input().split()))
if A == 1:
A += 100
if B == 1:
B += 100
if A == B:
print("Draw")
elif A > B:
print("Alice")
else:
print("Bob")
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
A, B = list(map(int, input().split()))
d = {1: 14}
if d.get(A, A) == d.get(B, B):
print("Draw")
elif d.get(A, A) > d.get(B, B):
print("Alice")
else:
print("Bob")
if __name__ == '__main__':
main()
| p03803 |
from collections import defaultdict
def main():
A, B = list(map(int, input().split()))
d = {1: 14}
if d.get(A, A) == d.get(B, B):
print("Draw")
elif d.get(A, A) > d.get(B, B):
print("Alice")
else:
print("Bob")
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
A, B = list(map(int, input().split()))
if A == 1:
A = 14
if B == 1:
B = 14
if A == B:
print("Draw")
elif A > B:
print("Alice")
else:
print("Bob")
if __name__ == '__main__':
main()
| p03803 |
a,b=list(map(int,input().split()))
a,b=(a+13)%15,(b+13)%15
print(("Alice" if a>b else "Bob" if a<b else "Draw")) | a,b=list(map(int,input().split()))
print(("Draw" if a==b else ("Bob" if (a+13)%15<(b+13)%15 else "Alice"))) | p03803 |
a, b = list(map(int, input().split()))
if a != 1 and b != 1:
if a > b:
print('Alice')
elif a < b:
print('Bob')
else:
print('Draw')
elif a == 1 and b != 1:
print('Alice')
elif a != 1 and b == 1:
print('Bob')
else:
print('Draw') | a, b = list(map(int, input().split()))
if a == b:
print('Draw')
elif a ==1:
print('Alice')
elif b == 1:
print('Bob')
elif a > b:
print('Alice')
elif a < b:
print('Bob') | p03803 |
a,b=[(int(x)+13)%15 for x in input().split()];print((['Draw',['Bob','Alice'][a>b]][a!=b])) | a,b=list(map(int,input().split()));print((['Draw',['Bob','Alice'][(a+13)%15>(b+13)%15]][a!=b])) | p03803 |
# aアリス ｂボブ
a, b = list(map(int, input().split()))
if a == b:
print("Draw")
elif a == 1:
print("Alice")
elif b == 1:
print("Bob")
elif a < b:
print("Bob")
elif b < a:
print("Alice")
| # # aアリス ｂボブ
# a, b = map(int, input().split())
# if a == b:
# print("Draw")
# elif a == 1:
# print("Alice")
# elif b == 1:
# print("Bob")
# elif a < b:
# print("Bob")
# elif b < a:
# print("Alice")
x, y = list(map(int, input().split()))
L = list(range(2, 14)) + [1]
a = L.index(x)
b = L.index(y)
if a>b:
print("Alice")
elif b>a:
print("Bob")
else:
print("Draw") | p03803 |
A, B = list(map(int,input().split()))
if(A == 1 and B == 1):
print("Draw")
exit()
elif(A == 1):
print("Alice")
exit()
elif(B == 1):
print("Bob")
exit()
elif(A > B):
print("Alice")
elif(A < B):
print("Bob")
else:
print("Draw") | A, B = list(map(int,input().split()))
if(A == 1):
A += 13
if(B == 1):
B += 13
if(A > B):
print('Alice')
elif(A < B):
print('Bob')
else:
print('Draw') | p03803 |
a, b = list(map(int, input().split()))
if a == 1 and b != 1:
print('Alice')
elif a != 1and b == 1:
print('Bob')
else:
if a > b:
print('Alice')
elif b > a:
print('Bob')
else:
print('Draw') | a, b = list(map(int, input().split()))
if a == 1 and b == 1:
print('Draw')
elif a == 1:
print('Alice')
elif b == 1:
print('Bob')
else:
if a == b:
print('Draw')
elif a > b:
print('Alice')
else:
print('Bob') | p03803 |
A,B = list(map(int,input().split()))
def operate(i):
if i == 1:
i += 13
return i
A = operate(A)
B = operate(B)
ans = ["Alice","Bob","Draw"]
if A > B:
ans_index = 0
elif A < B:
ans_index = 1
elif A == B:
ans_index = 2
print((ans[ans_index])) | A,B = list(map(int,input().split()))
if A == 1:
A += 100
if B == 1:
B += 100
if A > B:
print("Alice")
elif A < B:
print("Bob")
else:
print("Draw") | p03803 |
import sys
def shuffle( cards ):
h = int( sys.stdin.readline() )
n = len( cards )
s = ""
t = ""
for i in range( h ):
s += cards[i]
for i in range( h, n ):
t += cards[i]
t += s
return t
while True:
cards = sys.stdin.readline().rstrip()
if '-' == cards:
break
m = int( sys.stdin.readline() )
for i in range( 0, m ):
cards = shuffle( cards )
print( cards ) | import sys
def shuffle( cards ):
h = int( sys.stdin.readline() )
cards = cards[ h : ] + cards[ 0 : h ]
return cards
while True:
cards = sys.stdin.readline().rstrip()
if '-' == cards:
break
m = int( sys.stdin.readline() )
for i in range( m ):
cards = shuffle( cards )
print( cards ) | p02420 |
import sys
p = 0
for line in sys.stdin:
ls = line.strip('\n')
if p == 0:
if ls =='-': break
letters = ls
p = 1
elif p == 1:
m = int(ls)
p =2
elif p == 2:
h = int(ls)
letters = letters[h:] + letters[:h]
if m > 1:
m -= 1
else:
print(letters)
p = 0 | while True:
ls = input()
if ls == '-': break
m = int(input())
for i in range(m):
h = int(input())
ls = ls[h:] + ls[:h]
print(ls) | p02420 |
from operator import mul
from functools import reduce
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
cE, cO = 0, 0
for a in A:
if a % 2 == 0:
cE += 1
else:
cO += 1
# 全て偶数
if cO == 0:
ans = 2 ** N if P == 0 else 0
print(ans)
else:
# 偶数が含まれている
# ある奇数$k$について考える
# 残りの奇数がcO-1個，偶数がcE個残っている，この選び方は2 ** (N - 1)通り
# 選んだ合計がSとする
# - Sが奇数である: Akを選ぶと全体は偶数，選ばないと全体は奇数
# - Sが偶数である: Akを選ぶと全体は奇数，選ばないと全体は偶数
# よってそれぞれの2 ** (N - 1)通りについて，Akを選ぶ・選ばないが1通り存在する
# print(2 ** (cO - 1) * 2 ** cE)
print((2 ** (N - 1))) | from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)
INF = int(1e10)
MOD = int(1e9 + 7)
def main():
from builtins import int, map
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
count_even, count_odd = 0, 0
for a in A:
if a % 2 == 0:
count_even += 1
else:
count_odd += 1
ans = -1
# print(N, P, A)
# print(count_even, count_odd)
if count_odd == 0:
# 偶数しかない
if P == 0:
# 偶数にしたい => どれでもOK
ans = 2 ** N
else:
# 奇数枚は食べられない
ans = 0
else:
# 奇数が1以上存在するので，ある1つ以外の和Sを考える
# S is odd: 食べたらeven，食べないとodd => 2 ^ (N-1) パターン
# S is even: 食べたらodd，食べないとeven
ans = 2 ** (N - 1)
print(ans)
if __name__ == '__main__':
main()
| p03665 |
N, P = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
import collections
import math
c = collections.Counter()
for a in A:
c[a % 2] += 1
ans = 0
if P == 0:
ans1 = 0
for i in range(0, c[1] + 1, 2):
ans1 += math.factorial(c[1]) / math.factorial(i) / math.factorial(c[1] - i)
for i in range(c[0] + 1):
ans0 = math.factorial(c[0]) / math.factorial(i) / math.factorial(c[0] - i)
ans += ans0 * ans1
else:
ans1 = 0
for i in range(1, c[1] + 1, 2):
ans1 += math.factorial(c[1]) / math.factorial(i) / math.factorial(c[1] - i)
for i in range(c[0] + 1):
ans0 = math.factorial(c[0]) / math.factorial(i) / math.factorial(c[0] - i)
ans += ans0 * ans1
print((int(ans)))
| import sys
import math
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, P = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
odd = 0
even = 0
ans = 0
def comb(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
if P == 0:
for i in range(0, odd + 1, 2):
for j in range(even + 1):
ans += comb(odd, i) * comb(even, j)
print(ans)
else:
for i in range(1, odd + 1, 2):
for j in range(even + 1):
ans += comb(odd, i) * comb(even, j)
print(ans)
if __name__ == '__main__':
main()
| p03665 |
n,p=list(map(int,input().split()))
a=[int(i) for i in input().split()]
odd=0
for i in a:
if i%2: odd+=1
even=n-odd
if odd==0:
print((2**n if p==0 else 0))
else:
print((2**(n-1)))
| n,p=list(map(int,input().split()))
a=[i for i in input().split() if int(i)%2]
if len(a)==0:
print((2**n if p==0 else 0))
else:
print((2**(n-1))) | p03665 |
n,p=list(map(int,input().split()))
a=[i for i in input().split() if int(i)%2]
if len(a)==0:
print((2**n if p==0 else 0))
else:
print((2**(n-1))) | n,p=list(map(int,input().split()))
a=len([i for i in input().split() if int(i)%2])
print((2**(n-1) if a else 2**n if p==0 else 0)) | p03665 |
import math
from itertools import combinations_with_replacement
n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
odd = []
even = []
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for a in A:
if a % 2 == 0:
even.append(a)
else:
odd.append(a)
even_count = []
for i in range(len(even)+1):
even_count.append(combinations_count(len(even), i))
odd_odd_count = []
odd_even_count = []
for i in range(len(odd)+1):
cnt = combinations_count(len(odd), i)
if i % 2 == 1:
odd_odd_count.append(cnt)
else:
odd_even_count.append(cnt)
ans = 0
if p == 0:
for i in even_count:
for j in odd_even_count:
ans += i*j
else:
for i in even_count:
for j in odd_odd_count:
ans += i*j
print(ans)
| n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
if all(a % 2 == 0 for a in A):
print((0 if p else 2**n))
else:
print((2**(n-1))) | p03665 |
def main():
N, P = (int(i) for i in input().split())
A = [int(i) % 2 for i in input().split()]
from collections import Counter
c = Counter(A)
if all(a == 0 for a in A):
print((2**N if P == 0 else 0))
else:
print((2**(c[1]-1) * 2**c[0]))
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N, P = (int(i) for i in input().split())
A = [int(i) % 2 for i in input().split()]
from collections import Counter
c = Counter(A)
if all(a == 0 for a in A):
print((2**N if P == 0 else 0))
else:
print((2**(c[1]-1) * 2**c[0]))
if __name__ == '__main__':
main()
| p03665 |
from operator import mul
from functools import reduce
n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
even = 0
odd = 0
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
def cmb(n, r):
r = min(n-r, r)
if r == 0:
return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1, r + 1)))
return over // under
ans = 2**even
cnt = 0
if p == 0:
for i in range(0, odd+1, 2):
cnt += cmb(odd, i)
else:
for i in range(1, odd+1, 2):
cnt += cmb(odd, i)
print((ans*cnt))
| n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
odd = False
for a in A:
if a % 2 == 1:
odd = True
break
if odd:
print((2**(n-1)))
elif p == 0:
print((2**n))
else:
print((0))
| p03665 |
import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
o, e = 0, 0
for i in A:
if i % 2 == 0:
e += 1
else:
o += 1
ans = 0
for i in range(P, o+1, 2):
ans += comb(o, i)
print((ans * 2 ** e))
| N,P=list(map(int,input().split()))
o=len([i for i in input().split() if int(i)%2])
print((2**(N-1) if o else 2**N if P==0 else 0))
| p03665 |
from operator import mul
from functools import reduce
from math import factorial
def cmb(n,r):
r=min(n-r,r)
if r == 0: return 1
over=reduce(mul,list(range(n,n-r,-1)))
under=reduce(mul,list(range(1,r+1)))
return over//under
n,p,*a=list(map(int,open(0).read().split()))
b=[i for i in a if i%2==0]
c=[i for i in a if i%2==1]
ans=0
x=0
for s in range(len(b)+1):
x+=cmb(len(b),s)
if p==0:
for s in range(0,len(c)+1,2):
ans+=x*cmb(len(c),s)
print(ans)
else:
for s in range(1,len(c)+1,2):
ans+=x*cmb(len(c),s)
print(ans) | from math import factorial
def cmb(n,r):
if n-r<0:
return 0
else:
return factorial(n) // factorial(r) // factorial(n - r)
n,p,*a=list(map(int,open(0).read().split()))
odd=sum(i%2 for i in a)
even=n-odd
x=sum(cmb(even,i)for i in range(even+1))
y=sum(cmb(odd,i)for i in range(p,odd+1,2))
print((x*y))
| p03665 |
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def odd(n): return n & 1
def even(n): return not odd(n)
def comb(n, m):
r = 1
for i in range(1, n+1):
r *= i
for i in range(1, m+1):
r //= i
for i in range(1, n-m+1):
r //= i
return r
N, P = map(int, input().split())
A = [int(n) % 2 for n in input().split()]
cnt0 = len([a for a in A if a == 0])
cnt1 = len([a for a in A if a == 1])
ans = 0
if odd(P):
for i in range(cnt1 + 1):
if odd(i):
ans += comb(cnt1, i)
else:
for i in range(cnt1 + 1):
if even(i):
ans += comb(cnt1, i)
ans *= pow(2, cnt0)
print(ans)
| import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def odd(n): return n & 1
def even(n): return not odd(n)
def comb(n, m):
r = 1
for i in range(1, n+1):
r *= i
for i in range(1, m+1):
r //= i
for i in range(1, n-m+1):
r //= i
return r
N, P = map(int, input().split())
A = [int(n) % 2 for n in input().split()]
cnt0 = len([a for a in A if a == 0])
cnt1 = len([a for a in A if a == 1])
ans = 0
if odd(P):
for i in range(cnt1 + 1):
if odd(i):
ans += comb(cnt1, i)
else:
for i in range(cnt1 + 1):
if even(i):
ans += comb(cnt1, i)
ans *= pow(2, cnt0)
print(ans)
| p03665 |
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def odd(n): return n & 1
def even(n): return not odd(n)
def comb(n, m):
r = 1
for i in range(1, n+1):
r *= i
for i in range(1, m+1):
r //= i
for i in range(1, n-m+1):
r //= i
return r
if __name__ == '__main__':
N, P = map(int, input().split())
A = [int(n) % 2 for n in input().split()]
cnt0 = len([a for a in A if a == 0])
cnt1 = len([a for a in A if a == 1])
ans = 0
if odd(P):
for i in range(cnt1 + 1):
if odd(i):
ans += comb(cnt1, i)
else:
for i in range(cnt1 + 1):
if even(i):
ans += comb(cnt1, i)
ans *= pow(2, cnt0)
print(ans)
| import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def odd(n): return n & 1
def even(n): return not odd(n)
def comb(n, m):
r = 1
for i in range(1, n+1):
r *= i
for i in range(1, m+1):
r //= i
for i in range(1, n-m+1):
r //= i
return r
N, P = map(int, input().split())
A = [int(n) % 2 for n in input().split()]
cnt0 = len([a for a in A if a == 0])
cnt1 = len([a for a in A if a == 1])
ans = 0
if odd(P):
for i in range(cnt1 + 1):
if odd(i):
ans += comb(cnt1, i)
else:
for i in range(cnt1 + 1):
if even(i):
ans += comb(cnt1, i)
ans *= pow(2, cnt0)
print(ans)
| p03665 |
from math import factorial
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
odd, even = 0, 0
for i in range(N):
if A[i] % 2:
odd += 1
else:
even += 1
ans = 0
for i in range(odd+1):
if i%2 == P:
ans += factorial(odd) / factorial(i) / factorial(odd-i)
ans *= 2**even
print((int(ans)))
| N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
odd, even = 0, 0
for i in range(N):
if A[i] % 2:
odd += 1
else:
even += 1
if odd == 0:
if P:
ans = 0
else:
ans = 2**N
else:
ans = 2**(N-1)
print((int(ans)))
| p03665 |
from functools import reduce
def binom(n, r):
if n < r or n < 0 or r < 0: return 0
if n - r < r: r = n - r
if r == 0: return 1
elif r == 1: return n
numerator = [n - r + 1 + k for k in range(r)] # (n-r+1)*(n-r+2)*...*(n-1)*n
denominator = [1+ k for k in range(r)] # 1*2*...*(r-1)*r
# reduce prod(numerator)//prod(denominator)
for p in range(2, r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1, r, p):
numerator[k - offset] //= pivot
denominator[k] //= pivot
# calculate nCr
return reduce(lambda x, y: x*y, numerator)
N, P = list(map(int, input().split()))
*A, = list(map(int, input().split()))
even = 0; odd = 0;
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
ans = 2**even
temp = 0
if P == 0:
for i in range(0, odd+1, 2):
temp += binom(odd, i)
else:
for i in range(1, odd+1, 2):
temp += binom(odd, i)
ans *= temp
print(ans) | N, P = list(map(int, input().split()))
*A, = list(map(int, input().split()))
even = 0
for a in A:
if a % 2 == 0:
even += 1
if even == N:
print((2**N if P == 0 else 0))
else:
print((2**(N-1))) | p03665 |
def C(n,m):
S=1
for i in range(1,n+1):
S=S*i
for i in range(1,m+1):
S=S//i
for i in range(1,n-m+1):
S=S//i
return S
N,P=list(map(int,input().split()))
A=[int(i) for i in input().split()]
X=0;Y=0
#X:偶数
#Y:奇数
for i in range(N):
if A[i]%2==0:
X+=1
else:
Y+=1
Z=0
for i in range(Y+1):
if i%2==P:
Z+=C(Y,i)
print((Z*2**(X)))
| '''
方針：各Aiをそれぞれ見て、いくつ偶数があっていくつ奇数があるかを数える。
以下偶数がX個、奇数がY個あるとする。(X+Y=N,0≦X,Y)
そしてこの問題は偶数の集合の中からの選ぶことと奇数の集合の中から選ぶことを独立に考えることができる。
よって（偶数の集合からの選び方）×（奇数の集合からの選び方）で求めることができる。
（偶数の集合からの選び方）については、どのように選んでも全体の合計を2で割った余りは変わらないので全事象を考えることができる。
よって2^Xである。
（奇数の集合からの選び方）についてはY個のうちk個（k≡P mod 2）である場合の数の合計なので
Σ[k:0→Y and k≡P mod 2]C(Y,k)である。
ただし、C(Y,k)は二項係数を表していて、Σ[k:0→Y and k≡P mod 2]は0≦k≦Nかつk≡P mod 2であるものすべてを足し合わせたという意味である。
'''
def C(n,m):
S=1
for i in range(1,n+1):
S=S*i
for i in range(1,m+1):
S=S//i
for i in range(1,n-m+1):
S=S//i
return S
N,P=list(map(int,input().split()))
A=[int(i) for i in input().split()]
X=0;Y=0
#X:偶数
#Y:奇数
for i in range(N):
if A[i]%2==0:
X+=1
else:
Y+=1
Z=0
for i in range(Y+1):
if i%2==P:
Z+=C(Y,i)
print((Z*2**(X)))
| p03665 |
N, P = list(map(int,input().split()))
A = list(map(int,input().split()))
c = 0
for a in A:
c += a%2
if c == 0:
print((2**N if P == 0 else 0))
else:
print((2**(N-1)))
| N, P = list(map(int,input().split()))
A = list(map(int,input().split()))
B = [A[k]%2 for k in range(N)]
dp = [[0,0] for k in range(N+1)]
dp[0][0] = 1
for k in range(N):
if B[k] == 0:
dp[k+1][0] = dp[k][0]*2
dp[k+1][1] = dp[k][1]*2
else:
dp[k+1][0] = dp[k][0] + dp[k][1]
dp[k+1][1] = dp[k][0] + dp[k][1]
print((dp[N][P]))
| p03665 |
import math
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [a % 2 for a in A]
count_0 = B.count(0)
count_1 = B.count(1)
def comb_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
x = y = 0
if count_0 == 0:
x = 1
else:
if P == 1 and count_1 == 0:
x = 0
else:
for i in range(count_0 + 1):
x += comb_count(count_0, i)
if count_1 == 0:
y = 1
else:
if P == 0:
for i in range(0, count_1 + 1, 2):
y += comb_count(count_1, i)
else:
for i in range(1, count_1 + 1, 2):
y += comb_count(count_1, i)
print((x * y))
| N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [a % 2 for a in A]
count_0 = B.count(0)
count_1 = B.count(1)
if count_1 == 0:
if P == 0:
ans = 2 ** N
else:
ans = 0
else:
ans = 2 ** (N - 1)
print(ans)
| p03665 |
N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
ce = 0
co = 0
for i in range(N):
if A[i]%2==0:
ce += 1
else:
co += 1
if co>0:
n = (2**ce)*(2**(co-1))
else:
n = 2**ce
if P==0:
print(n)
else:
print((2**N-n)) | N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
C = {0:0,1:0}
for i in range(N):
if A[i]%2==0:
C[0] += 1
else:
C[1] += 1
if P==0:
if C[1]==0:
n = 2**C[0]
else:
n = 2**C[0]*2**(C[1]-1)
else:
if C[1]==0:
n = 0
else:
n = 2**C[0]*2**(C[1]-1)
print(n) | p03665 |
N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
C = {0:0,1:0}
for i in range(N):
if A[i]%2==0:
C[0] += 1
else:
C[1] += 1
if P==0:
if C[1]==0:
n = 2**C[0]
else:
n = 2**C[0]*2**(C[1]-1)
else:
if C[1]==0:
n = 0
else:
n = 2**C[0]*2**(C[1]-1)
print(n) | N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
n0=0
n1=0
for i in range(N):
if A[i]%2==0:
n0 += 1
n1 = N-n0
if P==0:
if n1==0:
print((2**n0))
else:
print((2**(n1-1)*2**n0))
else:
if n1==0:
print((0))
else:
print((2**(n1-1)*2**n0)) | p03665 |
from collections import Counter
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
"""
nCr mod m
"""
if n < r:
return 0
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
n, p = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [ai % 2 for ai in a]
c = Counter(b)
ans = 0
if p == 0:
even = (2 ** c[0])
odd = 1
for i in range(2, c[1] + 1, 2):
odd += combination(c[1], i)
ans = even * odd
else:
even = (2 ** c[0])
odd = 0
for i in range(1, c[1] + 1, 2):
odd += combination(c[1], i)
ans = even * odd
print(ans) | import math
def combination(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
odd = 0
even = 0
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
ans = 0
for i in range(P, odd+1, 2):
tmp = combination(odd, i)
for j in range(0, even+1):
ans += tmp * combination(even, j)
print(ans)
| p03665 |
import math
def comb(n,r):
if r>n: return 0
else: return int(math.factorial(n)/(math.factorial(r)*math.factorial(n-r)))
N,P=list(map(int,input().split()))
A=list(map(int,input().split()))
odd=0
even=0
a=0
for i in range(N):
if A[i]%2==0: even+=1
else: odd+=1
a+=A[i]
if (a-P)%2==0: flag=0
else: flag=1
n=2**even
ans=0
if flag==0:#evenの場合
for i in range(odd//2+1):
ans+=comb(odd,2*i)
else:#oddの場合
for i in range(2*(n+1)//2+1):
ans+=comb(odd,1+2*i)
print((ans*n)) | N,P=list(map(int,input().split()))
A=list(map(int,input().split()))
odd=0
for i in range(N):
if A[i]%2==1: odd+=1
if odd==0:
if P==1: print((0))
else: print((2**N))
else:
print((2**(N-1))) | p03665 |
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
from math import ceil
def comb(n,r):
ans = 1
for i in range(r):
ans *= n-i
for i in range(1,r+1):
ans //= i
return ans
odd,even = 0,0
for a in A:
if a%2==0:
even += 1
else:
odd += 1
if P%2==0:
ans = 0
for i in range(int(odd/2)+1):
ans += comb(odd,2*i)
else:
ans = 0
for i in range(1,ceil(odd/2)+1):
ans += comb(odd,2*i-1)
ans *= 2**even
print(ans) | N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
even = 0
odd = 0
for i in range(N):
if A[i]%2==0:
even += 1
else:
odd += 1
if odd>=1:
ans = pow(2,even+odd-1)
elif P==0:
ans = pow(2,even)
else:
ans = 0
print(ans) | p03665 |
# coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n, p = LI()
A = LI()
sum_a = sum(A)
# dp[i][j]: a_iまでを使ってjを作る組み合わせの総数（iは省略）
dp = [0] * (sum_a + 1)
dp[0] = 1
for i in range(n):
for j in range(sum_a + 1)[::-1]:
if j - A[i] < 0:
break
if dp[j - A[i]]:
dp[j] += dp[j - A[i]]
return sum([dp[i] if i % 2 == p else 0 for i in range(sum_a + 1)])
print((main()))
| # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n, p = LI()
A = LI()
even, odd = 0, 0
for a in A:
if a % 2:
odd += 1
else:
even += 1
if odd:
return 2 ** (n - 1)
else:
return 2 ** n if p == 0 else 0
print((main()))
| p03665 |
N,P = list(map(int, input().split()))
bs = list(map(int, input().split()))
even = 0
for i in range(N):
if bs[i]%2 == 0: even += 1
odd = N-even
f = [1]
for n in range(1, N+2):
f.append(f[-1] * n)
def ncr(n,r):
return f[n] // f[n-r] // f[r]
oddc = 0
for i in range(odd+1):
if i%2 != P : continue
oddc += ncr(odd,i)
print((pow(2,even) * oddc))
| N,P = list(map(int,input().split()))
src = list(map(int,input().split()))
if all(a%2==0 for a in src):
if P:
print((0))
else:
print((2**N))
exit()
print((2**(N-1))) | p03665 |
n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
U = n*100
dp = [0]*(U+1)
dp[0] = 1
for a in A:
for j in reversed(list(range(U+1))):
if 0 <= j-a:
dp[j] += dp[j-a]
print((sum(dp[p::2])))
| n, p = list(map(int, input().split()))
A = list(map(int, input().split()))
if all(a % 2 == 0 for a in A):
if p:
print((0))
else:
print((pow(2, n)))
else:
print((pow(2, n-1)))
| p03665 |
import itertools
N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
even = [a for a in A if a%2==0]
odd = [a for a in A if a%2==1]
li0 = []
li1 = []
ans = 0
if P==0:
for _ in range(0,len(odd)+1,2):
li0.append(len(list(itertools.combinations(odd,_))))
for i in range(len(even)+1):
tmp = len(list(itertools.combinations(even,i)))
for j in li0:
ans += tmp*j
else:
for _ in range(len(even)+1):
li1.append(len(list(itertools.combinations(even,_))))
for i in range(1,len(odd)+1,2):
tmp = len(list(itertools.combinations(odd,i)))
for j in li1:
ans += tmp*j
print(ans)
| N,P = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in A:
if i%2==1:
print((2**(N-1)))
exit()
print((0 if P==1 else 2**N)) | p03665 |
import math
def nCm(n, m):
return math.factorial(n) / (math.factorial(m) * (math.factorial(n - m)))
N, P = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
odd = 0
even = 0
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
ans = 0
if P == 0:
k = 0
for i in range(0, odd+1):
if i%2==1 :
continue
elif i > odd:
break
k += nCm(odd, i)
ans = (2**even)*k
else:
k = 0
for i in range(1, odd+1):
if i%2==0 :
continue
elif i > odd:
break
k += nCm(odd, i)
ans = (2**even)*k
print((int(ans))) | N, P = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
odd_flag = False
for a in A:
if a % 2 == 1:
odd_flag = True
break
if odd_flag == True:
print((2**(N-1)))
elif((odd_flag == False) and (P == 0)):
print((2**N))
else:
print((0)) | p03665 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.