input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
a,p = LI()
print(((a*3+p)//2))
return
#B
def B():
n = I()
s = [None for i in range(n)]
for i in range(n):
l = input().split()
s[i] = l+[i]
s.sort(key = lambda x:(x[0],-int(x[1])))
for i,a,b in s:
print((b+1))
return
#C
def C():
def dfs(d,k):
if d == n:
l.append(k)
else:
dfs(d+1,k+[0])
dfs(d+1,k+[1])
n,m = LI()
l = []
dfs(0,[])
qu = LIR(m)
p = LI()
ans = 0
for k in l:
s = 0
for q in range(m):
num = qu[q][0]
lis = list([x-1 for x in qu[q][1:]])
su = 0
for i in lis:
su ^= k[i]
if su == p[q]:
s += 1
if s == m:
ans += 1
print(ans)
return
#D
def D():
n = I()
return
#E
def E():
n = I()
return
#F
def F():
n = I()
return
#Solve
if __name__ == "__main__":
C()
| #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n,m = LI()
s = LIR(m)
p = LI()
ans = 0
for i in range(m):
s[i] = sum([1<<(j-1) for j in s[i][1:]])
for b in range(1<<n):
for i in range(m):
if bin(s[i]&b).count("1")&1 != p[i]:
break
else:ans += 1
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| p03031 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n,m = LI()
s = LIR(m)
p = LI()
ans = 0
for i in range(m):
s[i] = sum([1<<(j-1) for j in s[i][1:]])
for b in range(1<<n):
for i in range(m):
if bin(s[i]&b).count("1")&1 != p[i]:
break
else:ans += 1
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n,m = LI()
s = []
for i in range(m):
a = LI()[1:]
for j in range(len(a)):
a[j] -= 1
s.append(a)
p = LI()
ans = 0
for b in range(1<<n):
su = [0]*m
for i in range(m):
for j in s[i]:
if b&(1<<j):
su[i] ^= 1
if su == p:
ans += 1
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| p03031 |
N, M = list(map(int, input().split()))
kss = [list(map(int, input().split())) for _ in range(M)]
ps = list(map(int, input().split()))
answer = 0
for i in range(1 << N):
for (_, *ss), p in zip(kss, ps):
okay = True
if sum([(i >> s-1) & 1 for s in ss]) % 2 != p:
okay = False
break
if okay:
answer += 1
print(answer)
| from itertools import product
N, M = list(map(int, input().split()))
kss = [list(map(int, input().split())) for _ in range(M)]
ps = list(map(int, input().split()))
answer = 0
for switches in product(list(range(2)), repeat=N):
for (_, *ss), p in zip(kss, ps):
okay = True
if sum([switches[s-1] for s in ss]) % 2 != p:
okay = False
break
if okay:
answer += 1
print(answer)
| p03031 |
N,M=list(map(int,input().split()))
s=[list(map(int,input().split()))[1:] for m in range(M)]
p=list(map(int,input().split()))
count=0
for i in range(1<<N):
flag=True
for m in range(M):
on=0
for n in range(N):
if (i>>n)&1 and n+1 in s[m]:
on+=1
if on%2!=p[m]:
flag=False
if flag:
count+=1
print(count) | N,M=list(map(int,input().split()))
s=[list(map(int,input().split()))[1:] for m in range(M)]
p=list(map(int,input().split()))
count=0
for bit in range(1<<N):
flag=True
for m in range(M):
on=0
for n in range(N):
if (bit>>n)&1 and n+1 in s[m]:
on+=1
if on%2!=p[m]:
flag=False
if flag:
count+=1
print(count) | p03031 |
n,m = list(map(int,input().split()))
ls = []
switch = [(i+1) for i in range(n)]
ls = [list(map(int,input().split())) for i in range(m)]
p = list(map(int,input().split()))
pattern = [bin(i)[2:].zfill(n) for i in range(2**n)]
ans = 0
for i in pattern:
turn = []
on = 0
for j in range(n):
if i[j] == '1':
turn.append(switch[j])
for k in range(m):
count = 0
for l in range(1,ls[k][0]+1):
if ls[k][l] in turn:
count += 1
if count % 2 == p[k]:
on += 1
if on == m:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
switch = [(i+1) for i in range(n)]
ks = [list(map(int,input().split())) for i in range(m)]
p = list(map(int,input().split()))
pattern = [bin(i)[2:].zfill(n) for i in range(2**n)]
ans = 0
for i in pattern:
on = []
light = 0
for j in range(n):
if i[j] == '1':
on.append(switch[j])
for k in range(m):
count = 0
for l in range(1,ks[k][0]+1):
if ks[k][l] in on:
count += 1
if count % 2 == p[k]:
light += 1
if light == m:
ans += 1
print(ans) | p03031 |
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for ii in range(2**N):
check = True
for i in range(M):
cnt = 0
for j in range(1, len(ks[i])):
if (ii >> (ks[i][j]-1)) & 1:
cnt += 1
if cnt % 2 != p[i]:
check = False
break
if check:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
flag = True
for j in range(m):
cnt = 0
for k in range(1, len(ks[j])):
if (i >> (ks[j][k]-1)) & 1:
cnt += 1
if cnt % 2 != p[j]:
flag = False
break
if flag:
ans += 1
print(ans) | p03031 |
import math
def number2bit(n):
return int(math.pow(2, n - 1))
def count_bit(n):
count = 0
while n > 0:
if n & 1 == 1:
count += 1
n >>= 1
return count
N, M = list(map(int, input().split(' ')))
lights = [set(tuple(map(int, input().split(' ')))[1:]) for _ in range(M)]
light_bits = [sum(map(number2bit, light)) for light in lights]
mods = tuple(map(int, input().split(' ')))
count = 0
for i in range(int(math.pow(2, N))):
for j, light_bit in enumerate(light_bits):
if count_bit(i & light_bit) % 2 != mods[j]:
break
else:
count += 1
print(count)
| import math
def number2bit(n):
return int(math.pow(2, n - 1))
def count_bit(n):
return bin(n)[2:].count('1')
N, M = list(map(int, input().split(' ')))
lights = [tuple(map(int, input().split(' ')))[1:] for _ in range(M)]
light_bits = [sum(map(number2bit, light)) for light in lights]
mods = tuple(map(int, input().split(' ')))
count = 0
for i in range(int('1' + '0' * N, base=2)):
for light_bit, mod in zip(light_bits, mods):
if count_bit(i & light_bit) % 2 != mod:
break
else:
count += 1
print(count)
| p03031 |
# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
N, M = [int(x) for x in input().split()]
S = [[0] * N for _ in range(M)]
for m in range(M):
s = [int(x) for x in input().split()]
for s1 in s[1:]:
S[m][s1 - 1] = 1
P = [int(x) for x in input().split()]
cnt = 0
for i in range(2 ** N):
tmp = True
for j in range(M):
c = 0
for k in range(N):
if i & (1 << k):
c += S[j][k]
if c % 2 != P[j]:
tmp = False
# bit = format(i, "08b")
# print("i(bit):{}, j:{}, c:{},c%2:{}, P[j]:{}".format(bit, j, c, c % 2, P[j]))
# print("---")
if tmp == True:
cnt += 1
print(cnt)
| N, M = list(map(int, input().split()))
S = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k = tmp[0]
S.append(tmp[1:])
P = [int(x) for x in input().split()]
ret = 0
for pt in range(1<<N):
allOn = True
for i in range(M):
swcnt = 0
for s in S[i]:
if pt & (1 << (s-1)):
swcnt += 1
if swcnt % 2 != P[i]:
allOn = False
if allOn:
ret += 1
print(ret)
| p03031 |
N, M = list(map(int, input().split()))
S = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k = tmp[0]
S.append(tmp[1:])
P = [int(x) for x in input().split()]
ret = 0
for pt in range(1<<N):
allOn = True
for i in range(M):
swcnt = 0
for s in S[i]:
if pt & (1 << (s-1)):
swcnt += 1
if swcnt % 2 != P[i]:
allOn = False
if allOn:
ret += 1
print(ret)
| N, M = list(map(int, input().split()))
S = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k = tmp[0]
S.append(tmp[1:])
P = [int(x) for x in input().split()]
ret = 0
# bitでN個のスイッチ押し方の全パターンを列挙する方針
for pt in range(1<<N):
allOn = True
# 電球iが点灯するかどうか
for i in range(M):
cnt = 0 # 電球iに対応したスイッチの中で押した数
for s in S[i]:
if pt & (1 << (s-1)):
cnt += 1
if cnt % 2 != P[i]:
allOn = False
if allOn:
ret += 1
print(ret)
| p03031 |
N, M = list(map(int,input().split()))
s = []
ans = 0
for _ in range(M):
temp = list(map(int, input().split()))
s.append(temp[1:])
p = list(map(int, input().split()))
for i in range(2 ** N):
flag = 1
flag_1 = 1
sw = bin(i)[2:]
sw = sw.zfill(N)
for j in range(M):
sumsw = 0
for k in s[j]:
sumsw += int(sw[k-1])
if sumsw % 2 != p[j]:
flag = 0
flag_1 = 0
break
if flag_1 == 0:
break
if flag:
ans += 1
print(ans) | import sys
input = sys.stdin.readline
N, M = [int(x) for x in input().split()]
k = []
s = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k.append(tmp[0])
s.append(tmp[1:])
p = [int(x) for x in input().split()]
ans = 0
for i in range(2 ** N):
flag = 1
for j in range(M):
cnt = 0
for k in s[j]:
cnt += (i >> (k - 1)) & 1
if cnt % 2 != p[j]:
flag = 0
break
ans += flag
print(ans)
| p03031 |
n,m = list(map(int,input().split()))
s = [0]*m
for i in range(m):
s[i] = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = 0
for i in range(2**n):
sw = [0]*m
for k in range(m):
num = 0
for j in range(n):
if (i>>j)&1:
if j+1 in s[k][1:]:
num += 1
if num%2 == p[k]:
sw[k] = 1
if 0 in sw:
pass
else:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
s = [0]*m
for i in range(m):
s[i] = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = 0
for i in range(2**n):
sw = [0]*m
for j in range(m):
num = 0
for k in range(n):
if (i>>k)&1:
if k+1 in s[j][1:]:
num += 1
if num%2 == p[j]:
sw[j] = 1
if 0 in sw:
pass
else:
ans += 1
print(ans)
| p03031 |
import copy
num_of_switch, num_of_lights = [int(_) for _ in input().split()]
def toSwitch(xs):
xs[1:]
S = [[int(s) - 1 for s in input().split()[1:]] for i in range(num_of_lights)]
P = [_ == "1" for _ in input().split()]
# i は switch の添字
def rec(switch_idx, lights):
if switch_idx == num_of_switch:
if lights == P:
return 1
else:
return 0
switch_off_result = rec(switch_idx + 1, lights)
_lights = copy.deepcopy(lights)
for light_idx in range(num_of_lights):
# print(f"switch_idx = {switch_idx}, light_idx = {light_idx}")
is_connect = switch_idx in S[light_idx]
if is_connect:
_lights[light_idx] = not _lights[light_idx]
# print(f"switch_idx = {switch_idx}: not choose = {lights}, choose = {_lights} ")
switch_on_result = rec(switch_idx + 1, _lights)
return switch_off_result + switch_on_result
ans = rec(0, [False] * num_of_lights)
print(ans)
| import copy
num_of_switch, num_of_lights = [int(_) for _ in input().split()]
S = [[int(s) - 1 for s in input().split()[1:]] for i in range(num_of_lights)]
P = [_ == "1" for _ in input().split()]
# i は switch の添字
def rec(switch_idx, lights):
if switch_idx == num_of_switch:
if lights == P:
return 1
else:
return 0
switch_off_result = rec(switch_idx + 1, lights)
_lights = copy.deepcopy(lights)
for light_idx in range(num_of_lights):
# print(f"switch_idx = {switch_idx}, light_idx = {light_idx}")
is_connect = switch_idx in S[light_idx]
if is_connect:
_lights[light_idx] = not _lights[light_idx]
# print(f"switch_idx = {switch_idx}: not choose = {lights}, choose = {_lights} ")
switch_on_result = rec(switch_idx + 1, _lights)
return switch_off_result + switch_on_result
ans = rec(0, [False] * num_of_lights)
print(ans)
| p03031 |
N,M=list(map(int,input().split()))
L=[list(map(int,input().split())) for _ in range(M)]
P=list(map(int,input().split()))
ans=0
for i in range(2**N):
lit=[0]*M
for j,switch in enumerate(L):
cnt=0
for s in switch[1:]:
if i>>(s-1)&1:
cnt+=1
if cnt%2==P[j]:
lit[j]=True
else:
lit[j]=False
if all(lit):
ans+=1
print(ans) | N,M=list(map(int,input().split()))
L=[list(map(int,input().split()))[1:] for _ in range(M)]
P=list(map(int,input().split()))
ans=0
for i in range(2**N):
lit=[0]*M
for j,switch in enumerate(L):
cnt=0
for s in switch:
if i>>(s-1)&1:
cnt+=1
if cnt%2==P[j]:
lit[j]=True
else:
lit[j]=False
if all(lit): ans+=1
print(ans) | p03031 |
N,M=list(map(int,input().split()))
L=[list(map(int,input().split()))[1:] for _ in range(M)]
P=list(map(int,input().split()))
ans=0
for i in range(2**N):
lit=[0]*M
for j,switch in enumerate(L):
cnt=0
for s in switch:
if i>>(s-1)&1:
cnt+=1
if cnt%2==P[j]:
lit[j]=1
else:
lit[j]=0
if all(lit): ans+=1
print(ans) | N,M=list(map(int,input().split()))
L=[list(map(int,input().split()))[1:] for _ in range(M)]
P=list(map(int,input().split()))
ans=0
for i in range(2**N):
lit=[0]*M
for j,switches in enumerate(L):
cnt=0
for s in switches:
if i>>(s-1)&1:cnt+=1
if cnt%2==P[j]:lit[j]=1
if all(lit):ans+=1
print(ans) | p03031 |
N,M = list(map(int, input().split()))
S = []
for _ in range(M):
s_list = ['0' for _ in range(N)]
for s in list(map(int, input().split()))[1:]:s_list[s-1] = '1'
S.append(int(''.join(s_list),2))
P = list(map(int, input().split()))
ans = 0
for i in range(2**N):
flag = True
for idx, s in enumerate(S):
if bin(i&s)[2:].count('1')%2 != P[idx]:
flag = False
break
if flag is True: ans += 1
print(ans) | def is_all_switches_on(on_case):
for i, s in enumerate(S):
on_switch_num = 0
for si in s:
if on_case[si] == '1':
on_switch_num += 1
if on_switch_num % 2 != switches[i]:
return False
return True
if __name__ == '__main__':
N, M = list(map(int, input().split()))
S = []
for _ in range(M):
k, *s = list(map(int, input().split()))
S.append(s)
switches = list(map(int, input().split()))
ans = 0
for i in range(2 ** N):
on_case = '0' + bin(i)[2:].zfill(N)
if is_all_switches_on(on_case):
ans += 1
print(ans) | p03031 |
n,m = list(map(int,input().split()))
k = [list(map(int,input().split())) for i in range(m)]
p = list(map(int,input().split()))
ans = 0
switch_st = 0
cnt = 0
while switch_st != 2**n:
switch_on = { i+1 for i in range(n) if switch_st>>i & 1 == 1}
for i in range(m):
switch_cnt = len(switch_on & set(k[i][1:]))
if switch_cnt %2 == p[i]:
cnt += 1
else:
if cnt == m:
ans += 1
cnt = 0
switch_st += 1
print(ans) | N,M = list(map(int,input().split()))
S = [[int(i)-1 for i in input().split()] for _ in range(M)]
P = [int(i) for i in input().split()]
ans = 0
for i in range(1<<N):
for j in range(M):
cnt = 0
for s in S[j][1:]:
if i >> s & 1: cnt += 1
if cnt%2 != P[j]: break
else:
ans += 1
print(ans) | p03031 |
N,M = list(map(int,input().split()))
#ks[i][0]がk_i
ks = [[int(i) for i in input().split()]for i in range(M)]
p=list(map(int,input().split()))
ans=0
for i in range(2**N):
flag=0
#Onoff[i]=0はスイッチiのOFFを、=1はONを表す
OnOff = [0]*N
for j in range(N):
if (i>>j) & 1:
OnOff[j]=1
for j in range(M):
count=0
for l in range(1,len(ks[j])):
if(OnOff[ks[j][l]-1]==1):
count+=1
if(p[j]==0 and count%2==0):
flag+=1
elif(p[j]==1 and count%2==1):
flag+=1
else:
pass
if(flag==len(p)):
ans+=1
print(ans) | N,M = list(map(int,input().split()))
#ks[i][0]がk_i
ks = [[int(i) for i in input().split()]for i in range(M)]
p=list(map(int,input().split()))
ans=0
for i in range(2**N):
flag=0
#Onoff[i]=0はスイッチiのOFFを、=1はONを表す
OnOff = [0]*N
for j in range(N):
if (i>>j) & 1:
OnOff[j]=1
for j in range(M):
count=0
for l in range(1,len(ks[j])):
if(OnOff[ks[j][l]-1]==1):#-1に注意（スイッチxはOnOff[x-1]に対応）
count+=1
if(p[j]==0 and count%2==0):
flag+=1
elif(p[j]==1 and count%2==1):
flag+=1
else:
pass
#全ての電球が点くならばansに+1
if(flag==len(p)):
ans+=1
print(ans) | p03031 |
N,M = [int(i) for i in input().split()] #Nがスイッチの数、Mは電球の数
kslist = []
for i in range(M):
kslist.append([int(i)-1 for i in input().split()][1:])
plist = [int(i) for i in input().split()]
#print(kslist)
#print(plist)
count = 0
lamp_str = "0"*N
for i in range(2**N):
lamp_onoff_list = [int(i) for i in lamp_str]
iflampturnson = [0 for i in range(M)]
for j in range(M):
for s in kslist[j]:
iflampturnson[j] += lamp_onoff_list[s]
#print(lamp_onoff_list,iflampturnson)
iflampturnson = [k%2 for k in iflampturnson]
buff = True
for k in range(M):
if plist[k] != iflampturnson[k]:
buff = False
if buff == True:
count += 1
lamp_str = format(int(lamp_str,2) + 1,"b")
lamp_str = lamp_str.zfill(N)
print(count)
| N,M = [int(i) for i in input().split()]
switches = []
for i in range(M):
buff = 0
k,*sss = [int(i) for i in input().split()]
for s in sss:
buff += 1 << (s-1)
switches.append(buff)
ppp = [int(i) for i in input().split()]
ans = 0
for i in range(1<<N):
for p,s in zip(ppp,switches):
buff = s&i
buff = bin(buff).count("1")%2
if buff != p:
break
else:
ans += 1
print(ans) | p03031 |
N,M = [int(i) for i in input().split()] #Nがスイッチの数、Mは電球の数
sss = []
for i in range(M):
buff = [int(i)-1 for i in input().split()][1:]
onoff = [0 for i in range(N)]
for j in buff:
onoff[j]=1
sss.append(onoff)
ppp = [int(i) for i in input().split()]
ct=0
for i in range(1<<N):
bitcode = [int(i) for i in list(bin(i)[2:].zfill(N))]
for s,p in zip(sss,ppp):
if sum(j*k for j,k in zip(s,bitcode))%2!=p:
break
else:
ct+=1
print(ct) | N,M = [int(i) for i in input().split()]
switches = []
for i in range(M):
buff = 0
k,*sss = [int(i) for i in input().split()]
for s in sss:
buff += 1 << (s-1)
switches.append(buff)
ppp = [int(i) for i in input().split()]
ans = 0
for i in range(1<<N):
for p,s in zip(ppp,switches):
buff = s&i
buff = bin(buff).count("1")%2
if buff != p:
break
else:
ans += 1
print(ans) | p03031 |
# -*- coding:utf-8 -*-
from itertools import combinations
import copy
def solve2():
"""
itertools.productを使えばもっとすっきり？
"""
import itertools as it
N, M = list(map(int, input().split()))
K = []
S = []
for i in range(M):
_in = list(map(int, input().split()))
K.append(_in[0])
S.append(_in[1:])
P = list(map(int, input().split()))
switch_stats = it.product((0,1), repeat=N)
ans = 0
for stats in switch_stats:
is_ok = True
for i in range(M): # すべての電球において
on_num = 0
for s_i in S[i]:
on_num += 1 if stats[s_i-1]==1 else 0
if on_num%2 == P[i]:
continue
else:
is_ok = False
if is_ok:
ans += 1
print(ans)
def solve():
N, M = list(map(int, input().split()))
K = []
S = []
for i in range(M):
_in = list(map(int, input().split()))
K.append(_in[0])
S.append(_in[1:])
P = list(map(int, input().split()))
"""
全探索
計算量 O(2^N * M * max(len(S)))
N=10, M=10でも、1024 * 10 * 10 くらい？
"""
def dfs(switch_stats):
if len(switch_stats)==N:
is_ok = True
for i in range(M):
on_num = 0
for switch_i in S[i]:
on_num += 1 if switch_stats[switch_i-1] == 1 else 0
if on_num%2 == P[i]:
continue
else:
is_ok = False
break
if is_ok:
return 1
else:
return 0
switch_stats1 = copy.deepcopy(switch_stats)
switch_stats1.append(0)
ret1 = dfs(switch_stats1)
switch_stats2 = copy.deepcopy(switch_stats)
switch_stats2.append(1)
ret2 = dfs(switch_stats2)
return ret1 + ret2
ans = dfs([])
print(ans)
if __name__ == "__main__":
solve2()
| # -*- coding:utf-8 -*-
from itertools import product
def solve():
N, M = list(map(int, input().split()))
K, S = [], []
for _ in range(M):
_in = list(map(int, input().split()))
K.append(_in[0])
S.append(_in[1:])
P = list(map(int, input().split()))
all_stats = product((0,1), repeat=N)
ans = 0
for stat in all_stats:
is_ok = True
for switch_i, switch in enumerate(S):
on_num = 0
for i in range(len(switch)):
if stat[switch[i]-1] == 1:
on_num += 1
if on_num%2 != P[switch_i]:
is_ok = False
break
if is_ok:
ans += 1
print(ans)
if __name__ == "__main__":
solve()
| p03031 |
# -*- coding:utf-8 -*-
from itertools import product
def solve():
N, M = list(map(int, input().split()))
K, S = [], []
for _ in range(M):
_in = list(map(int, input().split()))
K.append(_in[0])
S.append(_in[1:])
P = list(map(int, input().split()))
all_stats = product((0,1), repeat=N)
ans = 0
for stat in all_stats:
is_ok = True
for switch_i, switch in enumerate(S):
on_num = 0
for i in range(len(switch)):
if stat[switch[i]-1] == 1:
on_num += 1
if on_num%2 != P[switch_i]:
is_ok = False
break
if is_ok:
ans += 1
print(ans)
if __name__ == "__main__":
solve()
| # -*- coding:utf-8 -*-
import itertools
def solve():
N, M = list(map(int, input().split()))
Ks, Ss = [], []
for i in range(M):
_in = list(map(int, input().split()))
Ks.append(_in[0])
Ss.append(_in[1:])
Ps = list(map(int, input().split()))
# 全探索でいける
switches = itertools.product([0,1], repeat=N)
ans = 0
for switch in switches:
is_ok = True
for i in range(M):
on_num = 0
for s in Ss[i]:
if switch[s-1] == 1:
on_num += 1
if on_num%2 != Ps[i]:
is_ok = False
break
if is_ok:
ans += 1
print(ans)
if __name__ == "__main__":
solve()
| p03031 |
N, M = list(map(int, input().split()))
switches_bulbs_connection = {}
for i in range(M):
switches_bulbs_connection[i] = list(map(int, input().split()))[1:]
p = list(map(int, input().split()))
count = 0
flag = 0
for i in range(2 ** N): # スイッチのon/offについてビット全探索
switch_on_off = [0] * N
bulb_stat = [0] * M
for j in range(N):
if (i >> j) & 1:
switch_on_off[j] += 1 # 各スイッチがonかoffか
for k in range(M): # 電球kについて調べる
tmp = switches_bulbs_connection[k]
for switch in tmp:
if switch_on_off[switch-1]:
bulb_stat[k] += 1
for l in range(M):
if bulb_stat[l] % 2 == p[l]:
flag += 1
if flag == M:
count += 1
flag = 0
print(count)
| N, M = list(map(int, input().split()))
bulb = []
count = 0
for _ in range(M):
tmp = list(map(int, input().split()))
bulb.append(tmp[1:])
P = list(map(int, input().split()))
for i in range(2 ** N):
switch = []
for j in range(N): # スイッチの押し方を全探索
if (i >> j) & 1:
switch.append(j+1)
bulb_count = M
for k in range(M): # M個の電球それぞれがついているか判定
tmp = bulb[k] # tmpは電球k につながっているスイッチ
switch_count = 0
for num in tmp: # 電球kのスイッチについて判定
if num in switch:
switch_count += 1
if switch_count % 2 == P[k]:
bulb_count -= 1
if bulb_count == 0:
count += 1
print(count)
| p03031 |
N, M = list(map(int, input().split()))
# 繋がってるスイッチの情報
S = [list(map(int, input().split()))[1:] for _ in range(M)]
P = list(map(int, input().split()))
# print(S)
# print(P)
ans = 0
for i in range(1 << N):
# print(i)
for m in range(M):
cnt = 0
for s in S[m]: # Sは繋がっているスイッチの情報
if i & (1 << (s-1)) != 0:
cnt += 1
if cnt % 2 != P[m]:
break
else: # このelseはどういうこと
ans += 1
print(ans)
| N, M = list(map(int, input().split())) # N個のスイッチ, M個の電球
# M個の電球がそれぞれどこのスイッチと繋がっているかを格納
SSS = [list(map(int, input().split()))[1:] for i in range(M)]
P = list(map(int, input().split()))
ans = 0
for i in range(1 << N): # 2のN乗の値になる, bit全探索
for mask in range(M):
ans_2 = 0
for s in SSS[mask]:
if (1 << s-1) & i != 0:
ans_2 += 1
if ans_2 % 2 != P[mask]:
break
else:
ans += 1
print(ans)
| p03031 |
N, M = list(map(int, input().split()))
cnt = 0
K = list()
L = list()
for m in range(M):
l = list(map(int, input().split()))
k = l.pop(0)
K.append(k)
L.append(l)
P = list(map(int, input().split()))
for i in range(1<<N):
flag = True
for j in range(M):
c = 0
for l in range(K[j]):
if i & (1<<L[j][l]-1):
c += 1
if c % 2 != P[j]:
flag = False
if flag:
cnt += 1
print(cnt) | N, M = list(map(int, input().split()))
K = []
S = []
for m in range(M):
l = list(map(int, input().split()))
k = l.pop(0)
K.append(k)
S.append(l)
P = list(map(int, input().split()))
ans = 0
for n in range(1<<N):
res = True
for m in range(M):
cnt = 0
for q in range(K[m]):
if n & (1<<S[m][q]-1):
cnt += 1
if cnt % 2 != P[m]:
res = False
if res:
ans += 1
print(ans)
| p03031 |
N,M = list(map(int,input().split()))
bulbs = []
for _ in range(M):
bulbs.append(list(map(int,input().split())))
P = list(map(int,input().split()))
res = 0
for i in range(1<<N):
on = []
for j in range(N):
if (i>>j)&1:
on.append(j)
ok = True
for i,b in enumerate(bulbs):
b = [ k-1 for k in b[1:] ]
p = P[i]
o = 0
for s in on:
if s in b: o += 1
if o%2 != p:
ok = False
break
if ok:
res += 1
print(res)
| # N switches, M bulbs
N,M = list(map(int,input().split()))
K = []
for i in range(M):
lst = list(map(int,input().split()))
K.append([i-1 for i in lst[1:] ])
P = list(map(int,input().split()))
res = 0
for i in range(1<<N):
on = []
for j in range(N):
if (i>>j)&1:
on.append(j)
flg = True
for m in range(M):
k = K[m]
tmp = 0
for s in k:
if s in on:
tmp += 1
p = P[m]
if tmp % 2 != p:
flg = False
break
if flg:
res += 1
print(res) | p03031 |
n,m=list(map(int,input().split()))
s=eval('list(map(int,input().split()[1:])),'*m)
*p,=list(map(int,input().split()))
a=0
r=range
for i in r(1<<n):
c=[0]*m
for j in r(n):
for k in r(m):c[k]+=i>>j&1and j+1in s[k]
a+=all(j==i%2for i,j in zip(c,p))
print(a) | I=lambda:list(map(int,input().split()))
n,m=I()
s=eval('I(),'*m)
p=I()
a=0
r=range
for i in r(1<<n):
c=[0]*m
for j in r(n):
for k in r(m):c[k]+=i>>j&1and j+1in s[k][1:]
a+=all(j==i%2for i,j in zip(c,p))
print(a) | p03031 |
N, M = list(map(int, input().split()))
S = []
for _ in range(M):
S.append(list(map(int, input().split()))[1:])
p = list(map(int, input().split()))
ans = 0
for bit in range(1 << N):
for m in range(M):
if p[m] != ([bin(bit)[2:].zfill(N)[s-1] for s in S[m]].count('1') % 2):
break
else:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
S = []
for _ in range(M):
S.append(list(map(int, input().split()))[1:])
P = list(map(int, input().split()))
ans = 0
for bit in range(1 << N):
for m in range(M):
if sum([bit & (1 << (s-1)) > 0 for s in S[m]]) % 2 != P[m]:
break
else:
ans += 1
print(ans)
| p03031 |
n,m = list(map(int,input().split()))
l = []
for i in range(1 << n):
tmp = str(bin(i))[2:]
l.append(tmp.zfill(n))
K = [list(map(int,input().split())) for _ in range(m)]
P = list(map(int,input().split()))
#print(P)
ans = 0
#print("----")
for i in range(len(l)):
#スイッチの状態l[i]
#付いている電球のリストO
O = []
for j in range(m):
#電球のきになるすいっちの数K[j][0]
ON = 0
for ii in range(K[j][0]): #スイッチのリスト
if l[i][K[j][ii+1] - 1] == "1":
ON += 1
if ON % 2 == P[j]:
O.append(1)
else:
O.append(0)
if sum(O) == m:
#print(l[i])
ans += 1
print(ans)
| n,m = list(map(int,input().split()))
a = [list(map(int,input().split())) for _ in range(m)]
p = list(map(int,input().split()))
ans = 0
for i in range(2**n):
onoffs = [int(j) for j in list(bin(i)[2:].zfill(n))]
Flag = True
for lamp in range(m):
k = a[lamp][0]
info = [l - 1 for l in a[lamp][1:]]
tmp = 0
for index in info:
if onoffs[index]:
tmp += 1
if tmp % 2 != p[lamp]:
Flag = False
break
if Flag:
ans += 1
print(ans) | p03031 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from itertools import accumulate #list(accumulate(A))
N, M = mi()
ks = []
for i in range(M):
a = li()
ks.append(a)
P = li()
cnt = 0
for i in range(2**N):
x = bin(i)[2:].zfill(N)
l = list(map(int, list(x)))
flag = 1
for i in range(M):
num , *switchs = ks[i]
if sum([l[sw-1] for sw in switchs]) % 2 != P[i]:
flag = 0
break
if flag:
cnt += 1
print(cnt) | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from itertools import accumulate #list(accumulate(A))
from itertools import product
N, M = mi()
ks = []
for i in range(M):
a = li()
ks.append(a)
P = li()
cnt = 0
#for i in range(2**N):
#x = bin(i)[2:].zfill(N)
#l = list(map(int, list(x)))
for l in product([0, 1], repeat=N):
for i in range(M):
num , *switchs = ks[i]
if sum([l[sw-1] for sw in switchs]) % 2 != P[i]:
break
else:
cnt += 1
print(cnt) | p03031 |
import itertools
N,M = list(map(int,input().split()))
switch = [list(map(int,input().split())) for m in range(M)]
p = list(map(int,input().split()))
S = list(itertools.product([0,1], repeat=N))
ans = 0
for s in S:
s_ok = 0
for m in range(M):
count = 0
for i in range(1, len(switch[m])):
if s[switch[m][i]-1] == 1:
count += 1
if count%2 == p[m]:
s_ok += 1
else:
break
if s_ok == M:
ans += 1
print(ans)
| import itertools
N,M = list(map(int,input().split()))
switch = [list(map(int,input().split())) for m in range(M)]
p = list(map(int,input().split()))
S = list(itertools.product([0,1], repeat=N))
ans = 0
for s in S:
s_ok = 0
for m in range(M):
count = 0
for i in range(1, switch[m][0]+1):
if s[switch[m][i]-1] == 1:
count += 1
if count%2 == p[m]:
s_ok += 1
else:
break
if s_ok == M:
ans += 1
print(ans)
| p03031 |
N, M = list(map(int, input().split()))
K = [0] * M
for i in range(M):
K[i] = list(map(int, input().split()))
K[i].pop(0)
#print(K)
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** N):#最大1000
now = [0] * (N + 1)
x = 1
for j in range(N):#最大10
if ((i >> j) & 1):
now[j + 1] = 1
for k in range(M):# 10 * 10
now2 = 0
for a in K[k]:
if now[a] == 1:
now2 += 1
if now2 % 2 != p[k]:
x = 0
ans += x
print(ans) | N, M = list(map(int, input().split()))
K = [0] * M
for i in range(M):
S = list(map(int, input().split()))
K[i] = S[1:]
P = list(map(int, input().split()))
#print(K)
count = 0
for i in range(2 ** N):#1024
on = [0] * N
ans = [0] * M
ans2 = [1] * M
for j in range(N):#10
if ((i >> j) & 1):
on[j] = 1
#print(on)
for k in range(M):#10
now = 0
for l in K[k]:
if on[l - 1] == 1:
now += 1
if now % 2 == P[k]:
ans[k] = 1
#print(on, ans)
if ans == ans2:
count += 1
print(count) | p03031 |
def slove():
import sys
import bisect
import collections
import fractions
import heapq
import itertools
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
ks = [list(map(int, input().rstrip('\n').split())) for _ in range(m)]
p = list(map(int, input().rstrip('\n').split()))
a_cnt = 0
for v in itertools.product([True, False], repeat=n):
b = True
for j, vv in enumerate(ks):
cnt = 0
for i in range(vv[0]):
if v[vv[i+1]-1]:
cnt += 1
if cnt % 2 != p[j]:
b = False
break
if b:
a_cnt += 1
print(a_cnt)
if __name__ == '__main__':
slove()
| import sys
import itertools
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, m = list(map(int, input().rstrip('\n').split()))
ks = [list(map(int, input().rstrip('\n').split())) for _ in range(m)]
p = list(map(int, input().rstrip('\n').split()))
cnt = 0
for v in itertools.product([True, False], repeat=n):
b = True
for i in range(m):
t = 0
for kv in ks[i][1:]:
t += v[kv-1]
if t % 2 != p[i]:
b = False
break
if b:
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| p03031 |
N, M = list(map(int, input().split()))
slist = [list(map(int, input().split()))[1:] for _ in range(M)]
plist = list(map(int, input().split()))
def count_on_switch(switch_array: list, on: set):
return sum([int(sw in on) for sw in switch_array])
ans = 0
# print("---")
for i in range(2**N):
on = set()
for j in range(N):
if ((i >> j) & 1):
on.add(j+1)
temp = 0
for _ in range(M):
cou_on = count_on_switch(slist[_], on)
# print(i, cou_on)
if cou_on % 2 != plist[_]:
break
else:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
s_setlist = []
for i in range(M):
k, *s = list(map(int, input().split()))
s_setlist.append(set(s))
plist = list(map(int, input().split()))
ans = 0
for i in range(2**N):
on = set()
for j in range(N):
if ((i >> j) & 1):
on.add(j+1)
light_list = [len(on&s_setlist[k])%2==plist[k] for k in range(M)]
if all(light_list):
ans += 1
print(ans)
| p03031 |
import itertools
N,M=list(map(int,input().split()))
sw=[list(map(int,input().split())) for _ in range(M)]
p=[int(x) for x in input().split()]
ans=0
for i in itertools.product([0,1],repeat=N):#i...スイッチの状態一覧
onof=True
for j in range(M):#j...電球の番号
j_on_cnt=0#電球jに対するonスイッチの個数
for k in sw[j][1:]:
j_on_cnt+=i[k-1]
if j_on_cnt%2!=p[j]:#電球jがonかoffなのかを調べる
onof=False
break
if onof:
ans+=1
print(ans) | import itertools
N,M=list(map(int,input().split()))
sw=[list(map(int,input().split())) for _ in range(M)]
p=[int(x) for x in input().split()]
ans=0
for i in itertools.product([0,1],repeat=N):
ok=True
for j in range(M):
j_on_cnt=0
for k in sw[j][1:]:
j_on_cnt+=i[k-1]
if j_on_cnt%2!=p[j]:
ok=False
break
if ok:
ans+=1
print(ans) | p03031 |
N, M = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** N):
x = bin(i)[2:].rjust(N, "0")
flag = True
for j in range(M):
tmp = 0
for k in range(1, s[j][0] + 1):
index = s[j][k]
if x[index - 1] == "1":
tmp += 1
if tmp % 2 != p[j] % 2:
flag = False
if flag:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
# 0をoffとして2進数でパターンを表現
for i in range(2 ** N):
x = bin(i)[2:].rjust(N, "0")
light = True # 着目している電球が点灯していないときはこれがFalseになる
for j in range(M):
tmp = 0 # 着目している電球について、スイッチのonの個数をカウントする
for k in range(1, s[j][0] + 1):
if x[s[j][k] - 1] == "1":
tmp += 1
if tmp % 2 != p[j] % 2:
light = False
if light:
ans += 1
print(ans)
| p03031 |
N, M = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
# 0をoffとして2進数でパターンを表現
for i in range(2 ** N):
x = bin(i)[2:].rjust(N, "0")
light = True # 着目している電球が点灯していないときはこれがFalseになる
for j in range(M):
tmp = 0 # 着目している電球について、スイッチのonの個数をカウントする
for k in range(1, s[j][0] + 1):
if x[s[j][k] - 1] == "1":
tmp += 1
if tmp % 2 != p[j] % 2:
light = False
if light:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(M)] #sの各要素のはじめはk
p = list(map(int, input().split()))
ans = 0
# 0をoffとして2進数でパターンを表現
for i in range(2 ** N):
ptn = bin(i)[2:].rjust(N, "0") # N桁の2進表現にする
light = True # 着目している電球が点灯していないときはこれがFalseになる
for j in range(M):
tmp = 0 # 着目している電球について、スイッチのonの個数をカウントする
for n in range(1, s[j][0] + 1):
if ptn[s[j][n] - 1] == "1":
tmp += 1
if tmp % 2 != p[j] % 2:
light = False
if light:
ans += 1
print(ans)
| p03031 |
n, m = list(map(int, input().split()))
switches = []
cnt = 0
for i in range(m):
array = list(map(int, input().split()))
array.pop(0)
switches.append(array)
p = list(map(int, input().split()))
def ch_binary(l, digit):
num = [0] * digit
for i in l:
num[i-1] = 1
return num
#スイッチのON、OFFをバイナリで表現する。
switches_2 = []
for i in switches:
array = ch_binary(i, n)
switches_2.append(array)
def check(a, b, digit, x):
count = 0
for i in range(digit):
if a[i] == b[i] and b[i] == 1:
count += 1
if count % 2 == x:
return 1
else:
return 0
for i in range(2**n):
bin_str = list(map(int, format(i, 'b').zfill(n)))
count = 0
for j in range(m):
y = check(switches_2[j], bin_str, n, p[j])
count += y
if count == m:
cnt += 1
print(cnt)
| n, m = list(map(int, input().split()))
switches = []
for i in range(m):
array = list(map(int, input().split()))
switches.append(array[1:])
checker = list(map(int, input().split()))
bit_size = 2 ** n
ans = 0
for i in range(bit_size):
num = format(i, 'b').zfill(n)
flag = True
for j in range(m):
a = 0
for k in range(n):
if num[k] == '1' and k+1 in switches[j]:
a += 1
if a % 2 == checker[j]:
continue
else:
flag = False
break
if flag is True:
ans += 1
print(ans) | p03031 |
def inpl(): return list(map(int, input().split()))
N, M = inpl()
T = [[] for _ in range(N)]
for i in range(M):
_, *S = inpl()
for s in S:
T[s-1].append(i)
P = inpl()
ans = 0
for x in range(2**N):
Q = [0]*M
for i in range(N):
if (x >> i) & 1:
for t in T[i]:
Q[t] += 1
ans += P == [q%2 for q in Q]
print(ans) | def inpl(): return list(map(int, input().split()))
N, M = inpl()
L = [0]*M
for i in range(M):
for s in inpl()[1:]:
L[i] += pow(2, s-1)
P = inpl()
print((sum([sum([bin(L[j]&i).count("1")%2 == P[j] for j in range(M)]) == M for i in range(pow(2, N))]))) | p03031 |
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** n):
onswichi = [False] * n
onlight = [0] * m
for j in range(n):
if (i >> j) & 1:
onswichi[j] = True
for k in range(m):
cnt = 0
for f in ks[k][1:]:
if onswichi[f-1]:
cnt += 1
if cnt % 2 == p[k]:
onlight[k] = 1
if sum(onlight) == m:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
l = [False] * n
for j in range(n):
if (i>>j) & 1:
l[j] = True
for j in range(m):
if [l[k-1] for k in ks[j][1:]].count(True) % 2 != p[j]:
break
else:
ans += 1
print(ans) | p03031 |
n, m = list(map(int, input().split()))
ls = []
for _ in range(m):
k, *s, = [int(x)-1 for x in input().split()]
ls.append(s)
p = list(map(int, input().split()))
def base_n(x, n, zero_padding=8):
retval = [[], ['0']][x == 0]
while x > 0:
x, r = divmod(x, n)
retval.append(str(r))
cnt = zero_padding - len(retval)
pad = ['', '0'*cnt][cnt > 0]
return pad+''.join(retval[::-1])
ans = 0
for i in range(2**n):
base_2 = base_n(i, 2, n)
for j in range(m):
switchs = ls[j]
cond = p[j]
on_cnt = 0
for switch in switchs:
if int(base_2[switch]):
on_cnt += 1
if on_cnt % 2 != cond:
break
else:
ans += 1
print(ans) | from itertools import product
n, m = list(map(int, input().split()))
ls = []
for _ in range(m):
k, *s, = [int(x)-1 for x in input().split()]
ls.append(s)
p = list(map(int, input().split()))
it = ["01"]*n
ans = 0
for b in product(*it):
base_2 = "".join(b)
for j in range(m):
switchs = ls[j]
cond = p[j]
on_cnt = 0
for switch in switchs:
if int(base_2[switch]):
on_cnt += 1
if on_cnt % 2 != cond:
break
else:
ans += 1
print(ans) | p03031 |
from itertools import product
n, m = list(map(int, input().split()))
ls = []
for _ in range(m):
k, *s, = [int(x)-1 for x in input().split()]
ls.append(s)
p = list(map(int, input().split()))
it = ["01"]*n
ans = 0
for b in product(*it):
base_2 = "".join(b)
for j in range(m):
switchs = ls[j]
cond = p[j]
on_cnt = 0
for switch in switchs:
if int(base_2[switch]):
on_cnt += 1
if on_cnt % 2 != cond:
break
else:
ans += 1
print(ans) | n, m = list(map(int, input().split()))
ls = []
for _ in range(m):
k, *s, = [int(x)-1 for x in input().split()]
ls.append(s)
p = list(map(int, input().split()))
ans = 0
def dfs(x, s):
global ans
if x == n:
for j in range(m):
switchs = ls[j]
cond = p[j]
on_cnt = 0
for switch in switchs:
if int(s[switch]):
on_cnt += 1
if on_cnt % 2 != cond:
break
else:
ans += 1
else:
for c in "01":
dfs(x+1, s+c)
dfs(0, "")
print(ans)
| p03031 |
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
flag = True
for j in range(M):
s = ks[j][1:]
count = 0
for v in s:
if i & (1<<(v-1)):
count += 1
if count % 2 != p[j]:
flag = False
if flag:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
s = []
for i in range(m):
s.append(list(map(int, input().split()))[1:])
p = list(map(int, input().split()))
ans = 0
for i in range(1<<n):
isOn = []
for j in range(n):
if i & (1<<j):
isOn.append(j+1)
flag = True
for j in range(m):
count = 0
for v in s[j]:
if v in isOn:
count += 1
if count % 2 != p[j]:
flag = False
if flag:
ans += 1
print(ans)
| p03031 |
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
# print(N, M)
# print(ks)
# print(p)
ans = 0
import itertools
for i in itertools.product([0,1], repeat=N):
righted = 0
for iter, j in enumerate(ks):
# print(iter, j )
cnt = 0
for k in range(1,len(j)):
cnt += i[j[k]-1]
if cnt % 2 == p[iter]:
righted += 1
if len(ks) == righted:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
S = [list(map(int, input().split()))[1:] for _ in range(m)]
P = list(map(int, input().split()))
ans = 0
for b in range(2 ** n):
onswitch = [i + 1 for i in range(n) if (b >> i) & 1]
if all(sum(o in s for o in onswitch) % 2 == p for s, p in zip(S, P)):
ans += 1
print(ans) | p03031 |
N, M = list(map(int, input().split()))
k = [input().split() for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for n in range(2 ** N):
is_mismatch = False
for i in range(M):
cnt = 0
for si in k[i][1:]:
if (n >> (int(si) - 1)) & 1:
cnt = (cnt + 1) % 2
if cnt != p[i]:
is_mismatch = True
break
if not is_mismatch:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
swtiches = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** n):
is_on = True
for j in range(m):
k = swtiches[j][0]
s = swtiches[j][1:]
cnt = 0
for si in s:
if i >> (si - 1) & 1:
cnt += 1
if cnt % 2 != p[j]:
is_on = False
if is_on:
ans += 1
print(ans) | p03031 |
N, M = list(map(int,input().split()))
K = []
S = []
for _ in range(M):
KS = list(map(int,input().split()))
k = KS.pop(0)
K.append(k)
S.append(KS)
P = list(map(int,input().split()))
cnt = 2 ** N
ans = 0
for i in range(cnt):
flg = 1
for j in range(M):
s = S[j]
sum_s = 0
for x in s:
sum_s += 2 ** (x - 1)
calc = sum_s & i
sum_str = bin(calc)
div = sum_str.count('1') % 2
if P[j] == div:
continue
else:
flg = 0
break
if flg == 1:
ans += 1
print(ans) | N, M = list(map(int,input().split()))
K = []
S = []
for _ in range(M):
KS = list(map(int,input().split()))
k = KS.pop(0)
K.append(k)
S.append(KS)
P = list(map(int,input().split()))
cnt = 2 ** N
ans = 0
sum = [0] * M
for j in range(M):
for x in S[j]:
sum[j] += 2 ** (x - 1)
for i in range(cnt):
flg = 1
for j in range(M):
calc = sum[j] & i
sum_str = bin(calc)
div = sum_str.count('1') % 2
if P[j] == div:
continue
else:
flg = 0
break
if flg == 1:
ans += 1
print(ans) | p03031 |
n, m = list(map(int, input().split()))
s = []
for i in range(m):
inputs = list(map(int, input().split()))
k = inputs[0]
s.append(inputs[1:])
p = list(map(int, input().split()))
res = 0
for i in range(2 ** n):
flag = True
bit_i = bin(i)[2:].zfill(n)
for j in range(m):
sum_s = 0
for idx in s[j]:
sum_s += int(bit_i[idx-1])
if sum_s % 2 != p[j]:
flag = False
break
if flag:
res += 1
print(res) | N, M = list(map(int, input().split()))
S = []
for _ in range(M):
ks = list(map(int, input().split()))
S.append(ks[1:])
P = list(map(int, input().split()))
ans = 0
for i in range(2**N):
bi = str(bin(i))[2:]
bi = bi.zfill(N)
isAddable = True
for j in range(M):
s_sum = 0
for s in S[j]:
if bi[s-1] == '1':
s_sum += 1
if s_sum % 2 != P[j]:
isAddable = False
break
if isAddable:
ans += 1
print(ans) | p03031 |
N, M = list(map(int, input().split()))
k = [0]*M
s = [""]*M
for i in range(M):
tmp = list(map(int, input().split()))
k[i] = tmp[0]
s[i] = tmp[1:]
p = list(map(int, input().split()))
ans = 0
for i in range(2**N):
global_count = 0
for j in range(M):
local_count = 0
for x in s[j]:
if (i >> (x - 1)) % 2 == 0:
continue
else:
local_count += 1
if local_count % 2 == p[j]:
global_count += 1
if global_count == M:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
K = [[0]*N for i in range(M)]
for i in range(M):
tmp = list(map(int, input().split()))
for j in tmp[1:]:
K[i][j-1] = 1
p = list(map(int, input().split()))
ans = 0
for i in range(2**N):
tmp = [0]*M
for j in range(N):
if (i >> j) % 2 == 1:
for k in range(M):
tmp[k] += K[k][j]
for j in range(M):
if tmp[j] % 2 != p[j]:
break
if j == M-1:
ans += 1
print(ans)
| p03031 |
N,M=list(map(int,input().split()))
s=[list(map(int,input().split()))[1:] for m in range(M)]
p=list(map(int,input().split()))
count=0
for i in range(1<<N):
for m in range(M):
switch=0
for j in range(N):
if (i>>j)&1 and j+1 in s[m]:
switch+=1
if switch%2!=p[m]:
break
else:
count+=1
print(count) | N, M = list(map(int, input().split()))
s = [list(map(int, input().split()))[1:] for _ in range(M)]
p = list(map(int, input().split()))
count = 0
for i in range(2 ** N):
for m in range(M):
switch = 0
for j in range(N):
if (i >> j) & 1:
if j + 1 in s[m]:
switch += 1
if switch % 2 != p[m]:
break
else:
count += 1
print(count) | p03031 |
'''
https://atcoder.jp/contests/abc128/tasks/abc128_c
'''
def main():
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#mod = 1000000007
n, m = list(map(int, input().split()))
switch_list = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ret = 0
for j in range(2**n):
cnt = 0
for i in range(m):
total = 0
for k in switch_list[i][1:]:
if j & 2**(k-1):
total += 1
if total%2 == p[i]:
cnt += 1
else:
break
if cnt == m:
ret += 1
print(ret)
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
switch_list = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ret = 0
for j in range(2**n):
for i in range(m):
total = 0
flag = 1
for k in switch_list[i][1:]:
if j & 2**(k-1):
total += 1
if not total%2 == p[i]:
flag = 0
break
if flag:
ret += 1
print(ret)
if __name__ == '__main__':
main() | p03031 |
N, M = list(map(int, input().split()))
bulbs = []
for i in range(M):
k, *s = list(map(int, input().split()))
bulbs.append((k, s))
p = list(map(int, input().split()))
ans = 0
for i in range(1 << N):
on_cnt = [0] * M
for j in range(N):
if i >> j & 1:
for k in range(M):
if j + 1 in bulbs[k][1]:
on_cnt[k] = (on_cnt[k] + 1) % 2
if on_cnt == p:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
bulbs = []
for i in range(M):
k, *s = list(map(int, input().split()))
bulbs.append((k, s))
p = list(map(int, input().split()))
ans = 0
for i in range(1 << N):
on_cnt = [0] * M
for j in range(N):
if i >> j & 1:
for k in range(M):
if j + 1 in bulbs[k][1]:
on_cnt[k] ^= 1
if on_cnt == p:
ans += 1
print(ans)
| p03031 |
n,m=list(map(int,input().split()))
ans=0
e=[set(list(map(int,input().split()))[1:]) for i in range(m)]
f=list(map(int,input().split()))
for i in range(2**n):
l={a for a,b in zip(list(range(1,n+1)),bin(i)[2:].zfill(n)) if b=="1"}
for j in range(1,m+1):
if len(e[j-1]&l)%2!=f[j-1]:break
else:ans+=1
print(ans) | def ma():
n,m=list(map(int,input().split()))
ans=0
e=[set(list(map(int,input().split()))[1:]) for i in range(m)]
f=list(map(int,input().split()))
for i in range(2**n):
l={a for a,b in zip(list(range(1,n+1)),bin(i)[2:].zfill(n)) if b=="1"}
for j in range(1,m+1):
if len(e[j-1]&l)%2!=f[j-1]:break
else:ans+=1
print(ans)
if __name__=="__main__":
ma() | p03031 |
def ma():
n,m=list(map(int,input().split()))
ans=0
e=[set(list(map(int,input().split()))[1:]) for i in range(m)]
f=list(map(int,input().split()))
for i in range(2**n):
l={a for a,b in zip(list(range(1,n+1)),bin(i)[2:].zfill(n)) if b=="1"}
if sum([int(len(e[j-1]&l)%2 !=f[j-1]) for j in range(1,m+1)])==0:ans+=1
print(ans)
if __name__=="__main__":
ma() | def ma():
n,m=list(map(int,input().split()))
ans=0
e=[set(list(map(int,input().split()))[1:]) for i in range(m)]
f=list(map(int,input().split()))
for i in range(2**n):
l={a for a,b in zip(list(range(1,n+1)),bin(i)[2:].zfill(n)) if b=="1"}
if sum({int(len(e[j-1]&l)%2 !=f[j-1]) for j in range(1,m+1)})==0:ans+=1
print(ans)
if __name__=="__main__":
ma() | p03031 |
N, M = list(map(int, input().split()))
lights = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
on = 0
onoff = bin(i)[2:].zfill(N)
for j, switches in enumerate(lights):
if sum(onoff[s-1] == '1' for s in switches[1:]) % 2 == p[j]:
on += 1
if on == M:
ans += 1
print(ans) | N, M = list(map(int, input().split()))
connected = [list(map(int,input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
for j,lst in enumerate(connected):
count = 0
for s in lst[1:]:
if (i>>(s-1)) & 1:
count += 1
if count % 2 != p[j]:
break
else:
ans += 1
print(ans)
| p03031 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[]
for _ in range(m):
a=LI()
l.append(a[1:])
l2=LI()
pattern=[]
for i in range(1<<n):
_l=[]
for j in range(n):
_l.append(1 if i&(1<<j) else 0)
pattern.append(_l)
ans=0
for x in pattern:
f=True
for i,y in enumerate(l):
on_num=0
for z in y:
on_num+=x[z-1]
if not f:
break
if f and l2[i]!=on_num%2:
f=False
break
if f:
ans+=1
return ans
# main()
print((main()))
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[]
for _ in range(m):
a=LI()
l.append(a[1:])
lp=LI()
a=[]
for i in range(1<<n):
_a=[]
for j in range(n):
if i&(1<<j):
_a.append(1)
else:
_a.append(0)
a.append(_a)
ans=0
for x in a:
f=True
for i,y in enumerate(l):
_sum=0
for z in y:
_sum+=x[z-1]
if _sum%2!=lp[i]:
f=False
break
if f:
ans+=1
return ans
# main()
print((main()))
| p03031 |
import itertools
N,M=list(map(int,input().split()))
kslist=[]
for i in range(M):
kslist.append(list(map(int,input().split())))
plist=list(map(int,input().split()))
seq=[0]*N+[1]*N
ls=list(set(list(itertools.permutations(seq,N))))
n=0
for tup in ls:
ln=[]
for j in range(M):
sum1=0
for k in range(1,kslist[j][0]+1):
sum1+=tup[kslist[j][k]-1]
ln.append(sum1%2)
if ln==plist:
n+=1
print(n)
| import itertools
N,M=list(map(int,input().split()))
kslist=[(list(map(int,input().split()))) for i in range(M)]
plist=list(map(int,input().split()))
ls=list((itertools.product(list(range(2)),repeat=N)))
n=0
for tup in ls:
n+=1
for j in range(M):
sum1=0
for k in range(1,kslist[j][0]+1):
sum1+=tup[kslist[j][k]-1]
if sum1%2!=plist[j]:
n=n-1
break
print(n)
| p03031 |
n,m=list(map(int,input().split()))
switch=[list(map(int,input().split())) for i in range(m)]
p=list(map(int,input().split()))
ans=0
for i in range(2**n):
cnt=[0]*m
for j in range(n):
if (i>>j)&1==1:
for k in range(m):
if j+1 in switch[k][1:]:
cnt[k]+=1
l=[i%2 for i in cnt]
if l==p:
ans+=1
print(ans) | n,m=list(map(int,input().split()))
s=[list(map(int,input().split()))[1:] for _ in range(m)]
p=list(map(int,input().split()))
ans=0
for i in range(2**n):
tmp=[]
cnt=[0]*n
for j in range(n):
if (i>>j)&1:
tmp.append(j+1)
for k in range(m):
if len(set(tmp)&set(s[k]))%2!=p[k]:
break
else:
ans+=1
print(ans) | p03031 |
n,m=list(map(int,input().split()))
s=[]
for _ in range(m):
_,*t=list(map(int,input().split()))
s.append(t)
p=list(map(int,input().split()))
a=0
for i in range(2**n):
f=1
for j in range(m):
g=1
g&=(sum([int(bin(i>>(u-1)),2) for u in s[j]])%2==p[j])
f&=g
a+=f
print(a) | n,m=list(map(int,input().split()))
s=[]
for _ in range(m):_,*t=list(map(int,input().split()));s.append(t)
*p,=list(map(int,input().split()))
print((sum([all([sum([i>>(u-1)for u in s[j]])%2==p[j]for j in range(m)])for i in range(2**n)]))) | p03031 |
# bit演算
N, M = list(map(int, input().split()))
# 各スイッチがどの電球に繋がっているかをbitで持つ
# スイッチ1が電球1、電球2に繋がっている場合は
# 101 -> 5 という持ち方
a = [0] * N
for i in range(M):
K, *S = list(map(int, input().split()))
for j in range(K):
s = S[j]
s -= 1
# s番目のスイッチにi番目の電球が繋がっている
a[s] |= 1 << i
expected = 0
l = list(map(int, input().split()))
for i in range(M):
expected |= l[i] << i
# on/offの2通り、スイッチは最大10個なので、# 2^10=1024で全通り試してもOK
# on/offの全ての組み合わせをbitでループする
ans = 0
for s in range(1 << N):
# 各電球の状態(bit)
lighting = 0
for i in range(N):
# iビット目が立っているか
if s >> i & 1:
# スイッチを押して、つながった電球の状態を反転させる
lighting ^= a[i]
# 各スイッチを押した後の電球の状態が理想と一致するか
if lighting == expected:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
a = [0] * N
for i in range(M):
K, *S = list(map(int, input().split()))
for j in range(K):
s = S[j]
s -= 1
# s番目のスイッチにi番目の電球が繋がっている
a[s] |= 1 << i
expected = 0
P = list(map(int, input().split()))
for i in range(M):
if P[i]:
expected |= 1 << i
ans = 0
for s in range(1 << N): # スイッチの状態
tmp = 0
for i in range(N):
if s >> i & 1:
tmp ^= a[i]
if tmp == expected:
ans += 1
print(ans)
| p03031 |
import itertools
n, m = list(map(int, input().split()))
switches = []
for i in range(m):
line = list(map(int, input().split()))
switches.append(line[1:])
p = list(map(int, input().split()))
# スイッチに関して全探索
ans = 0
for item in itertools.product([0, 1], repeat=n):
flag = True
for i, switch in enumerate(switches):
on_count = 0
for s in switch:
on_count += item[s-1]
if on_count % 2 != p[i]:
flag = False
if flag: ans += 1
print(ans)
| import itertools
n, m = list(map(int, input().split()))
s = [list(map(int, input().split()))[1:] for _ in range(m)]
p = list(map(int, input().split()))
ans = 0
for item in itertools.product([0, 1], repeat=n):
for i in range(m):
if sum([item[j-1] for j in s[i]]) % 2 != p[i]:
break
else:
ans += 1
print(ans)
| p03031 |
import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
s = list(map(int, input().split()))
S.append(s[1:])
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat = N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans) | import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
k, *s = list(map(int, input().split()))
S.append(s)
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat = N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans) | p03031 |
import sys
input = sys.stdin.readline
from itertools import product
N,M = list(map(int,input().split()))
S = [list(map(int,input().split()))[1:] for _ in range(M)]
P = list(map(int,input().split()))
ans = 0
for p in product([0,1],repeat=N):
can = 0
for i in range(M):
res = 0
for s in S[i]:
if p[s-1] == 1:
res += 1
res %= 2
if res == P[i]:
can += 1
if can == M:
ans += 1
print(ans) | N,M = list(map(int,input().split()))
S = [list(map(int,input().split()))[1:] for _ in range(M)]
P = list(map(int,input().split()))
ans = 0
for mask in range(0,1<<N):
flag = True
for i, line in enumerate(S):
cnt = 0
for s in line:
if ((mask >> (s-1) & 1)):
cnt += 1
if cnt % 2 != P[i]:
flag = False
break
if flag:
ans += 1
print(ans) | p03031 |
from sys import stdin
from itertools import combinations_with_replacement,product
n,m = [int(x) for x in stdin.readline().rstrip().split()]
li = [list(map(int,stdin.readline().rstrip().split())) for _ in range(m)]
p = list(map(int,stdin.readline().rstrip().split()))
hai = [0,1]
hai = list(product(hai, repeat=n))
point = 0
for i in range(len(hai)):
h = list(hai[i])
kai = 0
for j in range(m):
gou = 0
for k in range(1,len(li[j])):
if h[li[j][k]-1] == 1:
gou += 1
if p[j] != gou%2:
kai += 1
if kai == 0:
point += 1
print(point) | n,m = list(map(int,input().split()))
li = [list(map(int,input().split()))[1:] for _ in range(m)]
p = list(map(int,input().split()))
ans = 0
for i in range(1 << n):
switch = set()
for j in range(n):
if (i >> j)&1:
switch.add(j+1)
for k in range(m):
point = 0
for l in li[k]:
if l in switch:
point += 1
if point%2 != p[k]:
break
else:
ans += 1
print(ans) | p03031 |
import itertools
N, M = list(map(int, input().split()))
lights = []
for i in range(M):
lights.append([int(x) for x in input().split()])
p = [int(x) for x in input().split()]
ans = 0
switches = 0b1111111111 >> (10 - N)
for _ in range(0, switches + 1):
flag = True
for i in range(M):
s = 0
for j in range(1, lights[i][0] + 1):
s += (_ & (0b1 << (lights[i][j] - 1))) >> (lights[i][j] - 1)
if s % 2 != p[i]:
flag = False
if flag:
ans += 1
print(ans)
| N, M = list(map(int, input().split()))
lights = []
for _ in range(M):
lights.append([int(i) for i in input().split()])
p = [int(i) for i in input().split()]
ans = 0
for switch in range(0, 2**N):
flag = True
for i in range(M):
s = 0
for j in range(lights[i][0]):
s += (switch >> (lights[i][j + 1] - 1)) & 0b1
if s % 2 != p[i]:
flag = False
if flag:
ans += 1
print(ans)
| p03031 |
N,M = list(map(int,input().split()))
in_M =[[]]*M
for m in range(M):
in_M[m] = list(map(int,input().split()))
out_M = list(map(int,input().split()))
all_on_cnt = 0
for i in range(2**N):
switch = [0]*N
for j in range(N):
if((i>>j) & 1): # iをj回右シフトさせ末尾をみる
switch[j] = 1
for j in range(M):
total = 0
for l in range(1,in_M[j][0]+1):
total += switch[in_M[j][l]-1]
if total%2 != out_M[j]:
break
else:
all_on_cnt += 1
print(all_on_cnt) | n,m = list(map(int,input().split()))
swi = []
for _ in range(m):
k, *sss = list(map(int,input().split()))
t = 0
for s in sss:
t += 1 << (s-1)
swi.append(t)
ppp = list(map(int,input().split()))
ans = 0
for bit in range(1<<n):
for s,p in zip(swi,ppp):
t = bit&s
c = bin(t).count("1") % 2
if c != p:
break
else:
ans += 1
print(ans) | p03031 |
n=int(eval(input()));result=[]
while n!=0:
r=n%2
n=(n-r)//-2
result.append(r)
print((''.join(map(str,(result[::-1]))) if result else 0)) | n=int(eval(input()));result=[]
while n!=0:
r=n%2
n=(n-r)//-2
result.append(r)
print((''.join(map(str,result[::-1])) if result else 0)) | p03286 |
import math
import sys
n = int(eval(input()))
if n == 0:
print((0))
sys.exit()
keta = 0
under = 0
s = ""
nn = 1
if n > 0:
while True:
if sum([2**i for i in range(0,nn,2)])+1<= n and n <= sum([2**i for i in range(0,nn+1,2)]):
keta = nn+1
under = sum([2**i for i in range(0,nn,2)])
break
else:
nn+=1
for i in range(1,keta):
remainder = (n-under)%(2**i)
if remainder in range(1,2**(i-1)+1):
s += "0" if i%2==1 else "1"
else:
s += "1" if i%2==1 else "0"
else:
s+="1"
print((s[::-1]))
else:
while True:
if n <= sum([(-2)**i for i in range(1,nn,2)]) and n >= sum([(-2)**i for i in range(1,nn+1,2)]):
keta = nn+1
under = sum([(-2)**i for i in range(1,nn,2)])
break
else:
nn+=1
for i in range(1,keta):
remainder = abs(n-under)%(2**i)
if remainder in range(1,2**(i-1)+1):
s += "1" if i%2==1 else "0"
else:
s += "0" if i%2==1 else "1"
else:
s+="1"
print((s[::-1]))
| #!/usr/bin/env python3
import sys
from math import ceil
def solve(N: int):
if N == 0:
print((0))
return
answer = ""
while N != 0:
syou = ceil(N/-2)
amari = N-syou*-2
answer+= str(amari)
N = syou
print((answer[::-1]))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
| p03286 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(eval(input()))
if N == 0:
print('0')
exit()
ans = ''
while abs(N) > 0:
if abs(N) % 2 == 0:
ans += '0'
N //= 2
elif N < 0:
N = (N - 1) // 2
ans += '1'
else:
ans += '1'
N //= 2
N *= -1
print((ans[::-1]))
| N = int(eval(input()))
if N == 0:
print('0')
exit()
ans = ''
while abs(N) > 0:
if abs(N) % 2 == 0:
ans += '0'
N //= 2
else:
N -= 1
N //= 2
ans += '1'
N *= -1
print((ans[::-1]))
| p03286 |
from math import ceil, log
from itertools import product
def solve(string):
n = int(string)
base = [2**i for i in range(1, 40)]
inc = [(-2)**i for i in range(40)]
ans = ""
for b, i in zip(base, inc):
if n % b >= b // 2:
n -= i
ans += "1"
else:
ans += "0"
if n == 0:
break
return ans[::-1]
if __name__ == '__main__':
print((solve(eval(input()))))
| def solve(string):
n = int(string)
base = [(-2)**i for i in range(40)]
ans = ""
for b in base:
if n % abs(2 * b) >= abs(b):
n -= b
ans += "1"
else:
ans += "0"
if n == 0:
break
return ans[::-1]
if __name__ == '__main__':
print((solve(eval(input()))))
| p03286 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
from itertools import accumulate
from bisect import bisect_left
if N==0:
print((0))
elif N>0:
even = [0, 1]
for i in range(1, 21):
even.append(2**(i*2))
cum = list(accumulate(even))
idx = bisect_left(cum, N)
maxi = cum[idx]-cum[idx-1]
val = N-cum[idx-1]
ans = ['1']
up = maxi
for i in range(maxi.bit_length()-1):
up //= 2
if val>up:
if i%2==0:
ans.append('0')
else:
ans.append('1')
val -= up
else:
if i%2==0:
ans.append('1')
else:
ans.append('0')
print((''.join(ans)))
elif N<0:
N = -N
even = [0]
for i in range(21):
even.append(2**(i*2+1))
cum = list(accumulate(even))
idx = bisect_left(cum, N)
maxi = cum[idx]-cum[idx-1]
val = N-cum[idx-1]
ans = ['1']
up = maxi
for i in range(maxi.bit_length()-1):
up //= 2
if val>up:
if i%2==0:
ans.append('0')
else:
ans.append('1')
val -= up
else:
if i%2==0:
ans.append('1')
else:
ans.append('0')
print((''.join(ans))) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
ans = []
for i in range(50):
if N%2==1:
ans.append('1')
if i%2==0:
N -= 1
else:
N += 1
else:
ans.append('0')
N //= 2
if N==0:
break
print((''.join(ans[::-1])))
| p03286 |
N = int(eval(input()))
ans = ""
while N != 0:
ans = str(N % 2)+ans
N = -(N//2)
print((ans if ans != ""else 0))
| N = int(eval(input()))
ans = ""
while N:
ans = str(N % 2)+ans
N = -(N//2)
print((ans if ans != ""else 0))
| p03286 |
n = int(eval(input()))
I = [[0,1]]
while n < I[-1][0] or I[-1][1] < n:
if len(I)%2 != 0:
I += [[I[-1][0]-2**(len(I)),I[-1][1]]]
else:
I += [[I[-1][0],I[-1][1]+2**(len(I))]]
ans = ''
for i in range(len(I)):
if abs((I[-i-1][0]+I[-i-1][1])/2) < abs(n) and n * (-1)**(len(I)-i-1) > 0:
ans += '1'
n -= (-2)**(len(I)-i-1)
else:
ans += '0'
print((int(ans))) | N = int(eval(input()))
lt = [0 for _ in range(50)]
rt = [0 for _ in range(50)]
lt[0] = 1
rt[0] = 1
lt[1] = -2
rt[1] = -1
for i in range(2, 50):
if i % 2 == 0:
lt[i] = rt[i - 2] + 1
rt[i] = lt[i] + 2**i - 1
else:
rt[i] = lt[i - 2] - 1
lt[i] = rt[i] - 2**i + 1
res = [0 for _ in range(50)]
while N:
for i in range(50):
if lt[i] <= N <= rt[i]:
res[~i] = 1
N -= (-2)**i
break
print((int(''.join(map(str, res))))) | p03286 |
import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
x = 1
for j in range(16):
if (i >> j) & 1:
# temp += (-2) ** (2 *j)
temp += x
x *= 4
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
x = 2
for j in range(16):
if (i >> j) & 1:
# temp2 += (-2) ** (2 *j + 1)
temp2 += x
x *= 4
n2 = n + temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | n = int(eval(input()))
n2 = n
ans = ""
for i in range(100):
while n != 0:
r = (n % 2)
n = (n - r) // (-2)
ans = str(r) + ans
if n2==0:
print("0")
else:
print(ans) | p03286 |
import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
for j in range(16):
if (i >> j) & 1:
temp += (-2) ** (2 *j)
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
for j in range(16):
if (i >> j) & 1:
temp2 += (-2) ** (2 *j + 1)
n2 = n - temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
x = 1
for j in range(16):
if (i >> j) & 1:
# temp += (-2) ** (2 *j)
temp += x
x *= 4
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
x = -2
for j in range(16):
if (i >> j) & 1:
# temp2 += (-2) ** (2 *j + 1)
temp2 += x
x *= 4
n2 = n - temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | p03286 |
import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
x = 1
for j in range(16):
if (i >> j) & 1:
# temp += (-2) ** (2 *j)
temp += x
x *= 4
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
x = -2
for j in range(16):
if (i >> j) & 1:
# temp2 += (-2) ** (2 *j + 1)
temp2 += x
x *= 4
n2 = n - temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
x = 1
for j in range(16):
if (i >> j) & 1:
# temp += (-2) ** (2 *j)
temp += x
x *= 4
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
x = 2
for j in range(16):
if (i >> j) & 1:
# temp2 += (-2) ** (2 *j + 1)
temp2 += x
x *= 4
n2 = n + temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | p03286 |
import bisect
n = int(eval(input()))
ps = [0] * (1 << 16)
for i in range(1 << 16):
temp = 0
x = 1
for j in range(16):
if (i >> j) & 1:
# temp += (-2) ** (2 *j)
temp += x
x *= 4
ps[i] = temp
pattern1 = None
pattern2 = None
for i in range(1 << 16):
temp2 = 0
x = 2
for j in range(16):
if (i >> j) & 1:
# temp2 += (-2) ** (2 *j + 1)
temp2 += x
x *= 4
n2 = n + temp2
pattern1 = bisect.bisect_left(ps, n2)
if pattern1 != (1 << 16) and ps[pattern1] == n2:
pattern2 = bin(i)[2:].zfill(16)
pattern1 = bin(pattern1)[2:].zfill(16)
break
ans = ""
for i in range(16):
ans += pattern2[i]
ans += pattern1[i]
true_ans = ""
flag = False
for i in range(len(ans)):
if ans[i]=="1":
true_ans += "1"
flag = True
elif flag:
true_ans += "0"
if true_ans == "":
true_ans = "0"
print(true_ans) | n = int(eval(input()))
n2 = n
ans = ""
for i in range(100):
while n != 0:
r = (n % 2)
n = (n - r) // (-2)
ans = str(r) + ans
if n2==0:
print("0")
else:
print(ans) | p03286 |
n=int(eval(input()))
t=1
b=''
for i in range(len(bin(n))):
if n%(2*t): b='1'+b; n-=t
else: b='0'+b
t*=-2
print((int(b))) | n = int(eval(input()))
b = ''
while n:
b = str(n%2)+b
n = -(n//2)
print((b if b else 0)) | p03286 |
# coding: utf-8
import sys
import bisect
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: 数
"""
return int(eval(input()))
def IL(self):
"""
1行を空白で区切りリストにします(int
:return: リスト
"""
return list(map(int, self.input().split()))
def SL(self):
"""
1行の文字列を空白区切りでリストにします
:return: リスト
"""
return list(map(str, self.input().split()))
def ILS(self, n):
"""
1列丸々取得します(int
:param n: 行数
:return: リスト
"""
return [int(self.input()) for _ in range(n)]
def SLS(self, n):
"""
1列丸々取得します（str
:param n: 行数
:return: リスト
"""
return [self.input() for _ in range(n)]
class Idea:
def __init__(self):
pass
def HF(self, p):
"""
Half enumeration
半分全列挙です
pの要素の和の組み合わせを作ります。
ソート、重複削除行います
:param p: list : 元となるリスト
:return: list : 組み合わせられた和のリスト
"""
return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))
def Bfs2(self, a):
"""
bit_full_search2
bit全探索の改良版
全探索させたら2進数のリストと10進数のリストを返す
:return: list２つ : １個目 2進数(16桁) 2個目 10進数で合計
"""
# 参考
# https://blog.rossywhite.com/2018/08/06/bit-search/
# https://atcoder.jp/contests/abc105/submissions/4088632
value = []
for i in range(1 << len(a)):
output = []
for j in range(len(a)):
if ((i >> j) & 1) == 1:
"""右からj+1番目のiが1かどうか判定"""
# output.append(a[j])
output.append(a[j])
value.append([format(i, 'b').zfill(16), sum(output)])
value.sort(key=lambda x: x[1])
bin = [value[k][0] for k in range(len(value))]
val = [value[k][1] for k in range(len(value))]
return bin, val
"""ここからメインコード"""
def main():
# 1文字に省略
r, e = range, enumerate
ip = IP()
id = Idea()
"""コピーコードです。https://atcoder.jp/contests/abc105/submissions/4088632
こちらを参考にテストを行っています。"""
n = ip.I()
# それぞれ半分全列挙
list1 = [(-2) ** i for i in r(16)]
list2 = [(-2) ** (i + 16) for i in r(16)]
list1_bin, list1_val = id.Bfs2(list1)
list2_bin, list2_val = id.Bfs2(list2)
# 2分探索
ans = 0
for i in r(len(list1_val)):
j = bisect.bisect_left(list2_val, n - list1_val[i])
if j < len(list2_val) and list1_val[i] + list2_val[j] == n:
ans = list2_bin[j] + list1_bin[i]
break
print((int(ans)))
main() | # coding: utf-8
import sys
import bisect
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: 数
"""
return int(eval(input()))
def IL(self):
"""
1行を空白で区切りリストにします(int
:return: リスト
"""
return list(map(int, self.input().split()))
def SL(self):
"""
1行の文字列を空白区切りでリストにします
:return: リスト
"""
return list(map(str, self.input().split()))
def ILS(self, n):
"""
1列丸々取得します(int
:param n: 行数
:return: リスト
"""
return [int(self.input()) for _ in range(n)]
def SLS(self, n):
"""
1列丸々取得します（str
:param n: 行数
:return: リスト
"""
return [self.input() for _ in range(n)]
class Idea:
def __init__(self):
pass
def HF(self, p):
"""
Half enumeration
半分全列挙です
pの要素の和の組み合わせを作ります。
ソート、重複削除行います
:param p: list : 元となるリスト
:return: list : 組み合わせられた和のリスト
"""
return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))
def Bfs2(self, a):
"""
bit_full_search2
bit全探索の改良版
全探索させたら2進数のリストと10進数のリストを返す
:return: list２つ : １個目 2進数(16桁) 2個目 10進数で合計
"""
# 参考
# https://blog.rossywhite.com/2018/08/06/bit-search/
# https://atcoder.jp/contests/abc105/submissions/4088632
value = []
for i in range(1 << len(a)):
output = []
for j in range(len(a)):
if ((i >> j) & 1) == 1:
"""右からj+1番目のiが1かどうか判定"""
# output.append(a[j])
output.append(a[j])
value.append([format(i, 'b').zfill(16), sum(output)])
value.sort(key=lambda x: x[1])
bin = [value[k][0] for k in range(len(value))]
val = [value[k][1] for k in range(len(value))]
return bin, val
"""ここからメインコード"""
def main():
"""クラス呼び出し等行うよ"""
# 1文字に省略
r, e = range, enumerate
ip = IP()
id = Idea()
"""この下から書いてね"""
"""コピーコードです。"""
n = ip.I()
s = ''
while True:
r = n % (-2)
n //= -2
if r < 0:
r += 2
n += 1
s += str(r)
if n == 0: break
print((s[::-1]))
main()
| p03286 |
n=int(input())
deg=[0]*40
if n>=0:
for i in range(32):
if n>>i&1:
if i%2==0:
deg[i]+=1
if deg[i]>=2:
deg[i+1]+=1
deg[i+2]+=1
deg[i]-=2
else:
deg[i]+=1
deg[i+1]+=1
if deg[i]>=2:
deg[i+1]-=1
deg[i]-=2
if deg[i+1]>=2:
deg[i+2]+=1
deg[i+3]+=1
deg[i+1]-=2
else:
if i%2==0:
if deg[i]>=2:
deg[i+1]+=1
deg[i+2]+=1
deg[i]-=2
else:
if deg[i]>=2:
deg[i+1]-=1
deg[i]-=2
if deg[i+1]>=2:
deg[i+2]+=1
deg[i+3]+=1
deg[i+1]-=2
else:
n*=-1
for i in range(32):
if n>>i&1:
if i%2==1:
deg[i]+=1
if deg[i]>=2:
deg[i+1]+=1
deg[i+2]+=1
deg[i]-=2
else:
deg[i]+=1
deg[i+1]+=1
if deg[i]>=2:
deg[i+1]-=1
deg[i]-=2
if deg[i+1]>=2:
deg[i+2]+=1
deg[i+3]+=1
deg[i+1]-=2
else:
if i%2==1:
if deg[i]>=2:
deg[i+1]+=1
deg[i+2]+=1
deg[i]-=2
else:
if deg[i]>=2:
deg[i+1]-=1
deg[i]-=2
if deg[i+1]>=2:
deg[i+2]+=1
deg[i+3]+=1
deg[i+1]-=2
deg.reverse()
l=39
for i in range(40):
if deg[i]==1:
l=i
break
print(*deg[l:],sep="")
| n=int(eval(input()))
s=""
while n:
s=str(n&1)+s
n=-(n>>1)
print((s if s else 0)) | p03286 |
def main():
N = int(eval(input()))
def to_bin(n):
"""
n:10進数 -> 2進数
"""
if n == 0:
return 0
digits = []
i = 0
base = 1
while n != 0:
if n % (base*2) == 0:
digits.append("0")
else:
digits.append("1")
n -= base
i += 1
base *= -2
return "".join(digits[::-1])
print((to_bin(N)))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
def to_bin(n):
"""
n:10進数 -> 2進数
"""
if n == 0:
return 0
digits = []
i = 0
base = 1
while n != 0:
if n % (base*-2) == 0:
digits.append("0")
else:
digits.append("1")
n -= base
i += 1
base *= -2
return "".join(digits[::-1])
print((to_bin(N)))
if __name__ == '__main__':
main()
| p03286 |
N = int(eval(input()))
def basem2(n, ans):
if n == 0:
if not ans:
ans.append(0)
return ans
if n > 0:
p, a, k = 1, 1, 0
while n > a:
p *= 4
a += p
k += 2
# print(f"n={n} +{p} bit:{k} => {n-p}")
else:
assert n < 0
p, a, k = -2, -2, 1
while n < a:
p *= 4
a += p
k += 2
# print(f"n={n} {p} bit:{k} => {n-p}")
while len(ans) < k + 1:
ans.append(0)
ans[k] = 1
return basem2(n - p, ans)
print(("".join([str(x) for x in reversed(basem2(N, []))])))
| N = int(eval(input()))
ans = [0]
def solve(n):
if n == 0:
return
if n > 0:
p, a, k = 1, 1, 0
else:
p, a, k = -2, -2, 1
while abs(n) > abs(a):
p *= 4
a += p
k += 2
while len(ans) <= k:
ans.append(0)
ans[k] = 1
solve(n - p)
solve(N)
print(("".join([str(x) for x in reversed(ans)])))
| p03286 |
n = int(eval(input()))
i = 1
num = ""
SUM = 0
amari = 1
while not(n == amari == SUM or SUM == n) or num == "":
amari = n % 2**i
if amari == SUM % 2**i:
num += "0"
else:
SUM += (-2)**(i-1)
num += "1"
i += 1
#print(amari,SUM)
print((num[::-1])) | n = int(eval(input()))
i = 1
num = ""
SUM = 0
amari = 1
if n == 0:
num = "0"
while not(n == amari == SUM or SUM == n): #or num == "":
amari = n % 2**i
if amari == SUM % 2**i:
num += "0"
else:
SUM += (-2)**(i-1)
num += "1"
i += 1
#print(amari,SUM)
print((num[::-1])) | p03286 |
N = int(eval(input()))
ans = ''
isOdd = False
while N != 0 :
if N % 2 == 1 :
ans += '1'
else :
ans += '0'
if isOdd :
N += 1
N //= 2
isOdd = not isOdd
if ans == '' :
print('0')
else :
print((ans[::-1])) | N = int(eval(input()))
if N == 0:
print((0))
exit()
ans = []
while N != 0:
d = len(ans)
if N % 2 == 1:
ans.append('1')
N -= pow(-1, d)
N //= 2
else:
ans.append('0')
N //= 2
print((''.join(ans[::-1])))
| p03286 |
n = int(eval(input()))
if n == 0:
print((0))
exit()
ans = ""
while n != 0:
if n%-2 < 0:
r = n%-2+2
n = n//-2+1
else:
r = n%-2
n = n//-2
ans += str(r)
print((int(ans[::-1]))) | n = int(eval(input()))
ans = ""
if n==0:
print((0))
exit()
while n!=0:
n, r = n//(-2), n%(-2)
if r<0:
r += 2
n += 1
ans += str(r)
print((ans[::-1])) | p03286 |
N = int(eval(input()))
str2N = bin(abs(N))[2:]
S = ''
inc = 0
for i, s in enumerate(str2N[::-1]):
S += str((int(s) + inc) % 2)
if N > 0:
if i % 2 == 0:
inc = (int(s) + inc) // 2
else:
inc = 1 if (int(s) + inc) else 0
else:
if i % 2 == 0:
inc = 1 if (int(s) + inc) else 0
else:
inc = (int(s) + inc) // 2
S += str(inc)
if abs(N) > 0:
S = S[::-1][S[::-1].find('1'):]
if N > 0:
if len(S) % 2 == 0:
S = '1' + S
else:
if len(S) % 2 != 0:
S = '1' + S
print(S)
else:
print('0') | N = int(eval(input()))
def n_ary_notation(N, n):
if N == 0:
return '0'
else:
s = ''
while N:
s = str(N % abs(n)) + s
N -= N % abs(n)
N //= n
return s
print((n_ary_notation(N, -2))) | p03286 |
import bisect
def put(a,b): #結果の表示
l=max(len(a),len(b)) #aとbの長さが違うときに壊れるので以下で十分な長さの0を結合しておく
a="0"*l+a
b="0"*l+b
s=""
for i in range(-1,-l-1,-1): #長さの偶奇を考えたくないので逆順に生成してあとで反転
s+=a[i]+b[i]
s=s[-1::-1] #反転
ind=s.find("1")
print((s[ind:])) #頭にたくさんついている0を除いて表示
def quad(i): #数値を4進数表記の文字列に直す。16→"100"など。
s=""
while i>0:
s+=str(i%4)
i//=4
return s[-1::-1]
l=[0,1]
for i in range(1,18): #候補の生成。最長で18ビット。
l+=[4**i+j for j in l]
n=int(eval(input()))
if n==0: #n==0は出力が空文字になってしまうので別に扱う
print("0")
else:
for i in range(len(l)):
ind=bisect.bisect_left(l,(l[i]-n)//2)
if l[i]-2*l[ind]==n:
put(quad(l[i]),quad(l[ind]))
break | def solve(n):
ret=""
i=0
while True:
if i%2==1 and n%2==1: #奇数ビットが1のとき
n+=2
ret+=str(n%2)
n//=2
if n==0:
break
i+=1
return ret[-1::-1] #逆順に結合されているので反転
n=int(eval(input()))
if n==0:
print((0))
elif n<0: #負数は左ビットシフトして一文字落とす
print((solve(n*(-2))[:-1]))
else:
print((solve(n)))
| p03286 |
import bisect
def put(a, b): # 結果の表示
l = max(len(a), len(b)) # aとbの長さが違うときに壊れるので以下で十分な長さの0を結合しておく
a = "0" * l + a
b = "0" * l + b
s = ""
for i in range(-1, -l-1, -1): # 長さの偶奇を考えたくないので逆順に生成してあとで反転
s += a[i] + b[i]
s = s[-1::-1] # 反転
print((s[s.find("1"):])) # 頭にたくさんついている0を除いて表示
def quad(i): # 数値を4進数表記の文字列に直す。16→"100"など。
s = ""
while i > 0:
s += str(i % 4)
i //= 4
return s[-1::-1]
l = [0, 1]
for i in range(1, 20): # 候補の生成。最長で20ビット。
l += [4 ** i + j for j in l]
n = int(eval(input()))
if n == 0: # n==0は出力が空文字になってしまうので別に扱う
print("0")
else:
for i in range(len(l)):
ind = bisect.bisect_left(l, (l[i] - n) // 2)
if l[i] - 2 * l[ind] == n:
put(quad(l[i]), quad(l[ind]))
break | def solve(n):
ret = ""
i = 0 # n%2が元の何ビット目にあたるか
while True:
if i % 2 == 1 and n % 2 == 1: # 奇数ビットが1のとき
n += 2
ret += str(n % 2)
n //= 2 # 1ビット右にずらす
i += 1
if n == 0:
break
return ret[-1::-1] # 逆順に結合されているので反転
n = int(eval(input()))
if n == 0:
print((0))
elif n < 0: # 負数は左ビットシフト、一文字落として表示
n *= -2
print((solve(n)[:-1]))
else:
print((solve(n))) | p03286 |
n = int(eval(input()))
st = ""
while n != 0:
r = n % 2
if r < 0:
r += 2
n = int((n - r) / (-2))
st += str(r)
st = st[::-1]
if st == "":
st = "0"
print(st) | n = int(eval(input()))
ans = ""
while n != 0:
r = n % (-2)
if r < 0:
r += 2
n = int((n - r) / (-2))
ans += str(r)
if ans == "":
print((0))
else:
print((ans[::-1])) | p03286 |
import math
n = int(eval(input()))
if n == 0:
print((0))
exit()
out = ""
i = 0
while n != 0:
if n % -2 != 0:
out = str(- (n % -2)) + out
# print("n:{} div:{}=(-2)^{}".format(n, (-2) ** i, i))
else:
out = str(- (n % -2)) + out
# 123->100, -123->-100
if n > 0:
n = int(n / (-2))
else:
n = math.ceil(n / (-2))
i += 1
print(out)
"""
tmp = 1
digit = 0
while tmp < n:
tmp *= 4
digit += 1
number = [0 for i in range(digit)]
print(number)
tmp = n
for i in range(digit):
if 0 < tmp % 4 < 4:
number[i] = tmp % 4
tmp = int(tmp / 4)
"""
| import math
# print("{}/{}={} %{}".format(-123, 10, -123/10, -123 %10))
n = int(eval(input()))
if n == 0:
print((0))
exit()
out = ""
i = 0
while n != 0:
if n % -2 != 0:
out = str(- (n % -2)) + out
# print("n:{} div:{}=(-2)^{}".format(n, (-2) ** i, i))
else:
out = str(- (n % -2)) + out
# 12 -> 2 + 10^1, -12 -> 8 + 2*(-10)^1
if n > 0:
n = int(n / (-2))
else:
n = math.ceil(n / (-2))
i += 1
print(out)
| p03286 |
def m(K):return "1" if K==1 else "0" if K==0 else m(-(K-K%2)//2)+str(K%2)
print((m(int(eval(input())))))
| def m(K):return str(K) if K*K==K else m(-(K-K%2)//2)+str(K%2)
print((m(int(eval(input()))))) | p03286 |
N=int(eval(input()));S=""
while(True):
if N*N==N:S+=str(N);break
S+=str(N%2);N=(N-N%2)//(-2)
print((S[::-1])) | N=int(eval(input()));S=""
while 1:
if N*N==N:S+=str(N);break
S+=str(N%2);N=(N-N%2)//(-2)
print((S[::-1]))
| p03286 |
# -*- coding: utf-8 -*-
import sys
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
a = INT()
if a == 0:
print((0))
exit()
ans = ''
i = 0
while abs(a) > 0:
# 小さいビットから見て行って、余るかどうかで値を特定していく
if a % 2**(i+1) != 0:
a -= (-2)**i
ans += '1'
else:
ans += '0'
i += 1
print((ans[::-1]))
| # -*- coding: utf-8 -*-
import sys
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
a = INT()
if a == 0:
print((0))
exit()
ans = ''
while abs(a) > 0:
# 小さいビットから見て行って、その時点の偶奇で値を特定していく
if a % 2 == 1:
# 今の末尾の桁は1だったので、その分を引く
a -= 1
ans += '1'
else:
ans += '0'
# -2進数は-2で割れば桁を落とせる(10進数で割る10する感じ)
a /= -2
print((ans[::-1]))
| p03286 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
#ts=time.time()
#sys.setrecursionlimit(10**6)
#input=sys.stdin.readline
show_flg=False
show_flg=True
n=I()
ans=0
d=0
while n!=0:
k=2**(d+1)
if n%k!=0:
ans+=1*10**d
n-=(-2)**d
d+=1
print(ans)
| n=int(eval(input()))
t=[]
x=0
for i in range(60):
y=((n-x)%(1<<(i+1)))*(-1)**i
if y==(-2)**i:
t+=['1']
x+=(-2)**i
else:
t+=['0']
if x==n:
break
print((''.join(t)[::-1])) | p03286 |
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
# globals
N = 0
def set_inputs():
global N
N = get_int()
return
def main():
setrecursionlimit(100000)
set_inputs()
if N == 0:
print((0))
return
n = N
ans = []
while n != 0:
rem = n % 2
n = (n - rem) // (-2)
ans.append(rem)
ans.reverse()
print(("".join(map(str, ans))))
return
def get_int():
return int(eval(input()))
def get_float():
return float(eval(input()))
def get_str():
return input().strip()
def get_li():
return [int(i) for i in input().split()]
def get_lf():
return [float(f) for f in input().split()]
def get_lc():
return list(input().strip())
def get_data(n, types):
if len(types) == 1:
return [types[0](eval(input())) for _ in range(n)]
return list(zip(*(
[t(x) for t, x in zip(types, input().split())]
for _ in range(n)
)))
if __name__ == '__main__':
main()
| from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
# globals
N = 0
def set_inputs():
global N
N = get_int()
return
def base_10_to_n(x, n):
mod = x % n
mod = abs(mod)
div = (x - mod) // n
if div == 0:
return str(mod)
return base_10_to_n(div, n) + str(mod)
def main():
setrecursionlimit(100000)
set_inputs()
print((base_10_to_n(N, -2)))
return
def get_int():
return int(eval(input()))
def get_float():
return float(eval(input()))
def get_str():
return input().strip()
def get_li():
return [int(i) for i in input().split()]
def get_lf():
return [float(f) for f in input().split()]
def get_lc():
return list(input().strip())
def get_data(n, types):
if len(types) == 1:
return [types[0](eval(input())) for _ in range(n)]
return list(zip(*(
[t(x) for t, x in zip(types, input().split())]
for _ in range(n)
)))
if __name__ == '__main__':
main()
| p03286 |
N=int(eval(input()))
if N == 0:
print("0")
else:
S = ""
while N != 0:
if N %2 != 0:
S = "1" + S
N -= 1
else:
S = "0" + S
N /= -2
print(S)
| n = int(eval(input()))
s = ''
flag = True
while flag:
if n % 2 != 0:
s = '1' + s
n -= 1
else:
s = '0' + s
n /= -2
if n == 0:
flag = False
print(s) | p03286 |
n = int(eval(input()))
s = ''
i = 1
while(n != 0):
nt = abs(n)
res = 1 if (nt & abs(i)) else 0
s = str(res) + s
n -= res * i
i *= -2
print((s if len(s) else 0)) | n = int(eval(input()))
s = ''
if (n == 0):
s = '0'
while(n != 0):
bit = abs(n) % 2
s = str(bit) + s
n -= bit
n //= -2
print(s)
| p03286 |
import sys
N = int(eval(input()))
if N == -1:
print('11')
sys.exit()
if N == 0:
print('0')
sys.exit()
if N == 1:
print('1')
sys.exit()
def num(N):
mi = 0
ma = 1
k = 1
while mi > N or ma < N:
mi = min(mi,mi+(-2)**k)
ma = max(ma,ma+(-2)**k)
k += 1
return k-1
rem = 0
ansli = []
def ans(N):
while abs(N)>0:
ansli.append(num(N))
N = N-(-2)**num(N)
return ansli
ans(N)
answer = ''
m = max(ansli)
while m >= 0:
if m in ansli:
answer += '1'
else:
answer += '0'
m += -1
print(answer) | import sys
N = int(eval(input()))
if N == 0:
print((0))
sys.exit()
ans = ''
k = 1
while N != 0:
if N%(2**k) == 0:
ans = '0'+ans
else:
ans = '1'+ans
N = N-((-2)**(k-1))
k += 1
print(ans) | p03286 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
L = 100000
N = NI()
s = 1 if N > 0 else -1
n = abs(N)
bit = [0] * L
i = 0
while n > 0:
if n % 2:
bit[i] += 1
if s > 0 and i % 2 == 1 or s < 0 and i % 2 == 0:
bit[i+1] += 1
n //= 2
i += 1
for i in range(L-2):
if bit[i] > 1:
bit[i+2] += bit[i] // 2
bit[i+1] += bit[i] // 2
bit[i] = bit[i] % 2
f = False
ans = ''
for i in range(L-1,-1,-1):
if bit[i] == 1:
ans = ''.join((ans,'1'))
f = True
elif f:
ans = ''.join((ans,'0'))
if ans == '': ans = '0'
print(ans)
if __name__ == '__main__':
main() | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
L = 1000
N = NI()
if N == 0:
print(0)
exit(0)
s = 1 if N > 0 else -1
n = abs(N)
bit = [0] * L
i = 0
while n > 0:
if n % 2:
bit[i] += 1
if s > 0 and i % 2 == 1 or s < 0 and i % 2 == 0:
bit[i+1] += 1
n //= 2
i += 1
for i in range(L-2):
b = bit[i]
if b > 1:
b1 = bit[i+1]
if b1 > 0:
if b1 >= b//2:
bit[i+1] -= b//2
bit[i] = b % 2
else:
bit[i+1] = 0
bit[i] -= b1 * 2
if bit[i] > 1:
bit[i+2] += bit[i] // 2
bit[i+1] += bit[i] // 2
bit[i] = bit[i] % 2
bit.reverse()
i = bit.index(1)
print(*bit[i:],sep='')
if __name__ == '__main__':
main()
| p03286 |
N = int(eval(input()))
ans = [0] * 40
if N == 0:
print((0))
exit()
else:
while N != 0:
i = 1 if N < 0 else 0
k = pow(-2, i)
while abs(N) > abs(k):
i += 2
k += pow(-2, i)
ans[i] = 1
N -= pow(-2, i)
for j in range(39, -1, -1):
if ans[j] == 1:
print((''.join(map(str, reversed(ans[:j + 1])))))
exit()
| N = int(eval(input()))
k = 0
i = 0
ans = []
while k != N:
j = pow(-2, i)
p = '1' if (N - k - j) % pow(2, i + 1) == 0 else '0'
ans.append(p)
k += int(p) * j
i += 1
if N == 0:
print((0))
else:
print((''.join(reversed(ans))))
| p03286 |
N = int(eval(input()))
ans = []
if N == 0:
ans.append("0")
while N != 0:
ans.append(str(N % 2))
N = -(N // 2)
ans.reverse()
print(("".join(ans))) | N = int(eval(input()))
a = []
if N == 0:
a.append("0")
while N != 0:
a.append(str(N % 2))
N = -(N // 2)
print(("".join(reversed(a)))) | p03286 |
#coding:utf-8
n = int(eval(input()))
ans = ''
while(n != 0):
if n % 2 != 0:
n -= 1
ans = '1' + ans
else:
ans = '0' + ans
n /= -2
if ans == '': ans = '0'
print(ans) | # coding:utf-8
n = int(eval(input()))
if n == 0:
print((0))
exit()
ans = ''
while abs(n) > 0:
if n % 2 != 0:
ans += '1'
n -= 1
n //= -2
else:
ans += '0'
n //= -2
print((ans[::-1])) | p03286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.