input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
a,b,x = list(map(int,input().split()))
print((b//x-(-((-1)*a//x))+1))
| a,b,x = list(map(int,input().split()))
c = -((-1 * a)//x)
d = b // x
print((d - c + 1)) | p03861 |
a,b,x=list(map(int,input().split()))
ans=(b-a+1)//x
z=(b-a+1)%x
for i in range(a,a+z):
if i%x==0:
ans+=1
break
print(ans) | a,b,x=list(map(int,input().split()))
if a>2:
s=b//x
t=(a-1)//x
print((s-t))
elif a==1:
print((b//x))
elif a==0:
print((b//x+1)) | p03861 |
def main():
a, b, x = list(map(int, input().split()))
ans = b // x - a // x
if a % x == 0:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
a, b, x = list(map(int, input().split()))
ans = b // x - (a - 1) // x
print(ans)
if __name__ == "__main__":
main()
| p03861 |
from sys import stdin
il = lambda func=int: list(map(func, stdin.readline().rstrip().split()))
ils = lambda n, s="int(input())": [eval(s) for _ in range(n)]
a, b, x = il()
ans = 0
for i in range(a, b+1):
if i % x == 0:
ans = (b-i) // x + 1
break
print(ans) | from sys import stdin
il = lambda func=int: list(map(func, stdin.readline().rstrip().split()))
ils = lambda n, s="int(input())": [eval(s) for _ in range(n)]
a, b, x = il()
A = (a-1) // x + 1
B = b // x + 1
print((B-A)) | p03861 |
a,b,x=list(map(int,input().split()))
ans=0
for s in range(a,b+1):
if s%x==0:
ans+=1
break
ans+=(b-s)//x
print(ans) | a,b,x=list(map(int,input().split()))
print((b//x - (a-1)//x)) | p03861 |
A, B, X = list(map(int, input().split()))
ans = max(0, B // X - (A - 1) // X)
print(ans) | A, B, X = list(map(int, input().split()))
def f(N):
return N // X
print((f(B) - f(A - 1)))
| p03861 |
a,b,x = list(map(int, input().split()))
c = (b // x) - ((a - 1) // x)
print(c)
| a,b,x=list(map(int,input().split()))
c=(b//x-a//x)
if a%x==0:
print((c+1))
else:
print(c)
| p03861 |
a, b, x = list(map(int, input().split()))
def cal(n, x):
if n== -1:
return 0
else:
return n // x + 1
print((cal(b, x) - cal(a-1, x))) | a, b, x = list(map(int, input().split()))
A = (a - 1) // x
B = b // x
print((B - A))
| p03861 |
a, b, c = list(map(int, input().split()))
print(((b // c) - (a - 1) // c)) | a, b, c = list(map(int, input().split()))
print((b // c - (a - 1) // c)) | p03861 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
a, b, x = list(map(int, input().split()))
print((b // x + 1 - max(0, (a - 1) // x + 1)))
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
a, b, x = list(map(int, input().split()))
res_a = (a - 1) // x
res_b = b // x
print((res_b - res_a))
if __name__ == '__main__':
resolve()
| p03861 |
a, b, x = list(map(int, input().split()))
print((b // x - (a-1) // x)) | a, b, x = list(map(int, input().split()))
print(((b // x) - ((a - 1)// x))) | p03861 |
A,B,X=list(map(int,input().split()))
C=A//X
D=B//X
if A%X==0 and B%X==0:
print((D-C+1))
elif A%X!=0 and B%X==0:
print((D-C))
elif A%X==0 and B%X!=0:
print((D-C+1))
else:
print((D-C)) | A,B,X=list(map(int,input().split()))
C=A//X
D=B//X
if A%X==0:
print((D-C+1))
else:
print((D-C))
| p03861 |
A,B,X=list(map(int,input().split()))
C=A//X
D=B//X
if A%X==0:
print((D-C+1))
else:
print((D-C))
| A,B,X=list(map(int,input().split()))
print(((B//X)-(A-1)//X)) | p03861 |
x = list(map(int,input().split()))
a = 0
b = x[1]+1
for i in range(x[0],x[1]+1):
if i % x[2] ==0:
a = 1
b=i
break
c = (x[1]-b)//x[2] + 1
print(c) | x = list(map(int,input().split()))
a = 0
if x[0]%x[2]==0:
b = x[0]
else:
b = ((x[0] // x[2])+1)*x[2]
c = (x[1]-b)//x[2] + 1
print(c) | p03861 |
a,b,x=list(map(int,input().split()))
while a%x!=0:
a+=1
while b%x!=0:
b-=1
print(((b-a)//x +1))
| a,b,x=list(map(int,input().split()))
a+=(-a)%x
b-=a%x
print(((b-a)//x +1))
| p03861 |
a,b,x = list(map(int,input().split()))
y = b//x
if a==0:
z = -1
else:
z = (a-1)//x
print((y-z)) | a,b,x = list(map(int,input().split()))
print((b//x-(a-1)//x)) | p03861 |
a,b,x = list(map(int,input().split()))
print((b//x-(a-1)//x)) | a,b,x = list(map(int,input().split()))
cnt2 = b//x
cnt1 = (a-1)//x
print((cnt2-cnt1)) | p03861 |
f=lambda n,x:0 if n==-1 else n//x+1
a,b,x=list(map(int,input().split()))
print((f(b,x)-f(a-1,x))) | a,b,x=list(map(int,input().split()))
f=lambda n:0 if n<0 else n//x+1
print((f(b)-f(a-1))) | p03861 |
a, b, x = list(map(int, input().split()))
y = b - a + 1
if (y % x == 0):
print((y // x))
else:
z = y // x
a2 = a + x * z
x1 = a if (a % x == 0) else a + (x - (a % x))
x2 = x1 + x * z
if (x2 <= b):
print((z + 1))
else:
print(z) | def f(n, x):
return n // x + 1 if (n >= 0) else 0
a, b, x = list(map(int, input().split()))
print((f(b, x) - f(a - 1, x))) | p03861 |
import sys
from io import StringIO
import unittest
def yn(b):
print(("Yes" if b==1 else "No"))
return
def resolve():
readline=sys.stdin.readline
a,b,x=list(map(int, readline().rstrip().split()))
if a%x==0:
f=a
else:
f=a-a%x+x
if f > b:
prin... | import sys
def yn(b):
print(("Yes" if b==1 else "No"))
return
def resolve():
readline=sys.stdin.readline
a,b,x=list(map(int, readline().rstrip().split()))
print((b//x - (a-1)//x))
return
if 'doTest' not in globals():
resolve()
sys.exit() | p03861 |
a,b,x=list(map(int,input().split()))
for i in range(a,b+1):
if i%x==0:
y=(b-i)//x
print((y+1))
exit()
print((0)) | a,b,x=list(map(int,input().split()))
bb=b//x
aa=a//x
ans=bb-aa
if a%x==0:
ans+=1
print(ans) | p03861 |
a,b,x = list(map(int, input().split()))
count=0
for i in range(b-a+1):
if (a+i)%x == 0 :
count+=1
count+=(b-a-i)//x
break
print(count)
| a,b,x = list(map(int, input().split()))
count=0
if a==0 :
count+=1
if a<=x :
ai = x
else:
ai = (a//x)*x
if ai<a :
ai +=x
if ai<=b :
count+=1
count+=(b-ai)//x
print(count)
| p03861 |
a, b, x = list(map(int, input().split()))
print(((b//x+1)-((a-1)//x+1))) | a, b, x = list(map(int, input().split()))
print((b//x-(a-1)//x)) | p03861 |
a, b, x = list(map(int, input().split()))
count = 0
for i in range(a, b+1):
if i % x == 0:
count += ((b - i) // x + 1)
break
print(count) | a, b, x = list(map(int, input().split()))
print((b // x - (a - 1) // x)) | p03861 |
import math
a, b, x = list(map(int, input().split()))
print((b // x - (a - 1) // x))
| a, b, x = list(map(int, input().split()))
print((b // x - (a - 1) // x)) | p03861 |
a, b, x = list(map(int, input().split()))
aa = (a-1) // x
bb = b // x
ans = bb-max(aa, 0)
if a == 0:
ans += 1
print(ans)
| a, b, x = list(map(int, input().split()))
bb = b // x
if a == 0:
print((bb+1))
else:
aa = (a-1)//x
print((bb-aa)) | p03861 |
def resolve():
a, b, x = list(map(int, input().split()))
ans = calc(x, b) - calc(x, a-1)
print(ans)
def calc(x, n):
if n == -1:
return 0
else:
return n//x + 1
if __name__ == '__main__':
resolve() | def resolve():
a, b, x = list(map(int, input().split()))
print((calc(b, x) - calc(a-1, x)))
def calc(num, x):
return num // x
if __name__ == '__main__':
resolve()
| p03861 |
import math
a, b, c = list(map(int, input().split(" ")))
top = b//c
bottom = (a-1)//c
print((top - bottom)) | a,b,k = list(map(int,input().split()))
temp =(a - 1 )//k
if a == 0:
temp = -1
print((b//k - temp)) | p03861 |
#B - Between a and b ...
a,b,x = list(map(int, input().split()))
if a==b:
if a%x==0:
print((1))
else:
print((0))
else:
min_dev = 0
for i in range(a,b+1):
if i%x==0:
min_dev = i
break
max_dev = 0
for i in range(a,b+1)[::-1]:
... | #B - Between a and b ...
import math
a,b,x = list(map(int, input().split()))
if a==b:
if a%x==0:
print((1))
else:
print((0))
else:
"""
min_dev = 0
for i in range(a,b+1):
if i%x==0:
min_dev = i
break
"""
if a==0:
min_d... | p03861 |
a,b,x = list(map(int,input().split()))
answer = 0
flag = 0
for i in range(a,b+1) :
if i % x == 0 :
answer += 1
p = i
flag += 1
break
if flag == 1 :
q = b-p
else :
q = b-a
answer += q//x
print(answer)
| a,b,x = list(map(int,input().split()))
B = b//x
A = (a-1)//x
print((B-A))
| p03861 |
a,b,x=list(map(int,input().split()))
ans=0
if a==0:
a+=1
ans+=1
ans+=(b//x)-(a-1)//x
print(ans) | a,b,x=list(map(int,input().split()))
print(((b//x)-(a-1)//x)) | p03861 |
a, b, x = list(map(int, input().split()))
c = a
d = b
while c % x != 0:
c += 1
while d % x != 0:
d -= 1
print(((d - c) // x +1)) | a, b, x = list(map(int, input().split()))
c = b // x + 1
d = 0
if a - 1 > -1:
d = (a - 1) // x + 1
else:
d = 0
print((c - d)) | p03861 |
a, b, x = list(map(int, input().split()))
cnt = b // x
cnt -= (a - 1) // x
print(cnt) | a, b, x =list(map(int, input().split()))
print(((b // x) - ((a - 1) // x))) | p03861 |
a, b, x = list(map(int, input().split()))
"""
a~b間のxで割り切れる数は何個？
1~b間のxで割り切れる数から1~a間のxで割り切れる数
"""
ans_b = b//x
ans_a = (a-1)//x
print((ans_b - ans_a))
| a, b, x = list(map(int, input().split()))
print((b//x - (a-1)//x))
| p03861 |
#!/usr/bin/env python
a, b, x = list(map(int, input().split()))
if a == b:
if a%x == 0:
print((1))
else:
print((0))
exit()
if a%x == 0 and b%x == 0:
ans = b//x - a//x + 1
print(ans)
exit()
if a%x != 0 and b%x != 0:
ans = b//x - a//x
print(ans)
exit... | #!/usr/bin/env python
a, b, x = list(map(int, input().split()))
def f(n):
global x
if n == -1:
return 0
return n//x + 1
ans = f(b)-f(a-1)
print(ans)
| p03861 |
eval(input());a=list(map(int,input().split()))
b1,b2,b4=[],[],[];ans=''
for i in a:
if i%2!=0:
b1.append(i)
elif i%4==0:
b4.append(i)
elif i%2==0:
b2.append(i)
if b2:
if len(b1)<=len(b4):
ans='Yes'
else:
ans='No'
else:
if len(b1)<=len(b4)+1:
ans='Yes'
else:
an... | eval(input());a=list(map(int,input().split()))
b1,b2,b4=0,0,0
for i in a:
if i%2!=0: b1+=1
elif i%4==0: b4+=1
elif i%2==0: b2+=1
print(('Yes' if b1<=b4 else 'No' if b2 else 'Yes' if b1<=b4+1 else 'No')) | p03637 |
N = int(eval(input()))
l = list(map(int, input().split()))
a, b, c = 0, 0, 0
for i in l:
if i % 4 == 0:
c += 1
elif i % 2 == 0:
b += 1
elif not i % 2 == 0:
a += 1
if b >= 1:
if c >= a:
print("Yes")
else:
print("No")
else:
if c+1 >= a:
... | N = int(eval(input()))
l = list(map(int, input().split()))
a, b, c = 0, 0, 0
for i in l:
if i % 4 == 0:
c += 1
elif i % 2 == 0:
b += 1
else:
a += 1
if b >= 1:
if c >= a:
print("Yes")
else:
print("No")
else:
if c+1 >= a:
print("... | p03637 |
from random import shuffle
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
c = []
f = a.count(2)
a = [i for i in a if i != 2]
for i in range(len(a)):
if a[i] % 4:
b.append(a[i])
else:
c.append(a[i])
d = []
while b and c:
d.append(b.pop())
d.... | n = int(eval(input()))
a = list(map(int, input().split()))
c0 = c1 = c2 = 0
for i in a:
if i % 4 == 0:
c0 += 1
elif i % 2:
c1 += 1
else:
c2 += 1
if c2:
if c1 <= c0:
print('Yes')
else:
print('No')
else:
if c1 <= c0 + 1:
print(... | p03637 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt2 = 0
cnt4 = 0
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 4 != 0:
cnt2 += 1
else:
cnt4 += 1
if cnt2:
if ((n-cnt2+1)//2) <= cnt4:
print('Yes')
else:
print('No')
else:
... | n = int(eval(input()))
a = list(map(int, input().split()))
cnt2 = cnt4 = 0
for i in a:
if i % 2 == 0:
if i % 4 != 0:
cnt2 += 1
else:
cnt4 += 1
if cnt2:
if ((n-cnt2+1)//2) <= cnt4:
print('Yes')
else:
print('No')
else:
if (n-cnt2)/... | p03637 |
from copy import deepcopy
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
div2 = [0] * n
div4 = deepcopy(div2)
notdiv4 = deepcopy(div2)
for i in range(n):
if a[i] % 4 == 0:
div4[i] = 1
elif a[i] % 2 == 0:
div2[i] = 1
... |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
div2 = 0
div4 = 0
notdiv4 = 0
for ea in a:
if ea % 4 == 0:
div4 += 1
elif ea % 2 == 0:
div2 += 1
else:
notdiv4 += 1
notdiv4 += div2 % 2
if ... | p03637 |
# ABC069C - 4-adjacent (ARC080C)
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
f, t, m = 0, 0, 0 # two, four, misc
for i in A:
if i % 4 == 0:
f += 1
elif i % 2 == 0:
t += 1
else:
m += 1
m += t... | # ABC069C - 4-adjacent (ARC080C)
def main():
N, *A = list(map(int, open(0).read().split()))
f, t, m = 0, 0, 0 # two, four, misc
for i in A:
if i % 4 == 0:
f += 1
elif i % 2 == 0:
t += 1
else:
m += 1
m += t % 2
flg = f + 1 >= m
... | p03637 |
import math
N = int(eval(input()))
A = list(map(int,input().split()))
l = list()
ll = list()
for i in range(len(A)):
if A[i]%4 == 0:
l.append(A[i])
if A[i]%2 == 0:
ll.append(A[i])
four = len(l)
two = len(ll)-four
zero = N-two
a = math.floor(N/2)
if a <= four:
print("Yes")
elif a-two/2 <= f... | import math
N = int(eval(input()))
A = list(map(int,input().split()))
l = list()
ll = list()
for i in range(len(A)):
if A[i]%4 == 0:
l.append(A[i])
if A[i]%2 == 0:
ll.append(A[i])
four = len(l)
two = len(ll)-four
zero = N-two
a = math.floor(N/2)
if a <= four:
print("Yes")
elif 2*a-two <= 2... | p03637 |
n=int(eval(input()))
la=list(map(int,input().split()))
lc=[0]*n
for i in range(n):
t=la[i]
while t%2<1 and lc[i]<2:
t//=2; lc[i]+=1
c=[lc.count(i) for i in range(3)]
print(('YNeos'[c[0]-c[2]>1 or (c[0]>c[2]
and n%2<1)::2])) | eval(input());l=[int(i)%4 for i in input().split()];f=l.count;print(('YNeos'[f(0)+f(2)//2<len(l)//2::2])) | p03637 |
n,*l=list(map(int,open(0).read().split()))
d={1:0,2:0,4:0}
for i in l:
if i%2: d[1]+=1
elif i%4: d[2]+=1
else: d[4]+=1
if d[2]: print(('YNeos'[d[1]>d[4]::2]))
else: print(('YNeos'[d[1]-1>d[4]::2])) | eval(input())
l=[int(i)%4 for i in input().split()]
c=l.count
print(('YNeos'[c(0)+c(2)//2<len(l)//2::2])) | p03637 |
N=int(eval(input()))
cnt,zero,one,two,three,four,more=0,0,0,0,0,0,0
d=0
A=list(map(int,input().split()))
B=A[:]
for i in range(N):
while B[i]%2==0:
if B[i]%2==0:
B[i]=B[i]//2
cnt=cnt+1
if cnt==0:
zero += 1
elif cnt==1:
one += 1
elif cnt==2:
two += 1
elif cnt==3:
... | N=int(eval(input()))
cnt,zero,one,two,more,d=0,0,0,0,0,0
A=list(map(int,input().split()))
B=A[:]
for i in range(N):
while B[i]%2==0:
if B[i]%2==0:
B[i]=B[i]//2
cnt=cnt+1
if cnt==0:zero += 1
elif cnt==1:one += 1
else:more += 1
cnt=0
if one%2!=0:d=1
print(("No" if (zero+d)>(two+mor... | p03637 |
n=int(eval(input()))
a=list(map(int,input().split()))
num2=0
num4=0
num0=0
for i in a:
if i%4==0:
num4+=1
elif i%2==0:
num2+=1
else:
num0+=1
if num2==0:
if num0<=num4+1:
print("Yes")
else:
print("No")
else:
if num0<=num4:
print("... | n=int(eval(input()))
a=list(map(int,input().split()))
b_2=0
b_4=0
b_0=0
for i in a:
if i%4==0:
b_4+=1
elif i%2==0:
b_2+=1
else:
b_0+=1
if b_2==0:
if b_0<=b_4+1:
print("Yes")
else:
print("No")
else:
if b_0<=b_4:
print("Yes")
... | p03637 |
n = int(eval(input()))
a_ls = list(map(int, input().split()))
num_mul4 = 0
num_even_not4 = 0
num_odd = 0
for i in range(n):
if a_ls[i] % 4 == 0:
num_mul4 += 1
elif a_ls[i] % 2 == 0:
num_even_not4 += 1
else:
num_odd += 1
res = 'No'
if num_even_not4 == 0:
if num_odd <... | n = int(eval(input()))
a_ls = list(map(int, input().split()))
n_4k = 0
n_2k = 0
n_odd = 0
for i in range(n):
if a_ls[i] % 4 ==0:
n_4k += 1
elif a_ls[i] % 2 ==0:
n_2k += 1
else:
n_odd += 1
res = 'No'
if n_odd == 0:
res = 'Yes'
else:
if n_2k > 0:
if n_o... | p03637 |
n,*A=list(map(int,open(0).read().split()))
C=[0]*3
for a in A:
for i in range(2,-1,-1):
if a%2**i == 0:
C[i] += 1
break
print(("Yes"*(C[0]<=C[2]or (C[0]==C[2]+1 and C[1]==0))or"No")) | n,*A=list(map(int,open(0).read().split()));p=sum(a%2<1for a in A);q=sum(a%4<1for a in A);print(("Yes"*(q==p>n-p-2or n-p<=q)or"No")) | p03637 |
N=int(eval(input()));A=input().split();v=[int(i)%4for i in A];print(('Yes'if v.count(0)+v.count(2)//2>=N//2 else'No')) | N=int(eval(input()));v=[int(i)%4for i in input().split()];print(('Yes'if v.count(0)+v.count(2)//2>=N//2 else'No')) | p03637 |
from sys import stdin
n, *a = list(map(int, stdin.read().split()))
c2, c4 = 0, 0
for i in a:
if i % 2 == 0: c2 += 1
if i % 4 == 0: c4 += 1
if c4 >= len(a) // 2: ans = "Yes"
elif (len(a) - c4 * 2) == (c2 - c4): ans = "Yes"
else: ans = "No"
print(ans) | from sys import stdin
n, *a = list(map(int, stdin.read().split()))
c2, c4 = 0, 0
for i in a:
if i % 2 == 0:
if i % 4 == 0:
c4 += 1
else:
c2 += 1
if c4 >= len(a) // 2: ans = "Yes"
elif (len(a) - c4 * 2) == c2: ans = "Yes"
else: ans = "No"
print(ans) | p03637 |
import itertools
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 'No'
for i in itertools.permutations(a):
count = 0
for j in range(1, len(i)):
if (i[j-1] * i[j]) % 4 == 0:
count += 1
else:
pass
if count == N-1:
ans = 'Yes'
... | N = int(eval(input()))
a = list(map(int, input().split()))
cnt2 = 0 # 2で割り切れる回数
cnt4 = 0 # 4で割り切れる回数
for i in range(N):
if a[i] % 4 == 0:
cnt4 += 1
elif a[i] % 2 == 0:
cnt2 += 1
if N-max(cnt2-1, 0) <= cnt4*2+1:
print('Yes')
else:
print('No')
| p03637 |
from math import floor
N = int(eval(input()))
a = list(map(int, input().split()))
cnt_4 = 0
for i in a:
if i%4==0:
cnt_4 += 1
a.remove(i)
cnt_2 = 0
for i in a:
if i%2==0:
cnt_2 += 1
if floor(N//2)<=cnt_4+(cnt_2//2):
print('Yes')
else:
print('No') | from math import floor
N = int(eval(input()))
a = list(map(int, input().split()))
cnt_4 = 0
for i in a:
if i%4==0:
cnt_4 += 1
cnt_2 = 0
for i in a:
if i%2==0 and i%4!=0:
cnt_2 += 1
if floor(N//2)<=cnt_4+(cnt_2//2):
print('Yes')
else:
print('No') | p03637 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
t=0
f=0
for i in a:
if i%4==0:
f+=1
elif i%2==0:
t+=1
if t==0:
t=1
if n-t+1<=2*f+1:
print("Yes")
else:
print("No")
| n=int(eval(input()))
a=[int(i) for i in input().split()]
c2=0
c4=0
c=0
for i in a:
if i%4==0:
c4+=1
elif i%2==0:
c2+=1
else:
c+=1
if c==0 or c+c2-1<=c4 or c<=c4:
print("Yes")
else:
print("No") | p03637 |
n=int(eval(input()))
A=list(map(int,input().split()))
four=list([x for x in A if x%4==0])
even=list([x for x in A if x%2==0])
odd=list([x for x in A if x%2==1])
# print(len(even))
# print(len(odd))
# print(len(four))
#全ての成分が偶数
if len(even)==len(A):
print('Yes')
exit()
#4の倍数が奇数の半分以上ある（切り下げ）かつ2の倍数が偶数個かつ... | #強い人のコード
N=int(eval(input()))
ans='Yes'
odd=0
four=0
for x in map(int,input().split()):
if x%2==1:
odd+=1
elif x%4==0:
four+=1
#4の倍数+1が奇数の数より少ないとダメ
if four+1<odd:
ans='No'
#4の倍数+1が奇数と同じかつその合計が全体より少ないとダメ（ひとつ奇数が余ることになる）
elif four+1==odd and odd+four<N:
ans='No'
print(ans)
| p03637 |
n = int(eval(input()))
a = list(map(int, input().split()))
num4 = 0
num1 = 0
for i in a:
if i % 4 == 0:
num4 += 1
continue
if i % 2 == 1:
num1 += 1
if num4 >= num1:
print("Yes")
elif num4 + 1 == num1 and (num4 + num1) % 2 == 1 and n - (num4 + num1) == 0:
print("Yes")... | n = int(eval(input()))
a = list(map(int, input().split()))
num4 = 0
num1 = 0
for i in a:
if i % 4 == 0:
num4 += 1
continue
if i % 2 == 1:
num1 += 1
if num4 >= num1 or num4 + 1 == num1 and (num4 + num1) % 2 == 1 and n - (num4 + num1) == 0:
print("Yes")
else:
print("No... | p03637 |
import math
import calendar
import fractions
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in list(itertools.permutations(a)):
flag = 1
for j in range(len(i) - 1):
if i[j] * i[j + 1] % 4 != 0:
flag = 0
break
if flag =... | import math
import calendar
import fractions
import itertools
def my_index(l, x, default=False):
if x in l:
return l.index(x)
else:
return default
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
ans = 0
for i in a:
c = i
cnt = 0
while c % 2 == 0 ... | p03637 |
n = int(eval(input()))
a = list(map(int, input().split()))
a = [i%100 if i >100 else i for i in a]
pair = n*(n - 1)/2
not_4 = 0
ans = 'Yes'
num = len(a)
for i in range(num):
for j in range(num):
if i != j and a[i]*a[j]%4 != 0:
not_4 += 1
if not_4 >= pair:
ans = ... | n = int(eval(input()))
a = list(map(int, input().split()))
four = 0
two = 0
one = 0
for i in a:
if i%4 == 0:
four += 1
elif i%2 == 0 and i%4 != 0:
two += 1
elif i%2 != 0:
one += 1
if four >= one or four + 1 >= two//2 + two%2 + one or n == two:
print('Yes')
else:
print('No') | p03637 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
ki = 0
gu4 = 0
for i in A:
if i % 4 == 0:
gu4 += 1
elif i % 2 != 0:
ki += 1
if N % 2 != 0:
if ki <= gu4 + 1:
print('Yes')
else:
print('No')
else:
if ki <= gu4:
print('Yes')
e... | N = int(eval(input()))
a = [int(i) for i in input().split()]
multip4 = 0
unbreakable = 0
for i in a:
if i % 4 == 0:
multip4 += 1
elif i % 2 != 0:
unbreakable += 1
if N % 2 != 0:
multip4 += 1
if multip4 >= unbreakable:
print('Yes')
else:
print('No') | p03637 |
import itertools
N=int(eval(input()))
A=list(map(int,input().split()))
junretsu=list(itertools.permutations(A))
for j in junretsu:
cnt=0
for i in range(N-1):
if j[i]*j[i+1]%4!=0:
break
else:
cnt+=1
if cnt==N-1:
print('Yes')
exit()
print('... | N=int(eval(input()))
A=list(map(int,input().split()))
div_1,div_2,div_4=0,0,0
for a in A:
if a%4==0:
div_4+=1
elif a%2==0:
div_2+=1
elif a%2!=0:
div_1+=1
if div_2==0 and div_1<=div_4+1:
print('Yes')
elif div_2>0 and div_1<=div_4:
print('Yes')
else:
print(... | p03637 |
def mp2(k):
kk=k
mp=0
while kk>=1:
kr=kk%2
if kr==0:
kk=kk//2
mp=mp+1
# print(kk,kr,mp)
else:
# print(kk,kr,mp)
return mp
return mp
n=int(eval(input()))
a=list(map(int,input().split()))
cnt0=0
... | n=int(eval(input()))
a=list(map(int,input().split()))
b4=0
b2=0
b1=0
for i in range(n):
if a[i]%4==0:
b4+=1
elif a[i]%2==0:
b2+=1
else:
b1+=1
if b2==0:
if b1<=b4+1:
print("Yes")
else:
print("No")
else:
if b1<=b4:
prin... | p03637 |
N = int(eval(input()))
A = list(map(int, input().split()))
odds = []
bai4 = []
for i in range(N):
odds.append(A[i]%2 == 1)
bai4.append(A[i]%4 == 0)
odd = sum(odds)
bi4 = sum(bai4)
bi2 = N - odd - bi4
if odd + bool(bi2) > bi4+1:
print("No")
else:
print("Yes") | import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return... | p03637 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | p03637 |
_,*l=list(map(int,open(0).read().split()));o=t=0
for i in l:
o+=i%2
t+=(i%4>0)
print(("YNeos"[(t>o)+o>len(l)-t+1::2])) | n,*l=list(map(int,open(0).read().split()));o=t=0
for i in l:
o+=i%2
t+=(i%4>0)
print(("YNeos"[(t>o)+o>n-t+1::2])) | p03637 |
n = int(eval(input()))
a = list(map(int, input().split()))
four = 0
two = 0
for i in range(n):
if a[i] % 4 == 0:
four += 1
elif a[i] % 2 == 0:
two += 1
if four >= n // 2 or n - 2 * four <= two:
print("Yes")
else:
print("No")
| n = int(eval(input()))
a = list(map(int, input().split()))
four = 0
two = 0
for i in range(n):
if a[i] % 4 == 0:
four += 1
elif a[i] % 2 == 0:
two += 1
if 2 * four + 1 >= n:
print("Yes")
elif 2 * four + two >= n:
print("Yes")
else:
print("No")
| p03637 |
n = int(eval(input()))
*a, = list(map(int, input().split()))
*b, = [x for x in a if x%4 != 0]
mul_4 = n-len(b)
*c, = [x for x in b if x%2 != 0]
mul_2 = (len(b)-len(c))
k = n-(mul_4+mul_2)
if mul_2 == 0 and k <= mul_4+1:
print("Yes")
elif k <= mul_4:
print("Yes")
else:
print("No")
| n = int(eval(input()))
*a, = list(map(int, input().split()))
b1 = 0
b2 = 0
b4 = 0
for _a in a:
if _a%4 == 0:
b4 += 1
elif _a%2 == 0:
b2 += 1
else:
b1 += 1
if b2 == 0:
print(("Yes" if b1 <= b4+1 else "No"))
else:
print(("Yes" if b1 <= b4 else "No"))
| p03637 |
N = int(eval(input()))
src = list(map(int, input().split()))
x1 = x2 = x4 = 0
for a in src:
if a%2 == 1:
x1 += 1
elif a%4 == 0:
x4 += 1
else:
x2 += 1
def solve():
if x4 >= x1: return True
if x4 + 1 == x1:
return x2 == 0
else: return False
prin... | N = int(eval(input()))
src = list(map(int,input().split()))
one = sum([1 for a in src if a%2])
four = sum([1 for a in src if a%4==0])
two = N - one - four
print(('Yes' if one <= four or (one == four+1 and two==0) else 'No'))
| p03637 |
n,ais = int(input()), list(map(int, input().split()))
import collections
cc = collections.Counter()
for ai in ais:
if ai % 4 == 0: cc[0] += 1
elif ai % 2 == 0: cc[1] += 1
else: cc[2] += 1
q = collections.deque()
while(n):
if len(q) == 0:
for u in range(3)[::-1]:
if cc[u] > 0:
q.append(u)
... |
import collections
n,ais = int(input()), list(map(int, input().split()))
cc = collections.Counter()
for ai in ais:
if ai % 4 == 0: cc[0] += 1
elif ai % 2 == 0: cc[1] += 1
else: cc[2] += 1
q,h = collections.deque([0]), [[2,1,0],[1],[0]]
while(n):
b = False
for u in h[q[-1]] + [-1]:
if u == -1: b =... | p03637 |
def main(N, aa):
"""
a_i * a_(i+1) = 4k
i=2n and i+1=2m
i=4n or i+1=4m
half: 4m -> ok
all: 2n -> ok
example5
2 7 1 8 2 8
- -
2 2 1 8 7 8
all2を作成
残りhalfのパターン
example2
1 2 3 4
2 1 3 4
1 3 4
... | def main(N, aa):
"""
a_i * a_(i+1) = 4k
i=2n and i+1=2m
i=4n or i+1=4m
half: 4m -> ok
all: 2n -> ok
example5
2 7 1 8 2 8
- -
2 2 1 8 7 8
all2を作成
残りhalfのパターン
example2
1 2 3 4
2 1 3 4
1 3 4
... | p03637 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
count1 = 0
count2 = 0
count3 = 0
for i in range(n):
if a[i] % 2 == 0 and a[i] % 4 != 0:
count1 += 1
elif a[i] % 4 == 0:
count2 += 1
else:
count3 += 1
#print(count1, count2, count3)
if count2 >= n // 2:
... | n = int(eval(input()))
a = [int(_) % 4 for _ in input().split()]
e, f = a.count(2), a.count(0)
print((["No", "Yes"][f >= (n - 2 * (e // 2)) // 2])) | p03637 |
n=int(eval(input()))
a=list(map(int, input().split()))
i=0
odd=0
even=0
eveneven=0
while i<n:
if a[i]%4==0:
eveneven+=1
elif a[i]%2==0:
even+=1
else:
odd+=1
i+=1
if even==0 and eveneven>=(odd-1):
print("Yes")
elif even!=0 and eveneven>=odd:
print("Yes... | # whileだと実行時間83msだったけどforでは？
n=int(eval(input()))
a=list(map(int, input().split()))
i=0
odd=0
even=0
eveneven=0
for i in a:
if i%4==0:
eveneven+=1
elif i%2==0:
even+=1
else:
odd+=1
if even==0 and eveneven>=(odd-1):
print("Yes")
elif even!=0 and eveneven>=odd:
... | p03637 |
_ = eval(input())
a = [int(x) for x in input().split()]
odd = []
m4 = []
m2 = 0
for i in a:
if i % 2 != 0:
odd.append(i)
elif i % 4 == 0:
m4.append(i)
else:
m2 = 1
else:
if len(odd) + m2 - 1 <= len(m4):
print("Yes")
else:
print("No") | _ = eval(input())
a = [int(x) for x in input().split()]
odd, m4, m2 = 0, 0, 0
for i in a:
if i % 2 != 0:
odd += 1
elif i % 4 == 0:
m4 += 1
else:
m2 = 1
else:
if odd + m2 - 1 <= m4:
print("Yes")
else:
print("No") | p03637 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
m4 = 0
even = 0
for i in range(n):
if A[i] % 4 == 0:
m4 += 1
if A[i] % 2 == 0:
even += 1
if m4 >= n // 2 or even == n or (n - even) == m4:
print('Yes')
else:
print('No') | N = int(eval(input()))
A = [int(i) for i in input().split()]
cnt = 0
cnt2 = 0
for i in range(N):
if A[i] % 4 == 0:
cnt += 1
elif A[i] % 2 == 0:
cnt2 += 1
ans = 'No'
if cnt2 % 2 == 0:
if cnt >= (N - cnt2) // 2:
ans = 'Yes'
else:
if cnt >= (N - cnt2 + 1) // 2:... | p03637 |
N = int(eval(input()))
n = list(map(int, input().split()))
fourEven = 0
odd = 0
otherEven = 0
for num in n:
if num % 4 == 0:
fourEven += 1
elif num % 2 == 1:
odd += 1
else:
otherEven += 1
# print(len(n) == fourEven + otherEven + otherEven)
if len(n) // 2 <= fourEve... | N = int(eval(input()))
n = list(map(int, input().split()))
fourEven = 0
odd = 0
for num in n:
if num % 4 == 0:
fourEven += 1
elif num % 2 == 1:
odd += 1
if len(n) // 2 <= fourEven or odd <= fourEven:
print('Yes')
else:
print('No') | p03637 |
from collections import Counter
from itertools import takewhile
n = int(eval(input()))
vvv = list(map(int, input().split()))
cnt1 = Counter(vvv[0::2])
cnt2 = Counter(vvv[1::2])
mc1 = cnt1.most_common()
mc2 = cnt2.most_common()
mcs1 = list(takewhile(lambda x: x[1] == mc1[0][1], mc1))
mcs2 = list(takewhile(lam... | from collections import Counter
n = int(eval(input()))
vvv = list(map(int, input().split()))
cnt1 = Counter(vvv[0::2])
cnt2 = Counter(vvv[1::2])
mc1 = cnt1.most_common(2)
mc2 = cnt2.most_common(2)
if mc1[0][0] == mc2[0][0]:
sc1 = mc1[1][1] if len(mc1) > 1 else 0
sc2 = mc2[1][1] if len(mc2) > 1 else 0... | p03246 |
from collections import defaultdict
n = int(eval(input()))
A = [int(x) for x in input().split()]
even = A[0::2]
odd = A[1::2]
EC = defaultdict(int)
EC[0] = 0
OC = defaultdict(int)
OC[0] = 0
for e in even:
EC[e] += 1
for o in odd:
OC[o] += 1
E = sorted([[v, k] for k, v in list(EC.items())], reverse=True... | n=int(eval(input()))
v=list(map(int,input().split()))
a=v[0::2]
b=v[1::2]
c=dict()
d=dict()
for i in a:
if i in c:
c[i]+=1
else:
c[i]=1
for j in b:
if j in d:
d[j]+=1
else:
d[j]=1
e=sorted([[w,v] for v,w in list(c.items())],reverse=True)
f=sorted([[w,v] for v,w in list(d.ite... | p03246 |
n = int(eval(input()))
v = list(input().split())
from collections import Counter
x, y = list(Counter(v[::2]).items()), list(Counter(v[1::2]).items())
x.sort(key=lambda i:i[1], reverse=True)
y.sort(key=lambda i:i[1], reverse=True)
r = []
for a, b in x[:max(len(x), 3)]:
for aa, bb in y[:max(len(y), 3)]:
... | n = int(eval(input()))
v = list(input().split())
from collections import Counter
x, y = list(Counter(v[::2]).most_common(3)), list(Counter(v[1::2]).most_common(3))
x.sort(key=lambda i:i[1], reverse=True)
y.sort(key=lambda i:i[1], reverse=True)
r = []
for a, b in x[:max(len(x), 3)]:
for aa, bb in y[:max(len(... | p03246 |
n = int(eval(input()))
l = list(map(int, input().split()))
if n == 2:
if l[0] == l[1]:
print((1))
else:
print((0))
else:
a = []
b = []
for i in range(n):
if i % 2 == 0:
a.append(l[i])
else:
b.append(l[i])
da = {}
for... | n = int(eval(input()))
l = list(map(int, input().split()))
a = []
b = []
for i in range(n):
if i % 2 == 0:
a.append(l[i])
else:
b.append(l[i])
def createMyList(li):
d = {-1:(0,-1)}
for e in li:
if e not in d:
d[e] = (1,e)
else:
... | p03246 |
N=int(eval(input()))
v=[int(i) for i in input().split()]
if N==2:
if v[0]==v[1]:
print((1))
exit()
else:
print((0))
exit()
A=dict()
B=dict()
L=0
R=0
def inc(D,k):
if k in D:
D[k]+=1
else:
D[k]=1
for i in range(N):
if i%2==0:
... | N=int(eval(input()))
v=[int(i) for i in input().split()]
if N==2:
if v[0]==v[1]:
print((1))
exit()
else:
print((0))
exit()
A=dict()
B=dict()
L=0
R=0
def inc(D,k):
if k in D:
D[k]+=1
else:
D[k]=1
for i in range(N):
if i%2==0:
... | p03246 |
from collections import Counter
n=int(eval(input()))
V=list(map(int,input().split()))
A=V[::2]
B=V[1::2]
a=Counter(A)
b=Counter(B)
x=a.most_common(2)
y=b.most_common(2)
if x[0][0]!=y[0][0]:
print(((n//2-x[0][1])+(n//2-y[0][1])))
else:
if len(x)>1 and len(y)>1:
if x[0][1]>y[0][1]:
print(((n//... | from collections import Counter
n=int(eval(input()))
V=list(map(int,input().split()))
A=V[::2]
B=V[1::2]
a=Counter(A)
b=Counter(B)
x=a.most_common(2)
y=b.most_common(2)
if x[0][0]!=y[0][0]:
print(((n//2-x[0][1])+(n//2-y[0][1])))
else:
if len(x)>1 and len(y)>1:
s=(n//2-x[0][1])+(n//2-y[1][1])
t... | p03246 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
vv = list(map(int, input().split()))
d1 = {}
d2 = {}
for i in range(n):
v = vv[i]
if i%2==0:
if v not in d2:
d2[v] = 0
d2[v] += 1
else:
if v not in d1:
d1[v] = 0
d1[v] += 1
res = 10**7
... | # -*- coding: utf-8 -*-
n = int(eval(input()))
vv = list(map(int, input().split()))
d1 = {}
d2 = {}
for i in range(n):
v = vv[i]
if i%2==0:
if v not in d2:
d2[v] = 0
d2[v] += 1
else:
if v not in d1:
d1[v] = 0
d1[v] += 1
dl1 = sorted(... | p03246 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
c1 = Counter(A[::2])
c2 = Counter(A[1::2])
c1[0] = 0
c2[0] = 0
c1m = max(list(c1.items()), key=lambda x:x[1])
c2m = max(list(c2.items()), key=lambda x:x[1])
c1c2 = max(c for k,c in list(c2.items()) if c1m[0]!=k)
c2c1 = ... | from collections import Counter
n = int(eval(input()))
V = list(map(int, input().split()))
c1 = Counter(V[::2])
c2 = Counter(V[1::2])
c1[0] = 0
c2[0] = 0
(x, cx), (_, cxx) = c1.most_common(2)
(y, cy), (_, cyy) = c2.most_common(2)
if x == y:
print((n - max(cx + cyy, cy + cxx)))
else:
print((n - cx - ... | p03246 |
maxn=10**5+10
n=int(eval(input()))
a=[None]*(n+10)
b=[0]*maxn
c=[0]*maxn
a[1:n+1]=input().split()
for i in range(1,n+1):
a[i]=int(a[i])
if i%2==0:
b[a[i]]+=1
else:
c[a[i]]+=1
max1=max2=maxp=0
for i in range(1,maxn):
if b[i]>=max1:
max2=max1
maxp=i
... | maxn=10**5+10
n=int(eval(input()))
b=[0]*maxn
c=[0]*maxn
a=input().split()
for i in range(0,n):
a[i]=int(a[i])
if i%2==0:
b[a[i]]+=1
else:
c[a[i]]+=1
max1=max(b)
maxp=b.index(max1)
del b[maxp]
max2=max(b)
ans=0
for i in range(0,maxn):
ans=max(ans,c[i]+(max2 if i==m... | p03246 |
n = int(eval(input()))
nums = list(map(int, input().split()))
nums1 = nums[0::2]
nums2 = nums[1::2]
bug1 = [0] * 1000000
bug2 = [0] * 1000000
for num in nums1:
bug1[num] += 1
for num in nums2:
bug2[num] += 1
max_v_1 = max(bug1)
max_i_1 = bug1.index(max_v_1)
max_v_2 = max(bug2)
max_i_2 = b... | n = int(eval(input()))
nums = list(map(int, input().split()))
nums1 = nums[0::2]
nums2 = nums[1::2]
bug1 = [0] * 100001
bug2 = [0] * 100001
for num in nums1:
bug1[num] += 1
for num in nums2:
bug2[num] += 1
max_v_1 = max(bug1)
max_i_1 = bug1.index(max_v_1)
max_v_2 = max(bug2)
max_i_2 = bug... | p03246 |
n=int(eval(input()))
v=list(map(int,input().split()))
a=[[0,i]for i in range(10**5+1)]
b=[[0,i]for i in range(10**5+1)]
for t in sorted(v[0::2]):a[t][0]+=1
for t in sorted(v[1::2]):b[t][0]+=1
c=sorted(a)[::-1]
d=sorted(b)[::-1]
print((n-c[0][0]-[max(c[1][0],d[1][0]),d[0][0]][c[0][1]!=d[0][1]])) | n=int(eval(input()))
*v,=list(map(int,input().split()))
a=[[0,i]for i in range(10**5+1)]
b=[[0,i]for i in range(10**5+1)]
for t,u in zip(sorted(v[::2]),sorted(v[1::2])):a[t][0]+=1;b[u][0]+=1
a.sort(reverse=1)
b.sort(reverse=1)
print((n-a[0][0]-[max(a[1][0],b[1][0]),b[0][0]][a[0][1]!=b[0][1]])) | p03246 |
n=int(eval(input()))
v=list(map(int,input().split()))
w=sorted(a for a in v[0::2])
x=sorted(a for a in v[1::2])
a=[[0,i]for i in range(10**5+1)]
b=[[0,i]for i in range(10**5+1)]
for t in w:
a[t][0]+=1
for t in x:
b[t][0]+=1
c=sorted(a)
d=sorted(b)
e=c[len(c)-1][0]
i=c[len(c)-1][1]
f=d[len(d)-1][0]... | from collections import*
n,*v=list(map(int,open(0).read().split()))
a=Counter(v[::2]).most_common()
b=Counter(v[1::2]).most_common()
if a[0][0]==b[0][0]:
if len(a)>1and len(b)>1:
print((min(n-a[0][1]-b[1][1],n-a[1][1]-b[0][1])))
elif len(a)>1:
print((n-a[1][1]-b[0][1]))
elif len(b)>... | p03246 |
from collections import Counter as C
n = int(eval(input()))
v = [int(a) for a in input().split()]
k1 = C(v[::2]).most_common()[0][0]
v1 = C(v[::2]).most_common()[0][1]
if v1 == n/2:
k2 = 0
v2 = 0
else:
k2 = C(v[::2]).most_common()[1][0]
v2 = C(v[::2]).most_common()[1][1]
k3 = C(v[1::2])... | from collections import Counter as C
n = int(eval(input()))
v = [int(a) for a in input().split()]
a=C(v[::2])
b=C(v[1::2])
a[0]=b[0]=0
a=a.most_common()
b=b.most_common()
if a[0][0] != b[0][0]:
print((n-a[0][1]-b[0][1]))
else:
print((min(n-a[1][1]-b[0][1],n-a[0][1]-b[1][1])))
| p03246 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def mat_mul_opt(_mat_info):
r, c = list(map(int, _mat_info[0]))
rc_info.extend([r, c])
for each in _mat_info[1:]:
rc_info.append(int(each[1]))
for l in range(2, mat_num + 1):
for i in range(1, mat_num - l + 2):
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def mat_mul_opt(_mat_info):
rc_info.extend(list(map(int, _mat_info[0])))
rc_info.extend(list([int(x[1]) for x in _mat_info[1:]]))
for l in range(2, mat_num + 1):
for i in range(1, mat_num - l + 2):
j = i + l - 1
... | p02234 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def mat_mul_opt(_mat_info):
rc_info = list(map(int, _mat_info[0]))
rc_info.extend(list([int(x[1]) for x in _mat_info[1:]]))
for l in range(2, mat_num + 1):
for i in range(1, mat_num - l + 2):
j = i + l - 1
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def mat_mul_opt(_mat_info):
rc_info = list(map(int, _mat_info[0]))
rc_info.extend(list([int(x[1]) for x in _mat_info[1:]]))
ans = [[0] * (mat_num + 1) for _ in range(mat_num + 1)]
for l in range(2, mat_num + 1):
for i in ... | p02234 |
def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for l in range(2,n):
for i in range(1,n-l+1):
j=i+l-1;m[i][j]=1e6
for k in range(i,j):m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
print((m[1][n-1]))
... | def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=x
print((m[r]... | p02234 |
import sys
def s():
n=int(eval(input()))+1
e=list([x.split() for x in sys.stdin])
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=... | def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=x
print((m[r]... | p02234 |
def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=x
print((m[r]... | def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=x
print((m[r]... | p02234 |
def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if 1>m[r][c]or m[r][c]>x:m[r][c]=x
print((m[r]... | def s():
n=int(eval(input()))+1
e=[input().split()for _ in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for i in range(n):
for r in range(n-i-1):
c=r+i+1
for j in range(r+1,c):
x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
if not 0<m[r][c]<=x:m[r][c]=x
print((m[r][c]))... | p02234 |
N = eval(input())
M = [list(map(int, input().split())) for i in range(N)]
cache = {}
for i in range(N):
cache[(i, i+1)] = 0
def dfs(left, right):#[left, right)
if (left, right) in cache:
return cache[(left, right)]
min_cost = float("inf")
for mid in range(left+1, right):
tmp = ... | N = eval(input())
M = [list(map(int, input().split())) for i in range(N)]
cache = {}
for i in range(N):
cache[(i, i+1)] = 0
def dfs(left, right):
if (left, right) in cache:
return cache[(left, right)]
min_cost = float("inf")
for mid in range(left+1, right):
tmp = M[left][0] * M... | p02234 |
import sys
def get_min_cost(n, p):
m = [[0 for x in range(n+1)] for x in range(n+1)]
for s in range(n):
i = 1
for j in range(s+2, n+1):
m[i][j] = sys.maxsize
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
i+=1
return m[1][n]
n = int(eval(input()))
p... |
def mcm(p,n):
m=[[0 for x in range(n+1)] for x in range(n+1)]
for s in range(n):
for i,j in zip(list(range(1,n+1)),list(range(s+2,n+1))):
m[i][j] = 1 << 30
for k in range(i,j):
m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
return m[1][n]
n=int(eval(input()))
p=[0]*(n+1)
for i in r... | p02234 |
import sys, itertools
n = int(sys.stdin.readline())
if n==1:
print((0))
quit()
MM = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
amin = 0
m = MM[0][:]
for i in range(n-1):
amin += m[0]*m[1]*MM[i+1][1]
m[1]=MM[i+1][1]
for t in itertools.permutations(list(range(n-1... | import sys
n = int(sys.stdin.readline())
m = list(map(int, sys.stdin.readline().split()))
for _ in range(n-1):
_, a = sys.stdin.readline().split()
m.append(int(a))
c = [[-1 for _ in range(n)] for _ in range(n)]
def val(a, b):
if a==b: return 0
if c[a][b]>0: return c[a][b]
c[a][b]=v... | p02234 |
n = int(eval(input()))
data = []
for i in range(n):
data.append(list(map(int, input().split())))
dp = [0 for _ in range(n)]
for i in range(n-1):
dp[i] = data[i][0] * data[i][1] * data[i+1][1]
def mul(i, j):
if i == j:
return 0
elif i == j - 1:
return dp[i]
num = 1... | n = int(eval(input()))
data = []
for i in range(n):
data.append(list(map(int, input().split())))
memo = []
for _ in range(n):
memo.append([-1]*n)
def mul(i, j):
if i == j:
return 0
if memo[i][j] >= 0:
return memo[i][j]
num = 100000
for k in range(i, j):
... | p02234 |
import sys
sys.setrecursionlimit(10**7)
inf = float('inf')
def solve():
n = int(sys.stdin.readline())
r = [0] * n
c = [0] * n
for i in range(n):
ri, ci = list(map(int, sys.stdin.readline().split()))
r[i] = ri
c[i] = ci
memo = [[-1]*(n + 1) for i in rang... | import sys
sys.setrecursionlimit(10**7)
inf = float('inf')
def solve():
n = int(sys.stdin.readline())
r = [0] * n
c = [0] * n
for i in range(n):
ri, ci = list(map(int, sys.stdin.readline().split()))
r[i] = ri
c[i] = ci
dp = [[0]*(n + 1) for i in range(n... | p02234 |
class Puzzle:
def __init__(self,panel,space,cnt):
self.panel=panel
self.space=space
self.cnt=cnt
d=(1,-1,4,-4)
model=list(map(str,list(range(8))))
def check(s):
if s==model:
return True
return False
def bfs(s):
m=set()
que=[s]
m.add(tuple(s.panel... | from collections import defaultdict
d=(1,-1,4,-4)
def solve():
que=["01234567"]
while que!=[]:
v=que[0]
del que[0]
pos=v.index("0")
for i in range(4):
idx2=pos+d[i]
if idx2<0 or idx2>7:
continue
if (pos==3 and d[i]... | p00121 |
def to_xyi(str, target):
index = 0
for s in list(str):
if target == int(s):
x = index%4
if index < 4:
y = 0
else:
y = 1
return (x, y, index)
index += 1
def zero_swap(str, mx, my):
zx, zy, zi = to_xyi(str, 0)
for index in range(len(list(str))):
... | MOVE = [[1, 4], [0, 2, 5], [1, 3, 6], [2, 7], [0, 5], [1, 4, 6], [2, 5, 7], [3, 6]]
answers = {"01234567": 0}
def swap(field, a, b):
tmp = list(field)
tmp[a], tmp[b] = tmp[b], tmp[a]
return "".join(tmp)
def breadth_first_search(answers):
q = [[0, "01234567"]]
while len(q) != 0:
g, field = q... | p00121 |
# AOJ 0121 Seven Puzzle
# Python 2017.6.23 bal4u
def swap(state, x, y):
s = list(copy.deepcopy(state))
s[x], s[y] = s[y], s[x]
return tuple(s)
from collections import deque
import copy
MAGIC = 37
move = ((1,4), (0,2,5), (1,3,6), (2,7), (0,5), (1,4,6), (2,5,7), (3,6))
Q = deque()
Q.append(((0,1,2,3... | # AOJ 0121 Seven Puzzle
# Python 2017.6.23 bal4u
def swap(state, x, y):
s = list(state)
s[x], s[y] = s[y], s[x]
return tuple(s)
from collections import deque
MAGIC = 37
move = ((1,4), (0,2,5), (1,3,6), (2,7), (0,5), (1,4,6), (2,5,7), (3,6))
Q = deque()
Q.append(((0,1,2,3,4,5,6,7), 0))
hash = {}
h... | p00121 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.