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, ... | #!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()... | 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()... | #!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... | 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
... | 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[... | 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%... | 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... | 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):
... | 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]... | 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:
... | 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:
... | 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 _ ... | 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 = tu... | 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()... | 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]:
... | 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]:
... | 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):
... | 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... | 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(... | 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... | 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... | 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_o... | 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:
... | 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
e... | 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
e... | 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... | 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
... | 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):... | 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 = li... | 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 & s... | 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:... | 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
... | 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
... | 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 i... | 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):... | 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):
bitc... | 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):... | 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.... | # -*- 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 = pro... | 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 = pro... | # -*- 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... | 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 =... | 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... | 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は繋がっているスイッチの情報
... | 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[ma... | 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 r... | 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[... | 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 fo... | # 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 = T... | 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
... | 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:
... | 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
... | 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 ... | 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): ret... | 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): ret... | 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])):... | 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):... | 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 + ... | 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)... | 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,... | 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 itert... | 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()
... | 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)
... | 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スイッチの個数
fo... | 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]
... | 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]... | 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 # 着目している電球につい... | 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 # 着目している電球につい... | 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... | 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 n... | 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
fo... | 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]:
... | 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
... | 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... | 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(... | 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 ... | 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 ... | 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]
... | 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)):
... | 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 ran... | 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 )... | 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
... | 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)... | 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:
... | 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]
su... | 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)... | 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_... | 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
... | 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... | 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) % ... | 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!=... | 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]:
... | 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().spli... | 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:... | 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):
... | 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):
... | 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
prin... | 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]... | 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... | 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... | 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... | 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
... | 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()]
de... | 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()]
de... | 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
... | 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):... | 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... | 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]))... | 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
prin... | 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
... | 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]... | 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 e... | 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
... | 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
... | 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... | 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... | 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)):
... | 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,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
f... | 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 =... | 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 += ... | 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
... | 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... | 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 ... | #!/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]))
retur... | 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, ... | 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:
... | 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__ == '__... | 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... | 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... | 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 = 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
... | 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 ... | 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):
... | 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 ... | 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 ... | 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 ... | 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 ... | 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):... | # 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):... | 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
... | 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:
... | 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:... | 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:
... | 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... | 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
... | 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):... | 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: #負数は左ビットシフトして一文字落... | 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"):])) # 頭にたくさんつ... | 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... | 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 ... | 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 = s... | 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 ... | # -*- 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 ... | 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(... | 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')
... | 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')
... | 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... | 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... | 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... | 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):
... | 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.