input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
s,_,*q=open(0)
a=s[:-1]
p=1
for q in q:
try:
q,f,c=q.split()
if(f<'2')^p:a+=c
else:a=c+a
except:p^=1
print((a[::p or-1]))
|
s,_,*q=open(0)
a='%s'
p=1
for q in q:
try:
q,f,c=q.split()
if(f<'2')^p:a+=c
else:a=c+a
except:p^=1
print(((a%s[:-1])[::p or-1]))
|
p02756
|
from collections import deque
s = deque(list(input()))
q = int(input())
f = 0
for _ in range(q):
l = input()
if l == "1":
f ^= 1
else:
a, b, c = l.split()
if f ^ (b=="1"):
s.appendleft(c)
else:
s.append(c)
if f:
ans = list(s)[::-1]
else:
ans = list(s)
print(*ans, sep="")
|
from collections import deque
def main():
s = deque(list(input()))
q = int(input())
f = 0
for _ in range(q):
l = input()
if l == "1":
f ^= 1
else:
a, b, c = l.split()
if f ^ (b=="1"):
s.appendleft(c)
else:
s.append(c)
if f:
ans = list(s)[::-1]
else:
ans = list(s)
print(*ans, sep="")
if __name__ == "__main__":
main()
|
p02756
|
s = list(input())
n = int(input())
re = 1
for i in range(n):
q = input().split()
if q[0] == '1':
re = re * -1
else:
if re == 1:
if q[1] == '1':
s.insert(0, q[2])
else:
s.append(q[2])
else:
if q[1] == '1':
s.append(q[2])
else:
s.insert(0, q[2])
print(''.join(s)) if re == 1 else print(''.join(s[::-1]))
|
s = input()
n = int(input())
re = 1
head = ''
tail = ''
for i in range(n):
q = input().split()
if q[0] == '1':
re = re * -1
else:
if re == 1:
if q[1] == '1':
head = q[2] + head
else:
tail = tail + q[2]
else:
if q[1] == '1':
tail = tail + q[2]
else:
head = q[2] + head
print(head+s+tail) if re == 1 else print((head+s+tail)[::-1])
|
p02756
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
s = stdin.readline().rstrip()
n = int(stdin.readline().rstrip())
for i in range(n):
q = [x for x in stdin.readline().rstrip().split()]
if len(q) == 1:
s = ''.join(list(reversed(s)))
else:
if q[1] == "1": s = q[2] + s
if q[1] == "2": s = s + q[2]
print (s)
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
s = stdin.readline().rstrip()
n = int(stdin.readline().rstrip())
flag = 0
for i in range(n):
q = [x for x in stdin.readline().rstrip().split()]
if len(q) == 1:
flag = (flag + 1) % 2
else:
if (q[1] == "1" and flag == 0) or (q[1] == "2" and flag == 1):
s = q[2] + s
else:
s = s + q[2]
if flag == 1: s = ''.join(list(reversed(s)))
print (s)
|
p02756
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
s = stdin.readline().rstrip()
n = int(stdin.readline().rstrip())
flag = 0
prefix = []
suffix = []
for i in range(n):
q = [x for x in stdin.readline().rstrip().split()]
if len(q) == 1:
flag = (flag + 1) % 2
else:
if (q[1] == "1" and flag == 0) or (q[1] == "2" and flag == 1):
prefix.insert(0,q[2])
else:
suffix.append(q[2])
s = ''.join(prefix) + s + ''.join(suffix)
if flag == 1: s = ''.join(list(reversed(s)))
print (s)
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque
s = deque(stdin.readline().rstrip())
n = int(stdin.readline().rstrip())
flag = 0
for i in range(n):
q = [x for x in stdin.readline().rstrip().split()]
if len(q) == 1:
flag = 1 - flag
else:
if (q[1] == "1" and flag == 0) or (q[1] == "2" and flag == 1):
s.appendleft(q[2])
else:
s.append(q[2])
if flag == 1:
s = ''.join(s)[::-1]
else:
s = ''.join(s)
print (s)
|
p02756
|
from collections import deque
s = deque(list(map(str, input().rstrip())))
q = int(eval(input()))
for _ in range(q):
li = list(map(str, input().split()))
if li[0] == "1":
s.reverse()
elif li[1] == "1":
s.appendleft(li[2])
else:
s.append(li[2])
print(("".join(s)))
|
from collections import deque
s = deque(list(map(str, input().rstrip())))
q = int(eval(input()))
state = 1
for _ in range(q):
li = list(map(str, input().split()))
if li[0] == "1":
state *= -1
elif (li[1] == "1" and state == 1) or (li[1] == "2" and state == -1):
s.appendleft(li[2])
else:
s.append(li[2])
if state == -1:
s.reverse()
print(("".join(s)))
|
p02756
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
def ST():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
S = ST()
Q = I()
for _ in range(Q):
query = list(input().split())
if query[0] == "1":
S = S[::-1]
else:
if query[1] == "1":
S = query[2] + S
else:
S = S + query[2]
print(S)
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
def ST():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
S = ST()
Q = I()
switch = True
prefix = ""
suffix = ""
for _ in range(Q):
query = list(input().split())
if query[0] == "1":
if switch:
switch = False
else:
switch = True
else:
if switch:
if query[1] == "1":
prefix = query[2] + prefix
else:
suffix = suffix + query[2]
else:
if query[1] == "1":
suffix = suffix + query[2]
else:
prefix = query[2] + prefix
ans = prefix + S + suffix
if switch:
print(ans)
else:
print((ans[::-1]))
|
p02756
|
S = list(input().rstrip())
Q = int(input().rstrip())
q = []
for n in range(Q):
q.append(list(input().rstrip().split()))
#print(q)
def rev(olist):
nlist = olist[::-1]
return nlist
def addhead(olist,ele):
nlist = olist.insert(0,ele)
return nlist
def addtail(olist,ele):
nlist = olist.append(ele)
return nlist
def rev2(flg):
if flg == 0:
flg = 1
else:
flg = 0
return flg
def add(olist,ele,j,flg,head,tail):
if j == '1' and flg == 0:
head.insert(0,ele)
elif j == '1' and flg == 1:
tail.append(ele)
elif j == '2' and flg == 0:
tail.append(ele)
elif j == '2' and flg == 1:
head.insert(0,ele)
flg = 0
head = []
tail = []
for n in range(Q):
if q[n][0] == '1':
flg = rev2(flg)
else:
add(S,q[n][2],q[n][1],flg,head,tail)
ans = head + S + tail
if flg == 1:
ans = rev(ans)
print((''.join(ans)))
|
S = input().rstrip()
Q = int(input().rstrip())
q = []
for n in range(Q):
q.append(list(input().rstrip().split()))
#print(q)
def rev(olist):
nlist = olist[::-1]
return nlist
def addhead(olist,ele):
nlist = olist.insert(0,ele)
return nlist
def addtail(olist,ele):
nlist = olist.append(ele)
return nlist
def rev2(flg):
if flg == 0:
flg = 1
else:
flg = 0
return flg
def add(olist,ele,j,flg,head,tail):
if j == '1' and flg == 0:
head.insert(0,ele)
elif j == '1' and flg == 1:
tail.append(ele)
elif j == '2' and flg == 0:
tail.append(ele)
elif j == '2' and flg == 1:
head.insert(0,ele)
def add2(olist,ele,j,flg,head,tail):
if j == '1' and flg == 0:
head = ele + head
elif j == '1' and flg == 1:
tail = tail + ele
elif j == '2' and flg == 0:
tail = tail + ele
elif j == '2' and flg == 1:
head = ele + head
return head,tail
flg = 0
#head = []
#tail = []
head=''
tail = ''
for n in range(Q):
if q[n][0] == '1':
flg = rev2(flg)
else:
head,tail = add2(S,q[n][2],q[n][1],flg,head,tail)
ans = head + S + tail
if flg == 1:
ans1 = rev(list(ans))
print((''.join(ans1)))
else:
print(ans)
|
p02756
|
S = input().rstrip()
Q = int(input().rstrip())
a = -1
for _ in range(Q):
stdin = input().rstrip()
if int(stdin[0]) == 1:
a = ~a
else:
T,F,C = stdin.split()
if int(F) == 2+a:
S = C + S
else:
S = S + C
if a == 0:
S = S[::-1]
print(S)
|
S = input().rstrip()
Q = int(input().rstrip())
a = -1
before =[]
after =[]
for _ in range(Q):
stdin = input().rstrip()
if int(stdin[0]) == 1:
a = ~a
else:
T,F,C = stdin.split()
if int(F) == 2+a:
before.append(C)
else:
after.append(C)
S = ''.join(before)[::-1] + S + ''.join(after)
if a == 0:
S = S[::-1]
print(S)
|
p02756
|
word = input().rstrip()
n = int(eval(input()))
hanten = 0
lhanten = ""
r = ""
for i in range(n):
a = input().rstrip().split(" ")
if a[0] == "1":
hanten = (hanten + 1) % 2
# word = word[::-1]
# print(word)
else:
if (a[1] == "2" and hanten == 0) or (a[1] == "1" and hanten == 1):
r += a[2]
# print("rtuika")
else:
lhanten += a[2]
# print("ltuika")
if hanten == 0:
print((lhanten[::-1] + word + r))
else:
print((r[::-1] + word[::-1] + lhanten))
|
word = input().rstrip()
n = int(eval(input()))
hanten = 0
lhantenlist = []
rlist = []
for i in range(n):
a = input().rstrip().split(" ")
if a[0] == "1":
hanten = (hanten + 1) % 2
# word = word[::-1]
#print(word)
else:
if (a[1] == "2" and hanten == 0) or (a[1] == "1" and hanten == 1):
rlist.append(a[2])
#print("rtuika: ",rlist)
else:
lhantenlist.append(a[2])
#print("ltuika: ",lhantenlist)
lhanten="".join(lhantenlist)
r="".join(rlist)
if hanten == 0:
anslist=[lhanten[::-1],word,r]
ans="".join(anslist)
else:
anslist = [r[::-1], word[::-1], lhanten]
ans="".join(anslist)
print(ans)
|
p02756
|
import sys
input = sys.stdin.readline
def main():
S = input().rstrip()
Q = int(eval(input()))
query = [None] * Q
for i in range(Q):
query[i] = input().split()
prefix = []
surfix = []
is_reversed = False
for q in query:
if q[0] == "1":
is_reversed = not is_reversed
else:
F, C = q[1], q[2]
if F == "1":
if is_reversed:
surfix.append(C)
else:
prefix.append(C)
else:
if is_reversed:
prefix.append(C)
else:
surfix.append(C)
ans = "".join(["".join(prefix)[::-1], S, "".join(surfix)])
if is_reversed:
ans = ans[::-1]
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline
def main():
S = input().rstrip()
Q = int(eval(input()))
query = [None] * Q
for i in range(Q):
query[i] = input().split()
prefix = []
surfix = []
prefix_append = prefix.append
surfix_append = surfix.append
is_reversed = False
for q in query:
if q[0] == "1":
is_reversed = not is_reversed
else:
F, C = q[1], q[2]
if F == "1":
if is_reversed:
surfix_append(C)
else:
prefix_append(C)
else:
if is_reversed:
prefix_append(C)
else:
surfix_append(C)
ans = "".join(["".join(prefix)[::-1], S, "".join(surfix)])
if is_reversed:
ans = ans[::-1]
print(ans)
if __name__ == "__main__":
main()
|
p02756
|
from collections import deque
s=list(input())
s=deque(s)
q=int(input())
a=0
for i in range(q):
A=list(input().split())
if A[0]=="1":
a=(a+1)%2
else:
if A[1]=="1":
if a==0:
s.appendleft(A[2])
else:
s.append(A[2])
else:
if a==0:
s.append(A[2])
else:
s.appendleft(A[2])
if a==1:
S=[]
c=len(s)
for i in range(c):
S.append(s[c-i-1])
else:
S=s
for i in range(len(S)):
print(S[i],end="")
print()
|
from collections import deque
s=list(input())
s=deque(s)
q=int(input())
a=0
for i in range(q):
A=list(input().split())
if A[0]=="1":
a=(a+1)%2
else:
if A[1]=="1":
if a==0:
s.appendleft(A[2])
else:
s.append(A[2])
else:
if a==0:
s.append(A[2])
else:
s.appendleft(A[2])
if a==1:
S=[]
c=len(s)
for i in range(c):
S.append(s[-1])
s.pop()
else:
S=s
for i in range(len(S)):
print(S[i],end="")
print()
|
p02756
|
import sys
a = sys.stdin.read().split('\n')[:-1]
s = list(a[0])
q = int(a[1])
f = 1
for i in range(2, q + 2):
if a[i][0] == '1':
f = 1 - f
else:
l = len(s)
s.insert(0 if a[i][2] == '21'[f] else l, a[i][4])
if f != 1:
s.reverse()
print((''.join(s)))
|
import sys
a = sys.stdin.read().split('\n')[:-1]
q = int(a[1])
f = 1
l = [[], []]
for i in range(2, q + 2):
if a[i][0] == '1':
f = 1 - f
else:
l[0 if a[i][2] == '21'[f] else 1].append(a[i][4])
if f != 1:
l[1].reverse()
print((''.join(l[1]) + ''.join(reversed(list(a[0]))) + ''.join(l[0])))
else:
l[0].reverse()
print((''.join(l[0]) + a[0] + ''.join(l[1])))
|
p02756
|
S = input()
Q = int(input())
sign = 1
for i in range(Q):
T = list(map(str, input().split()))
if T[0] == "1":
sign *= -1
else:
F = int(T[1]) * 2 - 3
if sign * F == 1:
S = S[:] + T[2]
else:
S = T[2] + S[:]
if sign == 1:
print(S)
else:
N = len(S)
for i in range(N):
print(S[N-i-1], end = '')
print()
|
S = input()
N = len(S)
Q = int(input())
sign = 1
L = ["" for i in range(N + 2 * Q)]
for i in range(N):
L[i+Q] = S[i]
x, y = Q - 1, N + Q
for i in range(Q):
T = list(map(str, input().split()))
if T[0] == "1":
sign *= -1
else:
F = int(T[1]) * 2 - 3
if sign * F == 1:
L[y] = T[2]
y += 1
else:
L[x] = T[2]
x -= 1
newS = ""
for i in range(N+2*Q):
newS = newS[:] + L[i]
if sign == 1:
print(newS)
else:
M = len(newS)
for i in range(M):
print(newS[M-i-1], end = '')
print()
|
p02756
|
from sys import stdin
sin = stdin.readline().rstrip()
q = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip().split()) for _ in range(q)]
point = 0
for i in li:
if i[0] == "1":
point += 1
elif i[0] == "2":
if i[1] == "1":
if point%2 == 0:
sin = i[2] + sin
else:
sin += i[2]
else:
if point%2 == 0:
sin += i[2]
else:
sin = i[2] + sin
if point%2 == 1:
sin = sin[::-1]
print(sin)
|
from sys import stdin
sin = stdin.readline().rstrip()
q = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip().split()) for _ in range(q)]
point = 0
omote = ""
ura = ""
for i in li:
if i[0] == "1":
point += 1
elif i[0] == "2":
if i[1] == "1":
if point%2 == 0:
omote += i[2]
else:
ura += i[2]
else:
if point%2 == 0:
ura += i[2]
else:
omote += i[2]
if point%2 == 0:
omote = omote[::-1]
sin = omote + sin + ura
print(sin)
else:
sin = sin[::-1]
ura = ura[::-1]
sin = ura + sin + omote
print(sin)
|
p02756
|
n=int(eval(input()))
d=''.join([''.join(input().split())for i in range(n//19+(n%19!=0))])
i=0
while True:
if d.find(str(i))==-1:
print(i)
exit()
i+=1
|
n=int(eval(input()))
d=''.join(''.join(input().split())for i in[0]*(n//19+(n%19!=0)))
i=0
while 1:
if d.find(str(i))==-1:
print(i)
exit()
i+=1
|
p00935
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
H, W = map(int, readline().split())
C = [readline().strip() for _ in range(H)]
ans = [0] * (2 * H)
for i in range(2 * H):
ans[i] = C[i // 2]
print(*ans, sep='\n')
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
H, W = list(map(int, readline().split()))
C = [readline().strip() for _ in range(H)]
for i in range(2 * H):
print((C[i // 2]))
return
if __name__ == '__main__':
main()
|
p03853
|
N,A,B = list(map(int, input().split()))
if A % 2 == 0 and B % 2 == 0:
print("Alice")
elif A % 2 == 0 and B % 2 != 0:
print("Borys")
elif A % 2 != 0 and B % 2 == 0:
print("Borys")
elif A % 2 != 0 and B % 2 != 0:
print("Alice")
|
N,A,B = list(map(int, input().split()))
D = B - A
if D % 2 == 0:
print("Alice")
else:
print("Borys")
|
p03463
|
n,a,b = list(map(int,input().split()))
cnt = 1
while True:
if cnt % 2 != 0: #alice
cnt += 1
a += 1
if a == b:
print('Borys')
break
else:
cnt += 1
b -= 1
if b == a:
print('Alice')
break
|
n,a,b = list(map(int,input().split()))
print(('Alice' if (b-a) % 2 == 0 else 'Borys'))
|
p03463
|
N, A, B = list(map(int, input().split()))
det = (B-A)%2
if det == 1:
print('Borys')
else:
print('Alice')
|
N, A, B = list(map(int, input().split()))
if (B-A)%2 == 0:
print('Alice')
else:
print('Borys')
|
p03463
|
def main():
n, a, b = list(map(int, input().split()))
if b - a == 1:
print("Borys")
elif (b - a) % 2 == 0:
print("Alice")
else:
print("Borys")
if __name__ == '__main__':
main()
|
def main():
n, a, b = list(map(int, input().split()))
if (b - a) % 2 == 0:
print("Alice")
else:
print("Borys")
if __name__ == '__main__':
main()
|
p03463
|
N,A,B = list(map(int,input().split()))
if abs(A-B)%2==0:
print("Alice")
else:
print("Borys")
|
N,A,B = list(map(int,input().split()))
if (B-A)%2==0:
print("Alice")
else:
print("Borys")
|
p03463
|
n,a,b = list(map(int,input().split()))
turn = 1
while abs(a-b) != 1:
if turn == 1:
if a<b:
if (b-a)%2==0 or a==1: a += 1
else: a -=1
else:
if (a-b)%2==0 or a==n: a -= 1
else: a +=1
else:
if a<b:
if (b-a)%2==1 or b==1: b += 1
else: b -=1
else:
if (a-b)%2==1 or b==n: b -= 1
else: b +=1
turn *= -1
print(('Alice' if turn==-1 else 'Borys'))
|
n,a,b = list(map(int,input().split()))
print(('Alice' if abs(b-a)%2==0 else 'Borys'))
|
p03463
|
print(('ABloircyes'[eval(input()[2:].replace(' ','-'))%2::2]))
|
print(('ABloircyes'[sum(map(int,input().split()[1:]))%2::2]))
|
p03463
|
import sys
def slove():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, a, b = list(map(int, input().rstrip('\n').split()))
if (a - b) % 2 == 0:
print("Alice")
else:
print("Borys")
if __name__ == '__main__':
slove()
|
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, a, b = list(map(int, readline().split()))
print(("Alice" if abs(a - b) % 2 == 0 else "Borys"))
if __name__ == '__main__':
solve()
|
p03463
|
N, A, B = list(map(int, input().split()))
while 1:
if A + 1 != B:
A += 1
elif A - 1 != 0:
A -= 1
else:
print("Borys")
break
if B - 1 != A:
B -= 1
elif B + 1 != N:
B += 1
else:
print("Alice")
break
|
N, A, B = list(map(int, input().split()))
if (A % 2 == 0) ^ (B % 2 == 0):
print("Borys")
else:
print("Alice")
|
p03463
|
n, a, b = list(map(int, input().split()))
if (b - a) % 2 == 0:
print("Alice")
else:
print("Borys")
|
n, a, b = list(map(int, input().split()))
if (b - a + 1) % 2:
print("Alice")
else:
print("Borys")
|
p03463
|
from sys import stdin
n,a,b = [int(x) for x in stdin.readline().rstrip().split()]
while True:
if a+1 != b:
a += 1
else:
print("Borys")
exit()
if b-1 != a:
b -= 1
else:
print("Alice")
exit()
|
from sys import stdin
n,a,b = [int(x) for x in stdin.readline().rstrip().split()]
if (b-a)%2 == 1:
print("Borys")
else:
print("Alice")
|
p03463
|
N = int(eval(input()))
A = [int(Ai) for Ai in input().split()]
cards = len(set(A))
print((cards if cards % 2 == 1 else cards - 1))
|
eval(input())
cards = len(set([Ai for Ai in input().split()]))
print((cards if cards % 2 == 1 else cards - 1))
|
p03816
|
n = int(eval(input()))
a = list(map(int, input().split()))
set_a = set(a)
nums = {}
cnt = 0
for i in set_a:
nums[i] = a.count(i)
if a.count(i) % 2 == 0:
cnt += 1
elif a.count(i) != 1:
cnt += 2
print((len(set_a) - cnt%2))
|
n = int(eval(input()))
a = list(map(int, input().split()))
set_a = set(a)
nums = {}
cnt = 0
for i in range(n):
nums[a[i]] = nums.get(a[i], 0) + 1
for i in set_a:
if nums[i] % 2 == 0:
cnt += 1
elif nums[i] != 1:
cnt += 2
print((len(set_a) - cnt%2))
|
p03816
|
N = int(eval(input()))
A = [int(x) for x in input().split()]
from collections import defaultdict as dd
Sieve = dd(lambda:0)
for a in A:
Sieve[a] += 1
ans, extra = 0, 0 #extra:同じ数を3枚選んで食べるという操作で「被りカードなし」にできない種類数
for v in list(Sieve.values()):
ans += 1
if v > 1 and (v-1)&1:
extra += 1
#extraから2枚選んで食べれば全体の種類数を減らさずに済む
print((ans if not extra&1 else ans-1))
|
N = int(eval(input()))
A = [int(x) for x in input().split()]
def count(n, Set):
if not n in Set:
Set.add(n)
return 0
else:
return 1
Sieve = set()
extra = 0
for a in A:
extra += count(a, Sieve)
print((N-extra if not extra&1 else N-extra-1))
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
A = dict(Counter(A))
even = len(list([x for x in list(A.values()) if x%2==0]))
if even % 2 == 1:
print((len(A)-1))
else:
print((len(A)))
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
ans = len(set(A))
C = Counter(A)
Even = 0
for v in list(C.values()):
if v % 2 == 0:
Even += 1
if Even % 2 == 1:
ans -= 1
print(ans)
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
ans = len(set(A))
C = Counter(A)
Even = 0
for v in list(C.values()):
if v % 2 == 0:
Even += 1
if Even % 2 == 1:
ans -= 1
print(ans)
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
even = len([c for c in list(C.values()) if c % 2 == 0])
ans = len(set(A))
if even % 2 == 0:
print(ans)
else:
print((ans - 1))
|
p03816
|
n,*l=list(map(int,open(0).read().split()))
from collections import *
c=Counter(l)
print((len(c)-sum(1-v%2 for v in list(c.values()))%2))
|
_,*l=list(map(int,open(0).read().split()))
c=len(set(l))
print((c-1+c%2))
|
p03816
|
_,*l=list(map(int,open(0).read().split()))
c=len(set(l))
print((c-1+c%2))
|
eval(input())
c=len(set(input().split()))
print((c-1+c%2))
|
p03816
|
from collections import Counter
x = int(eval(input()))
a = list(map(int,input().split()))
c = Counter(a)
suma = sum([v for v in list(c.values())])
lenc = len(c)
if suma == lenc:
print(suma)
exit()
b = suma - lenc
if b % 2 == 0:
print(lenc)
else:
print((lenc - 1))
|
from collections import Counter
x = int(eval(input()))
a = list(map(int,input().split()))
c = Counter(a)
suma = sum([v for v in list(c.values())])
lenc = len(c)
b = suma - lenc
if b % 2 == 0:
print(lenc)
else:
print((lenc - 1))
|
p03816
|
N=int(eval(input()))
A=list(map(int,input().split()))
S={}
for i in range(N):
if A[i] in S: S[A[i]]+=1
else: S[A[i]]=1
d=0
for i in list(S.values()):
d+=(i-1)
print((len(set(A))-d%2))
|
N=int(eval(input()))
K=len(set(list(map(int,input().split()))))
if K%2==0: print((K-1))
else: print(K)
|
p03816
|
from collections import Counter
n = int(eval(input()))
a = list(map(int ,input().split()))
cnt = Counter(a) # カードの値をカウント
ans = len(cnt) # 存在する値の数をカウント
if ans%2 == 0: print((ans-1)) # 存在する値の数が偶数であれば1回取り除く必要があるため-1をする
else: print(ans) # 奇数の場合はそのまま
|
n = int(eval(input()))
a = list(map(int, input().split()))
n = len(set(a))
if n%2 == 0: print((n-1))
else: print(n)
|
p03816
|
eval(input())
a = list(map(int, input().split()))
c = []
b = [i for i in a if i in c or c.append(i)]
print((len(c) if len(b) % 2 == 0 else len(c)-1))
|
eval(input())
a = list(map(int, input().split()))
c = {}
lb = lc = 0
for i in a:
try:
c[i] += 1
lb += 1
except:
c[i] = 1
lc += 1
print((lc if lb % 2 == 0 else lc-1))
|
p03816
|
from collections import Counter
n = int(eval(input()))
m = sum(v - 1 for v in list(Counter([int(i) for i in input().split()]).values()))
print((n - round(m + 0.5)))
|
eval(input());k=len(set(input().split()));print((k-1+k%2))
|
p03816
|
from collections import Counter
N = int(eval(input()))
lst = list(map(int, input().split()))
C = Counter(lst)
odd = 0
even = 0
for c in C:
if C[c] % 2 == 0:
even += 1
else:
odd += 1
if even % 2 == 0:
print((len(C)))
else:
print((len(C) - 1))
|
N = int(eval(input()))
lst = list(map(int, input().split()))
s = len(set(lst))
print(((s - 1)//2 * 2 + 1))
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
C = list(Counter(A).items())
M = len(C)
print((M if (N-M)%2==0 else M-1))
|
# python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = len(list(Counter(A).values()))
if cnt%2==0:
print((cnt-1))
else:
print(cnt)
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
ans = N
l = 1
r = 10**5
while l != r or (l == r and C[l] > 1):
while C[l] <= 1:
l += 1
while C[r] <= 1:
r -= 1
if l != r:
res = min(C[l], C[r]) - 1
else:
res = C[l]//2
C[l] -= res
C[r] -= res
ans -= 2*res
print(ans)
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
ans = len(C)
if (N-ans) % 2 == 1:
ans -= 1
print(ans)
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
ans = len(C)
if (N-ans) % 2 == 1:
ans -= 1
print(ans)
|
N = int(eval(input()))
A = list(map(int, input().split()))
S = set(A)
ans = len(S)
if (N-ans) % 2 == 1:
ans -= 1
print(ans)
|
p03816
|
N = int(eval(input()))
A = list(map(int,input().split()))
count = 0
for i in range(max(A)):
if A.count(i+1) > 0:
count += A.count(i+1) -1
N = N - 2*(count // 2 + count % 2)
print(N)
|
N = int(eval(input()))
A = list(map(int,input().split()))
count = [0]*max(A)
for i in A:
count[i-1] += 1
count = [i for i in count if i != 0]
count = sum(count) - len(count)
N = N - 2*(count // 2 + count % 2)
print(N)
|
p03816
|
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = Counter()
for i in range(n):
cnt[a[i]] += 1
for a in cnt:
cnt[a] %= 2
z_o = list(cnt.values())
if list(z_o).count(0) % 2 == 0:
print((len(cnt)))
else:
print((len(cnt) - 1))
|
n = int(eval(input()))
a = list(map(int, input().split()))
a_set = set(a)
if len(a_set) % 2 == 0:
print((len(a_set) - 1))
else:
print((len(a_set)))
|
p03816
|
N=int(eval(input()))
*A,=list(map(int,input().split()))
cnt = {}
for a in A:
cnt[a] = cnt.get(a,0)+1
keys = sorted(cnt.keys())
i = 0
j = len(keys)-1
while i <= j:
ki,kj = keys[i],keys[j]
if cnt[ki]<=1:
i+=1
continue
if cnt[kj]<=1:
j-=1
continue
cnt[ki] -= 1
cnt[kj] -= 1
print((sum(cnt.values())))
|
N = int(eval(input()))
*A, = list(map(int,input().split()))
c = {}
for a in A:c[a] = c.get(a,0)+1
print((len(c) - sum(v-1 for v in list(c.values()))%2))
|
p03816
|
N = int(eval(input()))
A = list(map(int, input().split()))
m = {}
eat = 1
for a in A:
if a in m:
eat += 1
else:
m[a] = 1
print((N - 2 * (eat // 2)))
|
N = int(eval(input()))
A = list(map(int, input().split()))
d = {}
for a in A:
d[a] = 1
print((len(d) - (0 if len(d) % 2 else 1)))
|
p03816
|
import functools
N = int(eval(input()))
A = list(map(int, input().split()))
d = [0 for i in range(10 ** 5 + 1)]
for a in A:
d[a] = 1
s = sum(d)
print((s - (0 if s % 2 else 1)))
|
N = int(eval(input()))
A = list(map(int, input().split()))
d = [0 for i in range(10 ** 5 + 1)]
for a in A:
d[a] = 1
s = sum(d)
print((s - (0 if s % 2 else 1)))
|
p03816
|
N = int(eval(input()))
A = list(map(int, input().split()))
MAX_A = 10**5
dp = [0] * (MAX_A + 1)
for i in range(N):
dp[A[i]] += 1
tmp = 0
for j in range(MAX_A + 1):
if dp[j] > 0:
tmp += dp[j] - 1
tmp += tmp % 2
print((N - tmp))
|
N = int(eval(input()))
A = list(map(int, input().split()))
s = set(A)
k = len(s)
if k % 2:
ans = k
else:
ans = k - 1
print(ans)
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
C = Counter(A)
ret = len(C)
cnt = []
for v in list(C.values()) :
if v >= 2 :
cnt.append(v - 1)
s = sum(cnt)
for c in cnt :
if c > s // 2 :
ret -= (2 * c - s) % 2
break
else :
ret -= s % 2
print(ret)
|
N = int(eval(input()))
A = [int(i) for i in input().split()]
l = len(set(A))
print((l - (N - l) % 2))
|
p03816
|
import sys
stdin = sys.stdin
def na(): return list(map(int, stdin.readline().split()))
def ns(): return stdin.readline().strip()
def ni(): return int(stdin.readline())
n = ni()
a = na()
lst = []
c=0
for i in a:
if(i not in lst):
lst.append(i)
c = c+1
if(c%2 == 0):c=c-1
print(c)
|
import sys
stdin = sys.stdin
def na(): return list(map(int, stdin.readline().split()))
def ns(): return stdin.readline().strip()
def ni(): return int(stdin.readline())
n = ni()
a = na()
st = set()
for i in a:
if(i not in st):
st.add(i)
c = len(st)
if(c%2 == 0):c=c-1
print(c)
|
p03816
|
from collections import defaultdict as dd
from functools import reduce
if __name__ == "__main__":
N = int(eval(input()))
arr = list(map(int, input().split()))
dic = dd(int)
for el in arr:
dic[el] += 1
count = len(dic) - len(list([x for x in list(dic.values()) if x %
2 == 0])) % 2
print(count)
|
from collections import Counter
from functools import reduce
if __name__ == "__main__":
N = int(eval(input()))
arr = list(map(int, input().split()))
dic = Counter(arr)
count = len(dic) - reduce(lambda sum, item: sum + 1, [x for x in list(dic.values()) if x % 2 == 0], 0) % 2
print(count)
|
p03816
|
N = int(eval(input()))
list_card = list(map(int, input().split()))
count = 0
for x in set(list_card):
count += list_card.count(x) - 1
print((N - (count + count%2)))
|
N = int(eval(input()))
list_card = list(map(int, input().split()))
##count = 0
##for x in set(list_card):
## count += list_card.count(x) - 1
M = N - len(set(list_card))
print((N - (M + M%2)))
|
p03816
|
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
from collections import Counter
N = int(eval(input()))
aN = list(map(int, input().split()))
dups = Counter(aN)
for k, v in list(dups.items()):
dups[k] -= 1
aN = sorted(set(aN))
if sum(dups.values()) % 2 == 0:
print((len(aN)))
else:
print((len(aN)-1))
|
# -*- coding: utf-8 -*-
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
A = LIST()
C = Counter(A)
for k in list(C.keys()):
C[k] -= 1
cnt = ceil(sum(C.values()), 2)
ans = N - cnt * 2
print(ans)
|
p03816
|
from collections import defaultdict
def main():
n = int(eval(input()))
card_list = list(map(int, input().split()))
ans = len(set(card_list))
d = defaultdict(int)
for card in card_list:
d[card] += 1
one, two = 0, 0
for card, num in list(d.items()):
if num % 2 == 1:
one += 1
else:
two += 1
print((ans - two % 2))
if __name__ == '__main__':
main()
|
from collections import defaultdict
def main():
n = int(eval(input()))
a_list = list(map(int, input().split()))
s = len(set(a_list))
if (len(a_list) - s) % 2 != 0:
print((s - 1))
else:
print(s)
if __name__ == '__main__':
main()
|
p03816
|
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
S=[]
D=[]
for i in A:
if i in S:
D.append(i)
else:
S.append(i)
S=set(S)
import sys
if D==[]:
print(N)
sys.exit()
M=N-len(D)
if len(D)%2==1:
print((M-1))
else:
MaxD,MinD=D[-1],D[0]
Med=-1
for i in S:
if MinD<=i<=MaxD:
Med=i
print(M)
break
if Med==-1:
print((M-2))
|
N=int(eval(input()));A=list(map(int,input().split()));S=len(set(A));print((S-1+S%2))
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
num = len(Counter(A))
print((num - (N-num)%2))
|
# 入力
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(ns())
def nf(): return float(ns())
n = ni()
a = li()
unique = set(a)
doub = len(a) - len(unique)
if doub % 2 == 0:
print((len(unique)))
else:
print((len(unique) - 1))
|
p03816
|
n = int(eval(input()))
a = list(map(int, input().split()))
s = []
c = 0
for i in a:
if not i in s:
s.append(i)
else:
c += 1
print((n - 2 * ((c + 1) // 2)))
|
n = int(eval(input()))
a = list(map(int, input().split()))
b = set(a)
print((n - 2 * ((n - len(b) + 1) // 2)))
|
p03816
|
from collections import Counter
n = int(eval(input()))
A = sorted(list(map(int,input().split())))
c = Counter(A)
lst = list(c.values())
l,r = 0, len(lst)-1
while sum(lst) > len(lst):
if lst[l] <= 1:
l += 1
continue
else:
if lst[r] <= 1:
r -= 1
continue
else:
lst[l] -= 1
lst[r] -= 1
print((sum(lst)))
|
from collections import Counter
n = int(eval(input()))
A = sorted(list(map(int,input().split())))
c = list(Counter(A).values())
ans = len(c)
d = [i-1 for i in c]
print((ans if sum(d)%2==0 else ans-1))
|
p03816
|
from collections import*
from heapq import*
n,*a=list(map(int,open(0).read().split()))
q=[-t for t in list(Counter(a).values())]
heapify(q)
while q[0]<-1:
p=heappop(q)
if p<-2:
heappush(q,p+2)
else:
heappush(q,p+1)
r=heappop(q)
if r<-1:
heappush(q,r+1)
print((len(q)))
|
_,a=open(0);k=len(set(a.split()));print((k-(k%2<1)))
|
p03816
|
_,a=open(0);k=len(set(a.split()));print((k-(k%2<1)))
|
_,a=open(0);k=len(set(a.split()));print((k-1+k%2))
|
p03816
|
N= int(input())
a = list(map(int, input().split()))
a.sort()
while(True):
is_finish = False
mn = min(a)
while(a.count(mn) == 1):
idx = a.index(mn)+1
if idx >= len(a):
mn = min(a)
break
else:
mn = a[idx]
mx = max(a)
while(a.count(mx) == 1):
idx = a.index(mx) - 1
if idx < 0 or mx == mn :
mx = max(a)
is_finish = True
break
else :
mx = a[idx]
if is_finish :
break
else:
a.remove(mn)
a.remove(mx)
print(len(a))
|
N = int(input())
a = set(map(int, input().split()))
print(len(a) if len(a) % 2 != 0 else len(a)-1)
|
p03816
|
from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
#print(A)
Ac = Counter(A).most_common()
#print(Ac)
ans = 0
for i in range(len(Ac)):
if Ac[i][1] > 1:
ans += Ac[i][1]-1
print((N-ans if ans%2 == 0 else N-ans-1))
|
from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
Ac = Counter(A).most_common()
#print(Ac)
ans = 0
for i in range(len(Ac)):
if Ac[i][1] > 1:
ans += Ac[i][1]-1
print((N-ans if ans%2 == 0 else N-ans-1))
|
p03816
|
from collections import defaultdict
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
d = defaultdict(int)
for a in a_list:
d[a] += 1
print((len(list(d.keys())) - sum([1 for v in list(d.values()) if v % 2 == 0]) % 2))
|
from collections import defaultdict
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
d = defaultdict(int)
for a in a_list:
d[a] += 1
print((len(list(d.keys())) - sum([1 - v % 2 for v in list(d.values())]) % 2))
|
p03816
|
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
k=1
lst=[]
for i in range(1,n):
if a[i]==a[i-1]:
k+=1
else:
lst.append(k)
k=1
lst.append(k)
m=len(lst)
count=0
for i in range(m):
if lst[i]%2==0:
lst[i]=2
count+=1
else:
lst[i]=1
if count%2==0:
print(m)
else:
print((m-1))
|
n=int(eval(input()))
a=list(map(int,input().split()))
a=len(set(a))
if a%2==0:
print((a-1))
else:
print(a)
|
p03816
|
n = int(eval(input()))
a = len(set(list(map(int,input().split()))))
if a%2==0:
print((a-1))
else:
print(a)
|
eval(input());a=len(set(input().split()));print((a-1+a%2))
|
p03816
|
from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split(" ")))
c = Counter(a)
ref = [v-1 for k, v in list(c.items()) if v != 1]
ans = N - ((sum(ref)+1)//2)*2
print(ans)
|
N = int(eval(input()))
a = list(map(int, input().split(" ")))
uni = len(list(set(a)))
if uni % 2 == 0:
uni -= 1
print(uni)
|
p03816
|
n = int(eval(input()))
l = len(set(list(map(int, input().split()))))
print((l - 1 if (n - l) % 2 else l))
|
n = int(eval(input()))
l = len(set(map(int, input().split())))
print((l - (n - l) % 2))
|
p03816
|
def main():
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_left,bisect_right
from math import floor, ceil
#from operator import itemgetter
#mod = 1000000007
N = int(eval(input()))
A = list(map(int, input().split()))
a = len(set(A))
res = len(A)-a
if res%2==0:
print(a)
else:
print((a-1))
if __name__ == '__main__':
main()
|
input()
A = list(map(int, input().split()))
a = len(set(A))
res = len(A)-a
print(a-1) if res%2 else print(a)
|
p03816
|
import collections
n = int(input())
ais = list(map(int, input().split()))
cc = collections.Counter(ais)
k = n - len(cc)
print(len(cc) - (1 if (n - len(cc)) % 2 == 1 else 0))
|
n,s = int(input()),set(map(int, input().split()))
print(len(s) - (1 if (len(s) & 1 == 0) else 0))
|
p03816
|
#coding: UTF-8
import time
import collections
N=int(eval(input()))
lis=list(map(int, input().split()))
#kind=set(lis)
#kindn=len(kind)
kind_dict=collections.Counter(lis)
kindn=len(kind_dict)
out=0
for i in kind_dict:
if kind_dict[i]%2==0:
out+=1
if out%2==0:
print(kindn)
else:
print((kindn-1))
|
#coding: UTF-8
N=int(eval(input()))
lis=list(map(int, input().split()))
kind_dict={}
for i in lis:
if i in kind_dict:
kind_dict[i]+=1
else:
kind_dict[i]=1
kindn=len(kind_dict)
out=0
for i in kind_dict:
if kind_dict[i]%2==0:
out+=1
if out%2==0:
print(kindn)
else:
print((kindn-1))
|
p03816
|
N = int(eval(input()))
A = list(map(int,input().split(" ")))
dic = {}
one = []
for i in range(N):
if not A[i] in one:
one.append(A[i])
ans = len(one)
print((ans - ((ans+1) % 2)))
|
N = int(eval(input()))
A = list(map(int,input().split(" ")))
print((len(set(A)) - ((len(set(A))+1) % 2)))
|
p03816
|
from collections import Counter
N=int(eval(input()))
A=sorted(map(int,input().split()))
li=[]
i=0
while(i<N):
cnt=0
j=i
while(j<N and A[i]==A[j]):
cnt+=1
j+=1
li.append(cnt-1)
i=j
l=len(li)
for i in range(l):
for j in range(i+1,l):
if li[i]==0:
break
d=min(li[i],li[j])
li[i]-=d
li[j]-=d
for i in range(l):
li[i]%=2
ans=len(set(A))
for i in range(l):
ans-=li[i]
print(ans)
|
N=int(eval(input()))
k=len(set(list(map(int,input().split()))))
print((k if k%2 else k-1))
|
p03816
|
# 同じカードが3枚以上ある場合は2枚ずつ減らせる
# 3枚以上で奇数の場合->1枚残る
# 3枚以上で偶数の場合->2枚残る
# 同じカードが2枚の場合
# 2枚のペアが２つ存在する場合
# 片方のペアから2枚選べば、両方の数字を1にできる
# ペアの数を2で割った数（切り捨て）*2のカードを減らせる
# 2枚のペアが1つ残ったとき
# そのときの全体数-2が答え
# 2枚のペアが残ってなければそのまま答え
N=int(eval(input()))
A=sorted(list(map(int,input().split())))
card=N
pairs=0
import itertools
for key,g in itertools.groupby(A):
num=len(list(g))
if num>2:
if num&1:
card-=(num-1)
else:
card-=(num-2)
pairs+=1
elif num==2:
pairs+=1
if pairs>1:
card-=(pairs//2)*2
if pairs&1:
card-=2
print(card)
|
N,*A=list(map(int,open(0).read().split()))
A=len(set(A))
print(((A-1,A)[A&1]))
|
p03816
|
def d_card_eater(N, A):
# 解説どおり
from collections import Counter
kind = len(set(A)) # 数列に現れる値の種類の数
ans = kind if kind % 2 == 1 else kind - 1
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((d_card_eater(N, A)))
|
def d_card_eater(N, A):
# 解説どおり
kind = len(set(A)) # 数列に現れる値の種類の数
ans = kind if kind % 2 == 1 else kind - 1
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((d_card_eater(N, A)))
|
p03816
|
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
MOD = 1000000007
def main():
N, *A = list(map(int, read().split()))
counter = Counter(A)
odd = even = 0
for v in list(counter.values()):
if v % 2 == 0:
even += 1
else:
odd += 1
if even % 2 == 0:
ans = odd + even
else:
ans = odd + even - 1
print(ans)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = list(map(int, read().split()))
K = len(set(A))
if K % 2 == 1:
ans = K
else:
ans = K - 1
print(ans)
return
if __name__ == '__main__':
main()
|
p03816
|
n=int(eval(input()))
a=sorted([int(i) for i in input().split()])
def groupby(a):
a2=[[a[0],1]]
for i in range(1,len(a)):
if a2[-1][0]==a[i]:
a2[-1][1]+=1
else:
a2.append([a[i],1])
return a2
a=groupby(a)
#print(a)
l=len(a)
for i in range(l):
if a[i][1]%2==0:
a[i][1]=2
else:
a[i][1]=1
c=0
for i in range(l):
if a[i][1]==2:
c+=1
if c%2==0:
print(l)
else:
print((l-1))
|
n=int(eval(input()))
def groupby(a):
a2=[[a[0],1]]
for i in range(1,len(a)):
if a2[-1][0]==a[i]:
a2[-1][1]+=1
else:
a2.append([a[i],1])
return a2
b=groupby(sorted([int(i) for i in input().split()]))
l=len(b)
co=0
for i in range(l):
co+=(b[i][1]-1)
if co%2==0:
print(l)
else:
print((l-1))
|
p03816
|
import abc
class AdjacentGraph:
"""Implementation adjacency-list Graph.
Beware ids are between 1 and size.
"""
def __init__(self, size):
self.size = size
self._nodes = [[0] * (size+1) for _ in range(size+1)]
def set_adj_node(self, id_, adj_id):
self._nodes[id_][adj_id] = 1
def __iter__(self):
self._id = 0
return self
def __next__(self):
if self._id < self.size:
self._id += 1
return (self._id, self._nodes[self._id][1:])
raise StopIteration()
def dfs(self, handler=None):
def find_first():
try:
return visited.index(0) + 1
except ValueError:
return None
visited = [0] * self.size
first = 1
while first is not None:
stack = [(first, 0, 0)]
while len(stack) > 0:
i, depth, j = stack.pop()
if j == 0:
if handler:
handler.visit(i, depth)
visited[i-1] = 1
yield i
try:
j = self._nodes[i].index(1, j+1)
stack.append((i, depth, j))
if visited[j-1] == 0:
stack.append((j, depth+1, 0))
except ValueError:
if handler:
handler.leave(i)
first = find_first()
def bfs(self, handler=None):
def find_first():
try:
return visited.index(0) + 1
except ValueError:
return None
visited = [0] * self.size
first = 1
while first is not None:
queue = [(first, 0)]
while len(queue) > 0:
(i, depth), *queue = queue
if visited[i-1] == 0:
if handler:
handler.visit(i, depth)
visited[i-1] = 1
yield i
try:
j = 0
while j < self.size:
j = self._nodes[i].index(1, j+1)
if visited[j-1] == 0:
queue.append((j, depth+1))
except ValueError:
if handler:
handler.leave(i)
first = find_first()
class EventHandler(abc.ABC):
@abc.abstractmethod
def visit(self, i, depth):
pass
@abc.abstractmethod
def leave(self, i):
pass
class Logger(EventHandler):
def __init__(self, n):
self.log = [(0, 0)] * n
self.step = 0
def visit(self, i, depth):
self.step += 1
self.log[i-1] = (self.step, depth, 0)
def leave(self, i):
self.step += 1
self.log[i-1] = (self.log[i-1][0], self.log[i-1][1], self.step)
def by_node(self):
i = 1
for discover, depth, finish in self.log:
yield (i, discover, depth, finish)
i += 1
def run():
n = int(eval(input()))
g = AdjacentGraph(n)
log = Logger(n)
for i in range(n):
id_, c, *links = [int(x) for x in input().split()]
for n in links:
g.set_adj_node(id_, n)
for i in g.bfs(log):
pass
reachable = None
for node in log.by_node():
id_, find, dep, exit = node
if id_ > 1 and dep == 0:
reachable = find - 1
if reachable is not None and find > reachable:
dep = -1
print(("{} {}".format(id_, dep)))
if __name__ == '__main__':
run()
|
import abc
class AdjacentGraph:
"""Implementation adjacency-list Graph.
Beware ids are between 1 and size.
"""
def __init__(self, size):
self.size = size
self._nodes = [[0] * (size+1) for _ in range(size+1)]
def set_adj_node(self, id_, adj_id):
self._nodes[id_][adj_id] = 1
def __iter__(self):
self._id = 0
return self
def __next__(self):
if self._id < self.size:
self._id += 1
return (self._id, self._nodes[self._id][1:])
raise StopIteration()
def dfs(self, handler=None):
def find_first():
try:
return visited.index(0) + 1
except ValueError:
return None
visited = [0] * self.size
first = 1
while first is not None:
stack = [(first, 0, 0)]
while len(stack) > 0:
i, depth, j = stack.pop()
if j == 0:
if handler:
handler.visit(i, depth)
visited[i-1] = 1
yield i
try:
j = self._nodes[i].index(1, j+1)
stack.append((i, depth, j))
if visited[j-1] == 0:
stack.append((j, depth+1, 0))
except ValueError:
if handler:
handler.leave(i)
first = find_first()
def bfs(self, handler=None):
def find_first():
try:
return visited.index(0) + 1
except ValueError:
return None
visited = [0] * self.size
first = 1
while first is not None:
queue = [(first, 0)]
while len(queue) > 0:
(i, depth), *queue = queue
if visited[i-1] == 0:
if handler:
handler.visit(i, depth)
visited[i-1] = 1
yield i
try:
j = 0
while j < self.size:
j = self._nodes[i].index(1, j+1)
if visited[j-1] == 0:
queue.append((j, depth+1))
except ValueError:
pass
if handler:
handler.leave(i)
first = find_first()
class EventHandler(abc.ABC):
@abc.abstractmethod
def visit(self, i, depth):
pass
@abc.abstractmethod
def leave(self, i):
pass
class Logger(EventHandler):
def __init__(self, n):
self.log = [(0, 0)] * n
self.step = 0
def visit(self, i, depth):
self.step += 1
self.log[i-1] = (self.step, depth, 0)
def leave(self, i):
self.step += 1
self.log[i-1] = (self.log[i-1][0], self.log[i-1][1], self.step)
def by_node(self):
i = 1
for discover, depth, finish in self.log:
yield (i, discover, depth, finish)
i += 1
def run():
n = int(eval(input()))
g = AdjacentGraph(n)
log = Logger(n)
for i in range(n):
id_, c, *links = [int(x) for x in input().split()]
for n in links:
g.set_adj_node(id_, n)
for i in g.bfs(log):
pass
reachable = None
for node in log.by_node():
id_, find, dep, exit = node
if id_ > 1 and dep == 0:
reachable = find - 1
if reachable is not None and find > reachable:
dep = -1
print(("{} {}".format(id_, dep)))
if __name__ == '__main__':
run()
|
p02239
|
while True:
n, m, a = list(map(int, input().split()))
if n + m + a == 0:
break
lines = list(sorted([tuple(map(int, input().split())) for _ in range(m)]))
replace = list(range(1, n+1))
for l in lines:
_, p, q = l
p -= 1
q -= 1
replace[p], replace[q] = replace[q], replace[p]
print((replace[a-1]))
|
while True:
# num_columns: ????£?????????°
# num_lines: ?¨??£?????????°(???????????????2????´???????????????°)
# entry: ????????????????????????????§?????????´????????????
num_columns, num_lines, entry = list(map(int, input().split()))
if num_columns == 0 and num_lines == 0 and entry == 0:
break
lines = []
for _ in range(num_lines):
height, p, q = list(map(int, input().split()))
lines.append((height, p-1, q-1)) # ????????????0?????????????§????????????§???????????????
# lines??????????????????????????§???????????????????????????????´?????¨??£???????????????\???????????§
# ??????????????????????????°??????????????????????????????
lines.sort()
lines.reverse()
# ??????2??????????????§???lines????????????????´??????§?????????????????¶
result = list(range(1, num_columns+1)) # ??????????§????????????´????????¨????????????
for line in lines:
height, p, q = line
# ?????????`replace`???p????????¨q?????????????????????
result[p], result[q] = result[q], result[p]
for index, element in enumerate(result):
if element == entry:
print((index + 1)) # ????????????0?????????????§????????????§???????????????
break
# print(result.index(entry) + 1) ??§?????????
|
p01126
|
a=input()
ary=list(a)
count = 0
tmp=""
for i,v in enumerate(ary):
if v == tmp:
del(ary[i])
tmp=v
else:
tmp=v
def countStr(arys):
cW=0
cB=0
for i in arys:
if i == "B":
cB += 1
else:
cW += 1
return cW, cB
while len(set(ary)) != 1:
count += 1
#W, B=countStr(ary)
if ary[len(ary)-1] == "W":
ary.append("B")
m = 2
for i in ary:
if ary[len(ary)-m] == "W":
ary[len(ary)-m] = "B"
m += 1
else:
break
else:
ary.append("W")
m=2
for i in ary:
if ary[len(ary)-m] == "B":
ary[len(ary)-m] = "W"
m += 1
else:
break
print(count)
|
a=input()
ary=list(a)
count = 0
tmp=ary[0]
for i,v in enumerate(ary):
if v == tmp:
tmp=v
else:
tmp=v
count += 1
print(count)
|
p03947
|
s=input()
l=0
r=len(s)-1
news=""
i=0
while i<len(s):
if s[i]=="W":
while i<len(s) and s[i]=="W":
i+=1
news+=s[i-1]
else:
while i<len(s) and s[i]=="B":
i+=1
news+=s[i-1]
print((len(news)-1))
|
s=input()
now=s[0]
ans=0
for i in range(1,len(s)):
if now!=s[i]:
ans+=1
now=s[i]
print(ans)
|
p03947
|
def main():
s = input()
check_b = lambda x: x=='B'
check_w = lambda x: x=='W'
if all(map(check_b, list(s))) or all(map(check_w, list(s))):
return 0
work = list(s)[:]
flag_b = False
flag_w = False
stack = []
cnt = 0
for i in range(len(work)-1):
w_list = work[i:i+2]
if w_list[0] == w_list[1]:
pass
else:
cnt += 1
return cnt
if __name__ == '__main__':
print(main())
|
def main():
s = input()
check_b = lambda x: x=='B'
check_w = lambda x: x=='W'
if all(map(check_b, list(s))) or all(map(check_w, list(s))):
return 0
work = list(s)[:]
cnt = 0
for i in range(len(work)-1):
w_list = work[i:i+2]
if w_list[0] == w_list[1]:
pass
else:
cnt += 1
return cnt
if __name__ == '__main__':
print(main())
|
p03947
|
# ABC_129 C
def stairs(n, a):
num_list = [i for i in range(n+1) if i not in a]
dp = [0 for _ in range(n+1)]
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in num_list:
if i > 1:
dp[i] = dp[i-1] + dp[i-2]
result = dp[n] % 1000000007
print(result)
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
if __name__ == '__main__':
stairs(n, a)
|
# ABC_129 C
def stairs(n, a):
num_list = set(i for i in range(n+1) if i not in a)
dp = [0 for _ in range(n+1)]
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in num_list:
if i > 1:
dp[i] = dp[i-1] + dp[i-2]
result = dp[n] % 1000000007
print(result)
n, m = list(map(int, input().split()))
a = set(int(eval(input())) for _ in range(m))
if __name__ == '__main__':
stairs(n, a)
|
p03013
|
import sys
sys.setrecursionlimit(10 ** 6)
N, M = list(map(int, input().split()))
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(eval(input()))
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
if ANS[x + 1] is None:
x1 = f(x + 1)
ANS[x + 1] = x1
else:
x1 = ANS[x + 1]
if ANS[x + 2] is None:
x2 = f(x + 2)
ANS[x + 2] = x1
else:
x2 = ANS[x + 2]
ans = x1 + x2
# ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print((f(0) % 1000000007))
|
import sys
sys.setrecursionlimit(10 ** 6)
N, M = list(map(int, input().split()))
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(eval(input()))
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print((f(0) % 1000000007))
|
p03013
|
import sys
sys.setrecursionlimit(10 ** 6)
N, M = list(map(int, input().split()))
A = []
for _ in range(M):
a = int(eval(input()))
A.append(a)
dp = []
for i in range(N + 1):
dp.append(None)
dp.append(0)
dp[N] = 1
for i in range(N - 1, -1, -1):
if i in A:
dp[i] = 0
continue
dp[i] = (dp[i + 1] + dp[i + 2]) % 1000000007
# print('dp', dp)
print((dp[0]))
|
N, M = list(map(int, input().split()))
A = []
dp = []
for i in range(N + 1):
dp.append(None)
A.append(None)
for _ in range(M):
a = int(eval(input()))
A[a] = 1
dp.append(0)
dp[N] = 1
for i in range(N - 1, -1, -1):
if A[i]:
dp[i] = 0
continue
dp[i] = dp[i + 1] + dp[i + 2]
# print('dp', dp)
print((dp[0] % 1000000007))
|
p03013
|
N, M = list(map(int, input().split()))
A = []
dp = []
for i in range(N + 1):
dp.append(None)
A.append(None)
for _ in range(M):
a = int(eval(input()))
A[a] = 1
dp.append(0)
dp[N] = 1
for i in range(N - 1, -1, -1):
if A[i]:
dp[i] = 0
continue
dp[i] = dp[i + 1] + dp[i + 2]
# print('dp', dp)
print((dp[0] % 1000000007))
|
N, M = list(map(int, input().split()))
A = set()
dp = []
for i in range(N + 1):
dp.append(None)
for _ in range(M):
a = int(eval(input()))
A.add(a)
dp.append(0)
dp[N] = 1
for i in range(N - 1, -1, -1):
if i in A:
dp[i] = 0
continue
dp[i] = dp[i + 1] + dp[i + 2]
# print('dp', dp)
print((dp[0] % 1000000007))
|
p03013
|
N, M = list(map(int, input().split()))
A = []
for i in range(M):
A.append(int(eval(input())))
X = [0] * (N + 1)
for i in range(N + 1):
if i == 0:
X[i] = 1
elif i == 1:
if 1 not in A:
X[i] = 1
else:
X[i] = 0
else:
if i in A:
X[i] = 0
else:
X[i] = (X[i - 1] + X[i - 2]) % 1000000007
print((X[N]))
|
N, M = list(map(int, input().split()))
A = []
for i in range(M):
A.append(int(eval(input())))
X = [0] * (N + 1)
for i in A:
X[i] = -1
for i in range(N + 1):
if i == 0:
X[i] = 1
elif i == 1:
if X[i] == -1:
X[i] = 0
else:
X[i] = 1
else:
if X[i] == -1:
X[i] = 0
else:
X[i] = (X[i - 1] + X[i - 2]) % 1000000007
print((X[N]))
|
p03013
|
n, m = list(map(int, input().split()))
list_score = set([int(eval(input())) for _ in range(m)])
dp = [0] * (n + 1)
mod = pow(10, 9) + 7
dp[0] = 1
if 1 in list_score:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, n + 1):
if i not in list_score:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print((dp[n]))
|
n, m = list(map(int, input().split()))
set_A = set()
dp = [0]*n
mod = pow(10, 9) + 7
for _ in range(m):
set_A.add(int(eval(input())))
if 1 not in set_A:
dp[0] = 1
if 2 not in set_A and n != 1:
dp[1] = 1 + dp[0]
for i in range(2, n):
if i + 1 not in set_A:
dp[i] += (dp[i-1] + dp[i-2])%mod
print((dp[n-1]))
|
p03013
|
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
# f = open('C_input_29.txt')
# lines = f.readlines()
# f.close()
# N, M = map(int, lines[0].split())
# A = []
# for line in lines[1:]:
# A.append(int(line))
N, M = LI()
A = [_I() for i in range(M)]
# if M != 0:
# # 連続した壊れた段がある場合は0
# B = [i for i in A]
# B.remove(B[0])
# B.append(10**15+100)
# diffs = [b - a for a, b in zip(A,B)]
# # print(diffs)
# if any(i == 1 for i in diffs):
# # 隣同士なので0
# print(0)
# exit()
# print('hoge')
"""
考え方
xにたどり着く通りは、x-1とx-2段目にたどり着く通りの合計
dp
3が障害のとき
1へは1通り
2へは0からと1からの2通り
3へは0通り
4へは2からの2通りと、3からの0通りで2通り
5へは3からの0通りと4からの2通りで2通り
6へは4からの2通りと5からの2通りで4通り
"""
# dp = {}
dp = [0 for i in range(N+1)]
# print('fua')
dp[0] = 1
dp[1] = 1 if 1 not in A else 0
# [dp.update({i: (dp[i-1] + dp[i-2])%mod}) if i not in A else dp.update({i: 0}) for i in range(2, N+1)]
for i in range(2, N+1):
# print(i)
# i段目までの通りを計算する
if i not in A:
# i段目が障害のときは0になっているので飛ばす
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print(dp[N])
|
# -*- coding: utf-8 -*-
import sys
mod = 10 ** 9 + 7
def get_nums(n):
res = [0 for _ in range(n)]
for i in range(n):
res[i] = int(eval(input()))
return res
def get_numbers():
return list(map(int, input().split()))
n, m = get_numbers()
a = set(get_nums(m))
dp = [0 for _ in range(n + 1)]
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in range(2, n + 1):
if i not in a:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print((dp[-1]))
|
p03013
|
import sys
n, m = list(map(int, input().split()))
A = []
for i in range(m):
A.append(int(eval(input())))
dp = [0] * (n+1)
mod = 1000000007
dp[0] = 1
if 1 in A:
if 2 in A:
print((0))
sys.exit()
else:
dp[1] = 1
for i in range(2, n+1):
if i in A:
dp[i] = 0
else:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1]))
|
n, m = list(map(int, input().split()))
mod = 1e9 + 7
ok = [True] * (n+1)
for i in range(m):
a = int(eval(input()))
ok[a] = False
dp = [0] * (n+1)
dp[0] = 1
for i in range(n):
for j in range(i+1, 1 + min(n, i + 2)):
if ok[j]:
dp[j] += dp[i]
dp[j] %= mod
print((int(dp[-1])))
|
p03013
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
dp[i] = min(dp[i], (dp[i-1] + dp[i-2]))
print((dp[n] % 1000000007))
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
dp[i] = min(dp[i], (dp[i-1] + dp[i-2])%(10**9+7))
print((dp[n]))
|
p03013
|
n,m = list(map(int,input().split()))
xx = [int(eval(input())) for _ in range(m)]
f = [0]*(n+3)
f[0] = 1
endf = 0
for i in range(1,n+1):
if i in xx:
endf += 1
if endf ==2:
print((0))
break
continue
else :
if endf == 1:
endf = 0
f[i] = f[i-2]
else :
endf = 0
f[i] = f[i-1] + f[i-2]
else:
print((f[n]%1000000007))
|
n,m = list(map(int,input().split()))
mod = 10**9+7
dp = [1]*(n+1)
for i in range(m):
dp[int(eval(input()))] =0
for i in range(2,n+1):
if dp[i]!=0:
dp[i]=dp[i-1]+dp[i-2]
print((dp[n]%mod))
|
p03013
|
n, m = list(map(int, input().split()))
a_l = [ int(eval(input())) for _ in range(m) ]
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a_l:
dp[1] = 1
else:
dp[1] = 0
if n > 1:
if 2 not in a_l:
dp[2] = dp[0] + dp[1]
else:
dp[2] = 0
for i in range(2,n+1):
if i not in a_l:
dp[i] = (dp[i-1] + dp[i-2])%1000000007
else:
dp[i] = 0
print((dp[-1]))
|
n, m = list(map(int, input().split()))
a_l = [ int(eval(input())) for _ in range(m) ]
dp = [1] * (n+1)
dp[0] = 1
if 1 not in a_l:
dp[1] = 1
else:
dp[1] = 0
if n > 1:
for i in a_l:
dp[i] = 0
if 2 not in a_l:
dp[2] = dp[0] + dp[1]
else:
dp[2] = 0
for i in range(2,n+1):
if dp[i] != 0:
dp[i] = (dp[i-1] + dp[i-2])%1000000007
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
s = [1] * (n + 1)
if 1 in a:
s[1] = 0
for i in range(2, n + 1):
if i in a:
s[i] = 0
else:
if s[i - 2] == 0 and s[i - 1] == 0:
print((0))
exit()
else:
s[i] = s[i - 1] + s[i - 2]
print((s[n] % 1000000007))
|
n, m = list(map(int, input().split()))
s = [1] * (n + 1)
for i in range(m):
a = int(eval(input()))
s[a] = 0
for i in range(2, n + 1):
if s[i] == 0:
continue
else:
if s[i - 2] == 0 and s[i - 1] == 0:
print((0))
exit()
else:
s[i] = s[i - 1] + s[i - 2]
print((s[n] % 1000000007))
|
p03013
|
import math
def perm(n, r):
return math.factorial(n) // math.factorial(n - r)
def comb(n, r):
return perm(n, r) // math.factorial(r)
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
for i in range(m - 1):
if A[i + 1] - A[i] == 1:
ans = 0
print(ans)
exit()
S = []
for a in A:
S.extend((a - 1, a, a + 1))
S.insert(0, 0)
S.append(n)
ans = 1
for i in range(len(S) - 1):
r = S[i + 1] - S[i]
if r > 1:
c = 0
t_max = r // 2
for t in range(t_max + 1):
c += comb(r - t, t)
ans *= c
ans %= 10**9 + 7
print(ans)
|
n, m = list(map(int, input().split()))
S = [1] * (n + 1)
for _ in range(m):
a = int(eval(input()))
S[a] = 0
i = -3
for _ in range(n - 1):
if S[i] != 0:
S[i] = S[i + 1] + S[i + 2]
i -= 1
ans = S[0] % (10**9 + 7)
print(ans)
|
p03013
|
read = input
rn = lambda :list(map(int, read().split()))
n, m = rn()
M = []
P = 1000000007
for i in range(m):
M.append(int(read()))
M = set(M)
dp = [0 for i in range(n + 1000)]
dp[0] = 1
for i in range(n+1):
for nxt in range(i+1, i+3):
if(nxt not in M):
dp[nxt] += dp[i]
dp[nxt] %= P
print((dp[n]))
|
read = input
rn = lambda :list(map(int, read().split()))
n, m = rn()
M = []
P = 1000000007
for i in range(m):
M.append(int(read()))
M = set(M)
dp = [0 for i in range(n + 10)]
dp[0] = 1
for i in range(n+1):
for nxt in range(i+1, i+3):
if(nxt not in M):
dp[nxt] += dp[i]
dp[nxt] %= P
print((dp[n]))
|
p03013
|
import sys
N, M = list(map(int, sys.stdin.readline().strip().split()))
A = set()
for _ in range(M):
A.add(int(sys.stdin.readline()))
# i段目の階段への到達方法の数
dp = [0 for _ in range(N+1)]
dp[0] = 1
dp[1] = 0 if 1 in A else 1
for i in range(2, N+1):
if i in A:
continue
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= 1000000007
print((dp[N]))
|
import sys
mod = 1000000007
N, M = list(map(int, sys.stdin.readline().split()))
A = set()
for _ in range(M):
a = int(sys.stdin.readline())
A.add(a)
dp = [0] * (N+1)
dp[0] = 1
dp[1] = 0 if 1 in A else 1
for i in range(1, N):
if i+1 in A:
continue
dp[i+1] = dp[i] + dp[i-1]
dp[i+1] %= mod
# print(dp)
print((dp[N]))
|
p03013
|
N,M=list(map(int,input().split()))
MOD=(10**9)+7
a=[0 for i in range(N+1)]
for _ in range(M):
A=int(eval(input()))
a[A]=-1
a[0]=1
for i in range(N):
if a[i]==-1:
continue
if a[i+1]!=-1:
a[i+1]+=a[i]
a[i+1]%=MOD
if i+2<=N and a[i+2]!=-1:
a[i+2]+=a[i]
a[i+2]%=MOD
print((a[N]))
|
N,M=list(map(int,input().split()))
MOD=(10**9)+7
a=[0 for i in range(N+1)]
for _ in range(M):
A=int(eval(input()))
a[A]=-1
a[0]=1
for i in range(N):
if a[i]==-1:
continue
if a[i+1]!=-1:
a[i+1]+=a[i]
a[i+1]%=MOD
if i+2<=N and a[i+2]!=-1:
a[i+2]+=a[i]
a[i+2]%=MOD
print((max(0,a[N])))
|
p03013
|
n,m = list(map(int,input().split()))
dp = [0]*(n+1)
ary = [int(eval(input())) for _ in range(m)]
dp[0] = 1
for i in ary:
dp[i] = -1
if dp[i-1] == -1 and dp[i] == -1:print((0));exit()
for i in range(1,n+1):
if dp[i] == -1:continue
elif dp[i-1] == -1:dp[i] = dp[i-2]
elif dp[i-2] == -1:dp[i] = dp[i-1]
elif i > 1: dp[i] = dp[i-1]+dp[i-2]
else: dp[i] = dp[i-1]
print((dp[n]%(10**9+7)))
|
import sys
sys.setrecursionlimit(500000)
def f(i):
if dp[i] != -1 and dp[i] != 0: return dp[i]
if dp[i] == -1: return 0
if i == -1:
return f(i - 1)
elif i > 1:
dp[i] = f(i - 1) + f(i - 2)
else:
dp[i] = f(i - 1)
return dp[i]
n,m = list(map(int,input().split()))
dp = [0]*(n+1)
ary = [int(eval(input())) for _ in range(m)]
dp[0] = 1
for i in ary:
dp[i] = -1
if dp[i-1] == -1 and dp[i] == -1:print((0));exit()
print((f(n)%(10**9+7)))
|
p03013
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.