input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# coding: utf-8
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a + b) * h // 2))
| print(((int(eval(input())) + int(eval(input()))) * int(eval(input())) // 2))
| p03997 |
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a+b)*h//2)) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a+b)*h/2))) | p03997 |
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a+b)*h//2))
| a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a+b)*h/2)))
| p03997 |
a,b,h=list(map(int,[eval(input()) for i in range(3)]))
print((h*(a+b)//2)) | a,b,h=list(map(int,[eval(input())for i in[0]*3]));print((h*(a+b)//2)) | p03997 |
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
answer = (a + b) * h // 2
print(answer) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a + b) * h // 2)) | p03997 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
print(((a+b)*c//2)) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a+b)*h//2)) | p03997 |
a, b, h = (int(eval(input())) for i in range(3))
print((int((a + b) / 2 * h))) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a + b) / 2 * h))) | p03997 |
print(((int(eval(input()))+int(eval(input())))*int(eval(input()))//2)) | x=lambda:int(eval(input()))
print(((x()+x())*x()//2)) | p03997 |
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... | p03997 |
a, b, h = (int(eval(input())) for u in range(3))
print(((a + b) * h // 2)) | a, b, h = (int(eval(input())) for u in range(3))
print((int((a + b) * h / 2))) | p03997 |
import sys
input = sys.stdin.readline
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
ans = (a+b) * h * 0.5
print((int(ans))) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
print(((int(readline()) + int(readline())) * int(readline()) // 2))
| p03997 |
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a,b,h=[int(eval(input())) for i in range(3)]
print(((a+b)*h//2)) | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
a=int(eval(input()))
b=int(eval(input()))
h=int(eval(input()))
print(((a+b)*h//2)) | p03997 |
a, b, h = [int(eval(input())) for _ in range(3)]
print((int((a+b)*h/2))) | a, b, h = [int(eval(input())) for i in range(3)]
print((int((a+b)*h/2))) | p03997 |
a=int(eval(input()))
b=int(eval(input()))
h=int(eval(input()))
S=(a+b)*h//2
print(S) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a+b)*h//2)) | p03997 |
a,b,c,d=eval('['+'int(input()),'*3+'0]');print(((a+b)*c//2)) | f=lambda:int(eval(input()));print(((f()+f())*f()//2)) | p03997 |
for i in range(1,10):
s = input().split()
a = list(map(int, s[1:]))
print(s[0], sum(a), a[0]*200+a[1]*300) | for _ in range(1,10):
a,b,c = input().split()
b,c = list(map(int, [b,c]))
print(a, b+c, b*200+c*300) | p00173 |
N = int(eval(input()))
A = list(map(int, input().split()))
K = sum(A) / sum(range(1, N+1))
D = [A[i+1] - A[i] - K for i in range(-1, N-1)]
for d in D:
if not (d <= 0 and d % N == 0):
print("NO")
break
else:
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
# 毎回1+2+...+N個の石が取り除かれる
Sum = sum(A)
if Sum % (N * (N + 1) // 2) != 0:
print('NO')
exit()
# 操作回数
K = Sum // (N * (N + 1) // 2)
Diff = [A[i] - A[(i - 1)] for i in range(N)]
# 変化量-1が(N-1)箇所、+(N-1)が一か所を、すべて-1した後に、一か所+1と置き換える
Diff = [d ... | p03808 |
import heapq
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
a[i] *= -1
b.append(a[i])
heapq.heapify(b)
while True:
p = heapq.heappop(b)
q = a.index(p)
for i in range(n):
a[q-i] += n-i
if a[q-i]>0:
print('NO')
... | n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
if s%(n*(n+1)//2)!=0:
print('NO')
exit()
ss = s//(n*(n+1)//2)
b = [0 for i in range(n)]
# a[i]-a[i-1] = ss-b[i-1]*n
for i in range(n):
b[i-1] = (ss-a[i]+a[i-1])//n
if b[i-1]<0:
print('NO')
exit()... | p03808 |
#!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
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()... | p03808 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
RejectStones = N * (N+1) // 2
if sum(A) % RejectStones != 0: print("NO")
else:
TotalOperation = sum(A) // RejectStones
sumcheck = 0
for i in range(N-1):
if (TotalOperation - A[i+1] + A[i]) % N != 0 or TotalOperation < A[i+1] - A[... | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
totalA = sum(A)
if totalA % (N * (N + 1) // 2) != 0: print("NO")
else:
Op = totalA // (N * (N + 1) // 2)
subA = [A[(i + 1) % N] - A[i] for i in range(N)]
... | p03808 |
import sys
n = eval(input())
v = list(map(int, input().split(' ')))
startHere = [0 for i in range(n)]
if sum(v) % ((n * (n + 1)) / 2) != 0:
print("NO")
sys.exit()
operations = sum(v) / ((n * (n + 1)) / 2)
for i in range(n):
diff = v[(i + 1) % n] - v[i]
startHere[i] = (operations - diff) / n
c... | import sys
n = eval(input())
v = list(map(int, input().split(' ')))
startHere = [0 for i in range(n)]
if sum(v) % ((n * (n + 1)) / 2) != 0:
print("NO")
sys.exit()
operations = sum(v) / ((n * (n + 1)) / 2)
operationsFound = 0
for i in range(n):
diff = v[(i + 1) % n] - v[i]
if (operations - diff)... | p03808 |
n=int(eval(input()))
lis=list(map(int,input().split()))
num=(n*(n+1))//2
if sum(lis)%num!=0:
print("NO")
exit()
ans=0
for i in range(n):
if abs(lis[i]-lis[i-1]-sum(lis)//num)%n!=0:
print("NO")
exit()
ans+=abs(lis[i]-lis[i-1]-sum(lis)//num)//n
if ans == sum(lis)//num:print("YES")
else:print(... | n=int(eval(input()))
lis=list(map(int,input().split()))
num=(n*(n+1))//2
ll=sum(lis)
if ll%num!=0:
print("NO")
exit()
ans=0
for i in range(n):
if abs(lis[i]-lis[i-1]-ll//num)%n!=0:
print("NO")
exit()
ans+=abs(lis[i]-lis[i-1]-ll//num)//n
if ans == ll//num:print("YES")
else:print("NO")
| p03808 |
n,*a=list(map(int,open(0).read().split()))
b,m=sum(a),n*-~n//2
n-=1
c=b//m
f=b%m>0
for i,j in zip(*[iter([a[-1]]+a*2)]*2):
j-=i
if n:
t=min(0,j//n)
f|=c!=j+n*-t-t
print(('YNEOS'[f::2])) | n,*a=list(map(int,open(0).read().split()))
q,m=divmod(sum(a),n*-~n//2)
print(('YNEOS'[any((y-x-q)%n+m or y-x>q for x,y in zip(a,a[1:]))::2])) | p03808 |
from operator import sub
N = int(eval(input()))
data = list(map(int, input().split()))
step = N * (N+1) // 2
total = sum(data)
#print("-->", total, step)
if total % step:
print("NO")
else:
K = total // step
#print("-->", total, step, K)
datar = [data[i % N] for i in range(-1, N)]
delta = list(... | from operator import sub
N = int(eval(input()))
data = list(map(int, input().split()))
step = N * (N+1) // 2
total = sum(data)
#print("-->", total, step)
if total % step:
print("NO")
else:
K = total // step
#print("-->", total, step, K)
datar = [data[i % N] for i in range(-1, N)]
delta = list(m... | p03808 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a)
one = n * (n+1) // 2
if s % one:
print('NO')
exit()
times = s // one
cnt = 0
b = a[1:]+[a[0]]
for i,j in zip(a,b):
dif = j - i
if (times - dif) % n:
print('NO')
exit()
if (times-dif) // n < 0:
... | N = int(eval(input()))
A = list(map(int,input().split()))
def solve():
q = N * (N + 1) // 2
if sum(A) % q:
return False
times = sum(A) // q
cnt = 0
for i, j in zip(A, A[1:] + [A[0]]):
dif = times + i - j
if dif % N or dif < 0:
return False
cn... | p03808 |
while 1:
s1=input().split('"')
if s1[0]==".":
break
s2=input().split('"')
cnt1=0
cnt2=0
flag=0
if len(s1)!=len(s2):
print("DIFFERENT")
else:
i=0
while i<len(s1):
if s1[i]==s2[i]:
cnt1+=1
... | while 1:
list1=input().split('"')
if list1[0]==".":
break
list2=input().split('"')
cnt1=0
cnt2=0
flag=0
if len(list1)!=len(list2):
print("DIFFERENT")
else:
i=0
while i<len(list1):
if list1[i]==list2[i]:
... | p01102 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
g=a[-1]
def gcd(a,b):
while b:a,b=b,a%b
return a
for i in a:g=gcd(g,i)
if a[-1]<k or k%g!=0:print("IMPOSSIBLE")
else:print("POSSIBLE") | def gcd(a,b):
while b:a,b=b,a%b
return a
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
g=a[0]
for i in a[1:]:g=gcd(g,i)
ans="IMPOSSIBLE"
for i in a:
if k>i:continue
if abs(k-i)%g==0:ans="POSSIBLE"
print(ans) | p03651 |
def gcd(a,b):
while b:a,b=b,a%b
return a
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
g=a[0]
for i in a[1:]:g=gcd(g,i)
ans="IMPOSSIBLE"
for i in a:
if k>i:continue
if abs(k-i)%g==0:ans="POSSIBLE"
print(ans) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
def gcd(a,b):
while b:a,b=b,a%b
return a
g=a[0]
for i in a:g=gcd(g,i)
if max(a)>=k and k%g==0:print("POSSIBLE")
else:print("IMPOSSIBLE") | p03651 |
def factor(N):
ret = []
i = 2
while N > 1:
if N % i == 0:
ret.append(i)
N //= i
else:
i += 1
return ret
from collections import Counter
def solve(N, K, As):
if K > max(As):
return "IMPOSSIBLE"
factors = [Counter(... | def factor(N):
ret = []
i = 2
while N > 1:
if N % i == 0:
ret.append(i)
N //= i
else:
i += 1
return ret
assert (factor(4) == [2, 2])
assert (factor(2) == [2])
assert (factor(3) == [3])
assert (factor(10) == [2, 5])
from collections ... | p03651 |
def main():
n, k = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
a.sort()
diff_min = 10**9 + 7
for i in range(n-1):
diff = abs(a[i] - a[i+1])
diff_min = (min(diff_min,diff) if diff != 0 else diff_min)
for i in range(n):
diff_min = (a[i] ... | def main():
N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
A.sort()
maxA = A.pop()
if maxA < K:
return print("IMPOSSIBLE")
if N == 1:
if maxA == K:
return print("POSSIBLE")
else:
return print("IMPOSSIBLE")... | p03651 |
import math
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
if max(l) < k:
print("IMPOSSIBLE")
exit()
x = l[0]
for i in l:
x = math.gcd(x,i)
if x == 1:
print("POSSIBLE")
else:
for i in l:
if (k-i)%x == 0:
print("POSSIBLE")
ex... | import math
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
if max(l) < k:
print("IMPOSSIBLE")
exit()
x = l[0]
for i in l:
x = math.gcd(x,i)
if k%x:
print("IMPOSSIBLE")
else:
print("POSSIBLE")
| p03651 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def gcd(n, m) :
n, m = max(n, m), min(n, m)
if m == 0 :
return n
return gcd(m, n % m)
dis = A[0]
for a in A :
dis = gcd(dis, a)
for a in A :
if a < K :
continue
if (a - K) % dis == 0 :
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def gcd(n, m):
if m == 0:
return n
return gcd(m, n % m)
G = A[0]
for a in A:
G = gcd(G, a)
for a in A:
if K <= a and (a - K) % G == 0:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
| p03651 |
N,K = (int(i) for i in input().split())
li = [int(i) for i in input().split()]
li.sort()
max = li[-1]
while(len(li) > 1):
v = li[0]
for i in range(1, len(li)):
li[i] = li[i]%v
for _ in range(li.count(0)):
li.remove(0)
li.sort()
if K <= max:
if K%li[0] == max%li[0]:
... | N,K = (int(i) for i in input().split())
li = [int(i) for i in input().split()]
max = max(li)
b = min(li)
for a in li:
while True:
if a%b == 0:
break
tb = b
b = a%b
a = tb
if K <= max:
if K%b == max%b:
print('POSSIBLE')
exit()
pri... | p03651 |
import sys
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
if a[-1] < k:
print('IMPOSSIBLE')
sys.exit(0)
seta = set(a)
if k in seta:
print('POSSIBLE')
sys.exit(0)
def gojoho(l, s):
return s if l % s == 0 else gojoho(s, l % s)
koubaisu = gojoho(a... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
def f(l, s):
return s if l % s == 0 else f(s, l % s)
z = f(a[-1], a[0])
for i in a:
z = f(i, z)
if a[-1] >= k and k % z == 0:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03651 |
# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect i... | # -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect i... | p03651 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a%b
return a
S_possible = "POSSIBLE"
S_impossible = "IMPOSSIBLE"
if N == 1:
if K == A[0]:
print(S_possible)
else:
print(S_impossible)
else:
gcd_... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a%b
return a
S_possible = "POSSIBLE"
S_impossible = "IMPOSSIBLE"
b = 0
for a in A:
b = gcd(a, b)
if K % b or K > max(A):
print(S_impossible)
else:
print(S_p... | p03651 |
def findGCD(a:int, b:int) -> int:
# バリデーション a,bは0以上
if a <= 0:
raise ValueError("aは0より大きくなければいけません。(a:{})".format(a))
elif b <= 0:
raise ValueError("bは0より大きくなければいけません。(b:{})".format(b))
# ユークリッドの互除法
while 1:
if a%b == 0:
return b
else:
... | def findGCD(a:int, b:int) -> int:
# ユークリッドの互除法
while 1:
if a%b == 0:
return b
else:
a = a%b
if b%a == 0:
return a
else:
b = b%a
from functools import reduce
n,k = list(map(int, input().split()))... | p03651 |
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
ans = 0
if k in l:
print("POSSIBLE")
exit()
if n == 1:
l[0] == k
la = []
while True:
for i in range(n):
x = l[i] - k
xx = l[i] + k
if x in l or xx in l :
ans = 1
break... | def gcd(a, b):
while b:
a, b = b, a % b
return a
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
m = max(l)
for i in range(1,n):
l[i] = gcd(max(l[i],l[i-1]),min(l[i],l[i-1]))
if k%l[-1] == 0 and k <= m:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
| p03651 |
from bisect import bisect_left as bl
def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
if K > max(A):
print("IMPOSSIBLE")
exit()
if K in A:
print("POSSIBLE")
exit()
M = max(A)
E = list([abs(x-K) for x in A... | def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
if K > max(A):
print("IMPOSSIBLE")
exit()
if K in A:
print("POSSIBLE")
exit()
E = list([abs(x-K) for x in A])
E = set(E)
C = [A[i+1]-A[i] for i in ra... | p03651 |
n, k = list(map(int, input().split()))
A = sorted(map(int, input().split()))
INF = 10**9+1
diff = INF
for x, y in zip(A, A[1:]):
z = abs(x-y)
if z > 0:
diff = min(diff, z)
MAX = A[-1]
ans = False
for a in A:
if a-k < 0:
continue
x, r = divmod((a-k), diff)
if r == 0:
... | n, k = list(map(int, input().split()))
A = sorted(map(int, input().split()))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
smallest_ball = A[0]
for a in A[1:]:
smallest_ball = gcd(smallest_ball, a)
print(("POSSIBLE" if (A[-1]-k) %
smallest_ball == 0 and k <= A[-1] e... | p03651 |
#! cat input | python3 main.py
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == 1:
if a[0] == k:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
__import__("sys").exit()
a.sort()
ma = max(a)
def isfact(n):
if n == 2: return True
for i in (... | a, b = list(map(int, input().split()))
array = list(map(int, input().split()))
impossible = "IMPOSSIBLE"
possible = "POSSIBLE"
array = list(set(array))
if len(array) == 1:
if b == array[0]:
print(possible)
else:
print(impossible)
exit(0)
array.sort()
btw = [v1 - v2 for v1... | p03651 |
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
ans = False
cnt = 0
prev_len = 0
prepre_len = 0
while(1):
if K in A:
ans = True
break
if cnt == 0:
for i in range(len(A)-1):
for j in range(i+1, len(A))... | N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
ans = False
A = sorted(A)
key = 99999999999999
if A[-1] < K:
ans = False
else:
for i in range(2, A[0]+1):
key_flag = True
for a in A:
if a % i !=0:
key_flag = ... | p03651 |
import sys
from collections import Counter as ct
def factoring(n):
root = int(n ** .5) + 1
arr = []
for i in range(2, root):
while(n % i == 0):
arr.append(i)
n //= i
if n > 1:
arr.append(n)
return ct(arr)
n, k = list(map(int, input().split()))
... | n, k = list(map(int, input().split()))
ar = list(sorted(map(int, input().split())))
def lcm(x, y):
return x if y == 0 else lcm(y, x % y)
l = ar[0]
for a in ar[1:]:
l = lcm(l, a)
ans = 'POSSIBLE' if k % l == 0 and k <= ar[-1] else 'IMPOSSIBLE'
print(ans)
| p03651 |
N,K = list(map(int,input().split()))
L = list(map(int,input().split()))
L = sorted(L,reverse=False)
ans = "IMPOSSIBLE"
if L[-1] < K :
ans = "IMPOSSIBLE"
elif (K in L) or (1 in L) :
ans = "POSSIBLE"
else :
for i in range(1,N) :
if L[i] % L[0] != 0 :
ans = "POSSIBLE"
... | def gcd(a,b) :
while b :
a,b = b, a % b
return a
N,K = list(map(int,input().split()))
L = list(map(int,input().split()))
if len(L) == 1 :
if L[0] == K :
ans = "POSSIBLE"
else :
ans = "IMPOSSIBLE"
else :
for i in range(N-1) :
q = gcd(L[i],L[i+1])
... | p03651 |
def gcd_(a, b):
if a < b: a, b = b, a
if b == 0: return a
return gcd_(b, a % b)
def gcd_bl(A):
left = [0 for _ in range(N + 1)]
right = [0 for _ in range(N + 1)]
ans = [0 for _ in range(N)]
left[1] = A[0]
for i in range(1, N): left[i + 1] = gcd_(left[i], A[i])
righ... | def gcd_(a, b):
if a < b: a, b = b, a
if b == 0: return a
return gcd_(b, a % b)
def gcd(l):
ans = l[0]
for i in l: ans = gcd_(ans, i)
return ans
def cin():
in_ = list(map(int,input().split()))
if len(in_) == 1: return in_[0]
else: return in_
def solve():
... | p03651 |
#!/usr/bin/env python3
import copy
N, K = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list = sorted(a_list)
def judge(w_list, k):
w_list = sorted(w_list)
for i in range(len(w_list) - 1):
w_list += [abs(w_list[i] - w_list[i + 1])]
w_list = sorted(li... | #!/usr/bin/env python3
import copy
N, K = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list = sorted(a_list)
def judge(w_list, k):
w_list = sorted(w_list)
for i in range(len(w_list) - 1):
w_list += [abs(w_list[i] - w_list[i + 1])]
w_list = sorted(li... | p03651 |
"""
KがAの最大公約数の倍数であれば実現可能。そうでなければ実現不可能。
"""
import sys
sys.setrecursionlimit(200000)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
def gcd(a,b):
return a if b==0 else gcd(b,a%b)
if N ==1:
g = A[0]
else:
g = gcd(A[0],A[1])
for i in range(2,N):
g = gcd(g,A[... | import sys
sys.setrecursionlimit(200000)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
def gcd(a,b):
return a if b==0 else gcd(b,a%b)
g = A[0]
for i in range(1,N):
g = gcd(g,A[i])
if K > max(A):
print("IMPOSSIBLE")
exit()
if K % g == 0:
print("POSSIBLE")
else:... | p03651 |
n = int(eval(input()))
alist = [int(s) for s in input().split(" ")]
import copy
a_ans = []
for i in range(n):
atmp = copy.copy(alist)
del atmp[i]
ans = atmp[0]
for a in atmp[1:]:
ans ^= a
a_ans.append(ans)
print((" ".join([str(a) for a in a_ans]))) | n = int(eval(input()))
alist = [int(s) for s in input().split(" ")]
asum = alist[0]
for a in alist[1:]:
asum ^= a
import copy
a_ans = []
for i in range(n):
asum ^= alist[i]
a_ans.append(asum)
asum ^= alist[i]
print((" ".join([str(a) for a in a_ans]))) | p02631 |
def combine(a, j):
# combine by xor all elements of a except a[j]
x = 0
n = len(a)
for i in range(n):
if i != j:
x ^= a[i]
return x
def main():
N = int(eval(input()))
a = [int(i) for i in input().split()]
print((' '.join(str(combine(a, j)) for j in rang... | def main():
N = int(eval(input()))
a = [int(i) for i in input().split()]
x = 0
for i in range(N):
x ^= a[i]
x ^= a[0]
xors = [x]
for i in range(1, N):
x ^= a[i-1]
x ^= a[i]
xors.append(x)
print((' '.join(str(x) for x in xors)))
main()
| p02631 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = [None]*n
for i in range(n):
buf = 0
for j in range(n):
if i != j:
buf = buf^a[j]
ans[i]=str(buf)
print((' '.join(ans))) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = [None]*n
all = 0
for i in range(n):
all = all^a[i]
for i in range(n):
ans[i]=str(all^a[i])
print((' '.join(ans))) | p02631 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = []
for i in range(n):
temp = 0
for j, aa in enumerate(a):
if j == i:
continue
temp = temp ^ aa
ans.append(temp)
ans = [str(i) for i in ans]
print((" ".join(ans)))
| n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = []
alld = 0
for aa in a:
alld = alld ^ aa
for aa in a:
ans.append(alld ^ aa)
ans = [str(i) for i in ans]
print((" ".join(ans)))
| p02631 |
N = int(eval(input()))
a = [int(s) for s in input().split()]
b = a[0]
c = str("")
for i in range(1,N):
b = b ^ a[i]
c = str(b ^ a[0])
for i in range(1, N):
c = c + " " + str(b ^ a[i])
print(c) | N = int(eval(input()))
a = [int(s) for s in input().split()]
b = a[0]
c = []
for i in range(1,N):
b = b ^ a[i]
for i in range(N):
c.append(str(b ^ a[i]))
d = ' '.join(c)
print(d) | p02631 |
import copy
N = int(eval(input()))
A = list(map(int,input().split()))
result = ['' for _ in range(N)]
for i in range(N//2):
if i < N -2:
s_1 = A[2*i+1]
s_2 = A[2*i]
for j in range(2*i+2, N):
s_1 = s_1 ^ A[j]
s_2 = s_2 ^ A[j]
result[2*i] = str(s_... | import copy
N = int(eval(input()))
A = list(map(int,input().split()))
result = ['' for _ in range(N)]
s = A[0]
for i in range(1,N):
s = s ^ A[i]
for i in range(N):
result[i] = str(s ^ A[i])
print((' '.join(result))) | p02631 |
N = int(eval(input()))
A = list(map(int, input().split()))
maxl = len(bin(max(A))[2:])
ans = [['0'] * N for _ in range(maxl)]
for n in range(N):
for d, a in enumerate(bin(A[n])[2:].zfill(maxl)):
ans[d][n] = a
for dn in range(maxl):
n1 = sum([1 for d in ans[dn] if d == '1'])
if n1 % 2 == 1... | N = int(eval(input()))
A = list(map(int, input().split()))
S = 0
for a in A:
S ^= a
print((" ".join([str(S ^ a) for a in A])))
| p02631 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
x = sum(a)
for i in range(n):
m = 0
for j in range(n):
if i == j:
pass
else:
m = m ^ a[j]
b.append(m)
b = list(map(str,b))
print((' '.join(b))) | import time
start = time.time()
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
m = 0
for i in range(1,n):
m = m ^ a[i]
b.append(m)
for j in range(1,n):
m = m ^ a[j-1]
m = m ^ a[j]
b.append(m)
b = list(map(str,b))
print((' '.join(b))) | p02631 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
pari = [0] * 40
for i in range(40):
for j in a:
pari[i] += (j&(1<<i))>>i
ans = a[:]
for i in range(40):
if pari[i]%2:
for j in range(n):
if a[j]&(1<<i):
ans[j] -= 1<<i
else:
... | n = int(eval(input()))
a = [int(i) for i in input().split()]
pari = [0] * 30
for i in range(30):
for j in a:
pari[i] += (j&(1<<i))>>i
ans = a[:]
for i in range(30):
if pari[i]%2:
for j in range(n):
if a[j]&(1<<i):
ans[j] -= 1<<i
else:
... | p02631 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
for j,a in enumerate(a_list):
if j != i:
ans[i]=ans[i]^a
ans = " ".join([str(i) for i in ans])
print(ans) | n = int(eval(input()))
a_list = list(map(int, input().split()))
base_xor = 0
for i in a_list:
base_xor = base_xor^i
ans = [0]*n
for i in range(n):
ans[i] = a_list[i]^base_xor
ans = " ".join([str(i) for i in ans])
print(ans) | p02631 |
n = int(eval(input()))
xor_arr = list(map(int, input().split()))
xor_of_xor = 0
for elm in xor_arr:
xor_of_xor = xor_of_xor ^ elm
scarf_val = [xor_of_xor ^ elm for elm in xor_arr]
print((" ".join(str(x) for x in scarf_val))) | n = int(eval(input()))
xor_arr = list(map(int, input().split()))
xor_of_xor = 0
for elm in xor_arr:
xor_of_xor = xor_of_xor ^ elm
scarf_val = [xor_of_xor ^ elm for elm in xor_arr]
print((" ".join(str(x) for x in scarf_val))) | p02631 |
N=int(eval(input()))
a=list(map(int,input().split()))
b=a[0]
for i in range(N-1):
b=b^a[i+1]
ans=""
for i in range(N):
if(i<N-1):
ans+=str(b^a[i])+" "
else:
ans+=str(b^a[i])
print(ans) | N=int(eval(input()))
a=list(map(int,input().split()))
b=a[0]
for i in range(N-1):
b=b^a[i+1]
x=[0 for i in range(N)]
for i in range(N):
x[i]=b^a[i]
x=list(map(str,x))
ans=' '.join(x)
print(ans) | p02631 |
n=int(eval(input()))
a=list(map(int,input().split()))
mx=len(bin(max(a)))
b=["0"*(mx-len(bin(x)))+bin(x)[2:] for x in a]
out=["" for _ in range(n)]
ref=[0 for _ in range(mx-2)]
for j in range(n):
work=b[j]
for i in range(mx-2):
ref[i]+=int(work[i])
ref[i]%=2
for j in range(n):
... | n=int(eval(input()))
a=list(map(int,input().split()))
mx=len(bin(max(a)))
b=["0"*(mx-len(bin(x)))+bin(x)[2:] for x in a]
out=["" for _ in range(n)]
for i in range(mx-2):
tot=0
for j in range(n):
tot+=int(b[j][i])
tot=tot%2
for j in range(n):
if tot==int(b[j][i]):out[j]+="0"
... | p02631 |
n = int(eval(input()))
A = list(map(int,input().split()))
ans = []
for i in range(n):
tmp = 0
for j in range(n):
if i==j:
continue
tmp=A[j]^tmp
ans.append(tmp)
print((' '.join(map(str,ans)))) | n = int(eval(input()))
A = list(map(int,input().split()))
xor_sum = 0
for i in range(n):
xor_sum = xor_sum^A[i]
ans = []
for i in range(n):
ans.append(xor_sum^A[i])
print((' '.join(map(str,ans))))
| p02631 |
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
l = len(format(max(a),'b'))
a = [format(a[i],'0{}b'.format(l)) for i in range(n)]
ans = [[] for i in range(n)]
for i in range(l):
s = 0
for j in range(n):
s+=int(a[j][i])
if s%2!=0... | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
b = a[0] ^ a[1]
for i in range(2,n):
b = b ^ a[i]
ans = []
for i in range(n):
ans.append(b ^ a[i])
ans = list(map(str,ans))
print((' '.join(ans)))
if __name__ == "__main__":
main()
| p02631 |
from functools import reduce
N = int(input().strip())
A = [int(x) for x in input().strip().split(" ")]
# def calc(A, i):
values = [
str(reduce(lambda x, y: x ^ y, [v[1] for v in [v for v in enumerate(A) if v[0] != i]]))
# calc(A, i)
for i in range(len(A))
]
print((" ".join(values))) | from functools import reduce
N = int(input().strip())
A = [int(x) for x in input().strip().split(" ")]
xor = reduce(lambda x, y: x ^ y, A)
print((" ".join([
str(xor ^ a)
for a in A
]))) | p02631 |
n = int(eval(input()))
a = list(map(int , input().split()))
b = []
for ai in a:
b.append('{:0=30b}'.format(ai))
cnt = []
for j in range(30):
tmp = 0
for i in range(n):
tmp += int(b[i][j])
cnt.append(tmp)
ans = []
for bi in b:
tmp = 0
for i in range(30):
idx = 29 ... | n = int(eval(input()))
a = list(map(int , input().split()))
b = []
s = 0
for ai in a:
s ^= ai
ans = []
for ai in a:
ans.append(s ^ ai)
print((' '.join(map(str, ans))))
| p02631 |
# -*- coding: utf-8 -*-
def cal_xor(xor_list, rm_ind):
ans = None
for i, xi in enumerate(xor_list):
if i!=rm_ind:
if ans is not None:
ans = ans^xi
else:
ans = xi
return ans
N, = list(map(int, input().split()))
a = list(map(int,... | # -*- coding: utf-8 -*-
def cal_xor(xor_list):
ans = None
for xi in xor_list:
if ans is not None:
ans = ans^xi
else:
ans = xi
return ans
N, = list(map(int, input().split()))
a = list(map(int, input().split()))
ans_str = ''
if N==2:
print(("{... | p02631 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = [0] * N
bit = 0
for i in range(1, N):
ans[i] = a[i - 1] ^ a[i] ^ ans[i - 1]
bit ^= ans[i]
if bit == a[0]:
print((' '.join(map(str, ans))))
else:
index = 0
for i in range(1, 10 ** 9 + 1):
bit = bit ^ (i - 1) ^ i
... | N = int(eval(input()))
a = list(map(int, input().split()))
S = 0
for i in range(N):
S ^= a[i]
ans = [0] * N
for i in range(N):
ans[i] = S ^ a[i]
print((' '.join(map(str, ans))))
| p02631 |
from collections import deque
def calcXor(nums):
x=0
for n in nums:
x=x^n
return x
N=int(eval(input()))
A=list(map(int,input().split()))
ans=deque()
for i in range(N):
#print(A[0:i])
x=calcXor(A[0:i])
#print(A[i+1:N])
y=calcXor(A[i+1:N])
ans.append(x^y)
print((" ".join(map(str,ans))... | from collections import deque
def calcXor(nums):
x=0
for n in nums:
x=x^n
return x
N=int(eval(input()))
A=list(map(int,input().split()))
A_xor=calcXor(A)
ans=deque()
for a in A:
ans.append(A_xor^a)
#for i in range(N):
#print(A[0:i])
#x=calcXor(A[0:i])
#print(A[i+1:N])
#y=cal... | p02631 |
def mi(): return list(map(int,input().split()))
def lmi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
n=ii()
a=lmi()
S=0
for i in a:
S=S^i
b=[]
for i in a:
a_=S^i
b.append(a_)
print((' '.join(map(str,b)))) | n=int(eval(input()))
a=list(map(int,input().split()))
s=0
for i in a:
s^=i
t=[]
for i in a:
t_=i^s
t.append(t_)
print((' '.join(map(str,t))))
| p02631 |
n = int(eval(input()))
a = input().split()
l = [0] * 30
for i in range(n):
a[i] = format(int(a[i]), "030b")
for j in range(30):
l[j] += int(str(a[i])[j])
for i in range(30):
l[i] = l[i] % 2
b = ""
for i in range(30):
b += str(l[i])
b = int(b, 2)
for i in range(n):
a[i] = b ^ int(a[i], 2)
print((" ... | n = int(eval(input()))
a = input().split()
l = 0
for i in range(n):
a[i] = int(a[i])
l = l ^ a[i]
for i in range(n):
a[i] = l ^ a[i]
print((" ".join(map(str, a)))) | p02631 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | p02631 |
n=int(input())
A=list(map(int,input().split()))
L = []
x=0
for a in A:
x ^= a
L.append(x)
R = []
x=0
for a in reversed(A):
x ^= a
R.insert(0, x)
for i in range(n):
x = 0
if i>0:
x^=L[i-1]
if i<n-1:
x^=R[i+1]
print(x, end="")
if i==n-1:
prin... | n=int(input())
A=list(map(int,input().split()))
L = []
x=0
for a in A:
x ^= a
L.append(x)
R = []
x=0
for a in reversed(A):
x ^= a
R.append(x)
for i in range(n):
x = 0
if i>0:
x^=L[i-1]
if i<n-1:
x^=R[n-1-(i+1)]
print(x, end="")
if i==n-1:
p... | p02631 |
n = int(input())
a = list(map(int, input().strip().split()))
m = len(bin(max(a))[2:])
t = [0] * (m)
for i in range(n):
bin_str_i = [int(s) for s in list(bin(a[i])[2:])]
l = len(bin_str_i)
for j in range(l):
t[m - j - 1] += bin_str_i[l - j - 1]
x = ''
for j in range(m):
if t[j] % 2... | n = int(input())
a = list(map(int, input().strip().split()))
x = 0
for i in range(n):
x = x ^ a[i]
#print(bin(c))
#x = int(x, 2)
for i in range(n):
ans = a[i] ^ x
if i < n - 1:
print(ans,end=' ')
else:
print(ans)
| p02631 |
N = int(eval(input()))
a = list(map(int, input().split()))
m = max(a)
count = 0
nishin = []
while True:
m, r = divmod(m, 2)
count += 1
if m == 0:
break
for i in range(0, N):
for j in range(0, count):
a[i], r = divmod(a[i], 2)
nishin.append(str(r))
a[i] = ''.... | N = int(eval(input()))
a = list(map(int, input().split()))
x = 0
for i in range(0, N):
x ^= a[i]
ans = []
for i in range(0, N):
ans.append(str(x ^ a[i]))
print((' '.join(ans)))
| p02631 |
n=int(eval(input()))
A=list(map(int,input().split()))
ans=[]
for i in range(n):
l=A[:i]+A[i+1:]
sum=0
for a in l:
sum=sum^a
ans.append(sum)
ans=' '.join(map(str,ans))
print(ans) | n=int(eval(input()))
A=list(map(int,input().split()))
ans=[]
sum=0
for a in A:
sum=sum^a
for a in A:
ans.append(sum^a)
ans=' '.join(map(str,ans))
print(ans) | p02631 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2104
TLE
"""
import sys
from sys import stdin
input = stdin.readline
def main(args):
t = int(eval(input()))
for _ in range(t):
n, k = list(map(int, input().split()))
houses = [int(x) for x in inp... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2104
"""
import sys
from sys import stdin
from bisect import bisect_left
input = stdin.readline
def main(args):
t = int(eval(input()))
for _ in range(t):
n, k = list(map(int, input().split()))
... | p01227 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2104
"""
import sys
from sys import stdin
from bisect import bisect_left
input = stdin.readline
def main(args):
t = int(eval(input()))
for _ in range(t):
n, k = list(map(int, input().split()))
... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2104
AC
"""
import sys
from sys import stdin
input = stdin.readline
def main(args):
t = int(eval(input()))
for _ in range(t):
n, k = list(map(int, input().split()))
houses = [int(x) for x in inpu... | p01227 |
from operator import itemgetter
import heapq
def prim_heap():
used=[True]*n
edgelist=[]
for e in edge[0]:
heapq.heappush(edgelist,e)
used[0] = False
res = 0
while len(edgelist) != 0:
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:
continue
v = minedge[1]
us... | from operator import itemgetter
import heapq
def prim_heap():
used=[True]*n
edgelist=[]
for e in edge[0]:
heapq.heappush(edgelist,e)
used[0] = False
res = 0
while len(edgelist) != 0:
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:
continue
v = minedge[1]
us... | p03682 |
import sys
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
import decimal
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(sel... | import sys
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
import decimal
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(sel... | p03682 |
import sys
sys.setrecursionlimit(10**7)
from collections import defaultdict
import collections
import itertools
import operator
class UnionFind:
def __init__(self, elems=None):
class KeyDict(dict):
def __missing__(self, key):
self[key] = key
retur... | import sys
sys.setrecursionlimit(10**7)
from collections import defaultdict
def init(n):
return list(range(n+1))
def find(lis, x):
if lis[x] == x:
return x
else:
lis[x] = find(lis, lis[x])
return lis[x]
def sameset(lis, x, y):
return find(lis, x) == find(lis, y)... | p03682 |
n = int(eval(input()))
x = []
y = []
for i in range(n):
s = list(map(int, input().split()))
x.append([s[0], i])
y.append([s[1], i])
x.sort()
y.sort()
xdiff = []
ydiff = []
for i in range(1, n):
xdiff.append([x[i][0] - x[i - 1][0], x[i - 1][1], x[i][1]])
ydiff.append([y[i][0] - y[i -... | import sys
sys.setrecursionlimit(100000)
n = int(eval(input()))
x = []
y = []
for i in range(n):
s = list(map(int, input().split()))
x.append([s[0], i])
y.append([s[1], i])
x.sort()
y.sort()
xdiff = []
ydiff = []
for i in range(1, n):
xdiff.append([x[i][0] - x[i - 1][0], x[i - 1][1], x... | p03682 |
class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | p03682 |
class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | p03682 |
class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | class unionfind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(s... | p03682 |
import heapq
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.p... | p03682 |
with open(0) as f:
N, *xy = list(map(int, f.read().split()))
from collections import namedtuple
v = namedtuple('v',['x','y'])
V = [v(x-1,y-1) for x,y in zip(xy[::2],xy[1::2])] #頂点
cost = lambda i,j:min(abs(V[i].x-V[j].x), abs(V[i].y-V[j].y))
from itertools import combinations
Edge = sorted([(cost(i,j), i, j... | with open(0) as f:
N, *xy = list(map(int, f.read().split()))
from collections import namedtuple
v = namedtuple('v',['coordinate','num'])
#最小全域木に使われる辺は高々座標(xまたはy)が隣接する頂点間のものである
#したがって、x座標・y座標それぞれでソートして辺を求める
X = sorted([v(x,i) for x,i in zip(xy[::2], list(range(N)))])
Y = sorted([v(y,i) for y,i in zip(xy[1::... | p03682 |
N = int(eval(input()))
P = [[i, list(map(int, input().split()))] for i in range(N)]
X = sorted([[i, xy[0]] for i, xy in P], key=lambda x: x[1])
Y = sorted([[i, xy[1]] for i, xy in P], key=lambda y: y[1])
Xe = [[X[i][0], X[i+1][0], abs(X[i][1]-X[i+1][1])] for i in range(N-1)]
Ye = [[Y[i][0], Y[i+1][0], abs(Y[i]... | N = int(eval(input()))
Points = [[i] + list(map(int, input().split())) for i in range(N)]
# x, yそれぞれについてソートして、一番近いところを見れば十分
Edges = []
Points.sort(key=lambda p: p[1])
for i in range(N - 1):
n1, x1, y1 = Points[i]
n2, x2, y2 = Points[i + 1]
Edges.append([n1, n2, x2 - x1])
Points.sort(key=lambda ... | p03682 |
N = int(eval(input()))
Points = [[i] + list(map(int, input().split())) for i in range(N)]
# x, yそれぞれについてソートして、一番近いところを見れば十分
Edges = []
Points.sort(key=lambda p: p[1])
for i in range(N - 1):
n1, x1, y1 = Points[i]
n2, x2, y2 = Points[i + 1]
Edges.append([n1, n2, x2 - x1])
Points.sort(key=lambda ... | N = int(eval(input()))
Towns = [[i] + list(map(int, input().split())) for i in range(N)]
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0] * n
self.size = [1] * n
# 検索
def find(self, x):
if self.par[x] == x:
r... | p03682 |
from heapq import heappush, heappop
class UnionFind():
def __init__(self, n):
self.parents = list(range(n))
def find(self, x):
if self.parents[x] == x:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
... | from heapq import heappop, heappush
class UnionFind():
def __init__(self, n):
self.parents = list(range(n))
self.size = [1] * n
def find(self, x):
if self.parents[x] == x:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | p03682 |
import heapq
N = int(eval(input()))
place = []
d = {}
j = 0
for i in range(N):
x, y = list(map(int, input().split()))
place.append((x,y))
if not (x,y) in d:
d[(x,y)] = j
j += 1
N = j
sort_x = sorted(place)
sort_y = sorted(place, key = lambda k:k[1])
edge=[[] for i in rang... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03682 |
#16:15
n = int(eval(input()))
xyi = []
for i in range(n):
xyi.append(list(map(int,input().split())) + [i])
xyi.sort()
road = []
for j in range(n-1):
road.append([xyi[j+1][0]-xyi[j][0],xyi[j][2],xyi[j+1][2]])
xyi.sort(key = lambda x: x[1])
for j in range(n-1):
road.append([xyi[j+1][1]-xyi[j][1],xyi[j][2... | #16:15
n = int(eval(input()))
xyi = []
for i in range(n):
xyi.append(list(map(int,input().split())) + [i])
xyi.sort()
road = []
for j in range(n-1):
road.append([xyi[j+1][0]-xyi[j][0],xyi[j][2],xyi[j+1][2]])
xyi.sort(key = lambda x: x[1])
for j in range(n-1):
road.append([xyi[j+1][1]-xyi[j][1],xyi[j][2... | p03682 |
import heapq
from collections import defaultdict
N=int(eval(input()))
X=[]
Y=[]
dic_x=defaultdict(list)
dic_y=defaultdict(list)
for i in range(N):
x,y=list(map(int,input().split()))
dic_x[x].append(i)
dic_y[y].append(i)
X.append(x)
Y.append(y)
X=sorted(X)
Y=sorted(Y)
V=N
E=(V-1)*2
G=[]
for i... | import heapq
from collections import defaultdict
N=int(eval(input()))
X=[]
Y=[]
dic_x=defaultdict(list)
dic_y=defaultdict(list)
for i in range(N):
x,y=list(map(int,input().split()))
dic_x[x].append(i)
dic_y[y].append(i)
X.append(x)
Y.append(y)
X=sorted(X)
Y=sorted(Y)
V=N
E=(V-1)*2
G=[]
for i... | p03682 |
def main():
import heapq
class Prim():
# 無向グラフであるという前提に注意
def __init__(self, N):
self.edge = [[] for i in range(N)]
self.N = N
def add(self, u, v, d):
"""
u = from, v = to, d = cost
0-indexedであることに注意、graph.add(u-1,... | class Kruskal():
def __init__(self,n):
self.e = []
self.par = [i for i in range(n+1)] #親のノード番号
self.rank = [0]*(n+1)
def add(self,u,v,d): #クラスカル法で考えるのは無向グラフ
self.e.append([u,v,d])
def find(self,x): #xの根のノード番号
if self.par[x] == x:
return x
... | p03682 |
import heapq
n=int(eval(input()))
x=[]
y=[]
for i in range(n):
xx,yy=list(map(int,input().split()))
x.append([xx,i])
y.append([yy,i])
x.sort()
y.sort()
px=[]
py=[]
for i in range(n-1):
px.append([x[i+1][0]-x[i][0],x[i][1],x[i+1][1]])
py.append([y[i+1][0]-y[i][0],y[i][1],y[i+1][1]])
p=px+py
x=[... | n=int(eval(input()))
x=[]
y=[]
for i in range(n):
xx,yy=list(map(int,input().split()))
x.append([xx,i])
y.append([yy,i])
x.sort()
y.sort()
px=[]
py=[]
for i in range(n-1):
px.append([x[i+1][0]-x[i][0],x[i][1],x[i+1][1]])
py.append([y[i+1][0]-y[i][0],y[i][1],y[i+1][1]])
p=px+py
x=[]
y=[]
px=[]... | p03682 |
n=int(eval(input()))
x=[]
y=[]
for i in range(n):
xx,yy=list(map(int,input().split()))
x.append([xx,i])
y.append([yy,i])
x.sort()
y.sort()
px=[]
py=[]
for i in range(n-1):
px.append([x[i+1][0]-x[i][0],x[i][1],x[i+1][1]])
py.append([y[i+1][0]-y[i][0],y[i][1],y[i+1][1]])
p=px+py
x=[]
y=[]
px=[]... | n=int(eval(input()))
x=[]
y=[]
for i in range(n):
xx,yy=list(map(int,input().split()))
x.append([xx,i])
y.append([yy,i])
x.sort()
y.sort()
px=[[x1-x0,i0,i1] for (x0,i0),(x1,i1) in zip(x,x[1:])]
py=[[y1-y0,i0,i1] for (y0,i0),(y1,i1) in zip(y,y[1:])]
p=px+py
x=[]
y=[]
px=[]
py=[]
p.sort()
r=[i for ... | p03682 |
from operator import itemgetter
from collections import defaultdict
class UnionFindTree():
def __init__(self):
self.__parent_of = defaultdict(lambda: None)
self.__rank_of = defaultdict(lambda: 0)
self.__size = defaultdict(lambda: 1)
def __root(self, value):
if self.... | from operator import itemgetter
class UnionFindTree():
def __init__(self, N):
self.__parent_of = [None] * N
self.__rank_of = [0] * N
self.__size = [1] * N
def __root(self, value):
if self.__parent_of[value] is None:
return value
else:
... | p03682 |
import operator
import sys
# sys.stdin = open('d1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
return eval(input())
p = []
rank = []
def make_s... | import sys
# sys.stdin = open('d1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
return eval(input())
p = []
rank = []
def make_set(x):
p[x] ... | p03682 |
N = int(eval(input()))
z = [tuple(map(int,input().split())) for i in range(N)]
z.sort()
y = [(z[i][1],i) for i in range(N)]
y.sort()
cost = [[] for i in range(N)]
for i in range(N-1):
j = y[i][1]
cost[i].append((i-1,min(abs(z[i][0]-z[i-1][0]),abs(z[i][1]-z[i-1][1]))))
j_ = y[i-1][1]
cost[j].ap... | N = int(eval(input()))
z = [tuple(map(int,input().split())) for i in range(N)]
z.sort()
y = [(z[i][1],i) for i in range(N)]
y.sort()
cost = [[] for i in range(N)]
for i in range(N-1):
j = y[i][1]
cost[i].append((i-1,min(abs(z[i][0]-z[i-1][0]),abs(z[i][1]-z[i-1][1]))))
j_ = y[i-1][1]
cost[j].ap... | p03682 |
N=int(eval(input()))
city=[]
for i in range(N):
x,y=list(map(int,input().split()))
city.append((i,x,y))
city.sort(key=lambda x:x[1])
data=[]
for i in range(N-1):
data.append((city[i][0],city[i+1][0],city[i+1][1]-city[i][1]))
city.sort(key=lambda y:y[2])
for i in range(N-1):
data.append((city[... | N=int(eval(input()))
city=[0]*N
for i in range(N):
x,y=list(map(int,input().split()))
city[i]=(i,x,y)
city.sort(key=lambda x:x[1])
data=[(city[i][0],city[i+1][0],city[i+1][1]-city[i][1]) for i in range(N-1)]
city.sort(key=lambda x:x[2])
data+=[(city[i][0],city[i+1][0],city[i+1][2]-city[i][2]) for i in r... | p03682 |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
import heapq
n = int(eval(input()))
l = [[0, 0] for i in range(n)]
for i in range(n):
x, y = list(map(int, input().split()))
l[i][0] = x
l[i][1] = y
graph = []
for i in range(n-1):
x1, y1 = l[i]
for j in range(i, n):
x2... | import sys
input = sys.stdin.buffer.readline
n = int(eval(input()))
P = []
for i in range(n):
x, y = list(map(int, input().split()))
P.append((x, y, i))
import heapq
def prim_heap():
used = [True]*n
edgelist = []
for e in edge[0]:
heapq.heappush(edgelist, e)
used[0] ... | p03682 |
class UnionFind:
# 初期化
def __init__(self, n):
# 根なら-size, 子なら親の頂点
self.par = [-1] * n
# 木の高さ
self.rank = [0] * n
# 検索
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
... | class UnionFind:
# 初期化
def __init__(self, n):
# 根なら-size, 子なら親の頂点
self.par = [-1] * n
# 木の高さ
self.rank = [0] * n
# 検索
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
... | p03682 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.