input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
tmp1 = abs(N - K)
while True:
if K == 1:
print((0))
break
tmp2 = abs(tmp1 - K)
if tmp1 < tmp2:
print(tmp1)
break
else:
tmp1 = tmp2
| N, K = list(map(int, input().split()))
print((min(N % K, K - (N % K))))
| p02719 |
n,k = input().split(" ")
n = int(n)
k = int(k)
min = 1000000000000000001
abs0 = 0
if n == 0:
print((0))
elif k == 1:
print((0))
elif n == 1:
print((1))
else:
for i in range(1000000000):
abs0 = abs(k - n)
n = abs0
if abs0 < min:
min = abs0
elif... | n,k = input().split(" ")
n = int(n)
k = int(k)
min = 1000000000000000001
abs0 = 0
if n == 0:
print((0))
elif k == 1:
print((0))
elif n == 1:
print((1))
else:
if n > k:
n = n % k
print((abs(k-n)))
else:
for i in range(1000000000):
abs0 = ab... | p02719 |
import sys
n,k=list(map(int,input().split()))
if n==0 or n%k==0:
print((0))
sys.exit()
tmp=abs(n-k)
while tmp<n:
n=tmp
tmp=abs(n-k)
print(n) | import sys
n,k=list(map(int,input().split()))
if n==0 or n%k==0:
print((0))
sys.exit()
n=n%k
tmp=abs(n-k)
while tmp<n:
n=tmp
tmp=abs(n-k)
print(n) | p02719 |
N, K = list(map(int, input().split()))
if K == 1:
print((0))
elif N == K:
print((0))
elif N == 0:
print((0))
elif N % 2 == 0 and K % 2 == 0 and N > K and K % N == 0:
print((0))
elif N % 2 == 0 and K % 2 == 0 and N > K and K % N != 0:
if abs(N - K) > N:
print(N)
else:
... | N, K = list(map(int, input().split()))
print((min(N % K, abs(K - N % K)))) | p02719 |
import fractions
import sys
N,K = list(map(int,input().split()))
L = []
L.append(N)
i = 0
if N == K:
print((0))
sys.exit(0)
if N == 0:
print((0))
sys.exit(0)
if K == 1:
print((0))
sys.exit(0)
Q = 0
N-=((N//K)*K)
while True:
L.append(abs(N-K))
N = abs(N-K)
i += 1
if i... | N,K = list(map(int,input().split()))
#N-K -> -K -> -K... gives N%K
#-> (N%K - K) -> (N%K)
answ = N%K
print((min(abs(answ),abs(answ-K))))
| p02719 |
N,K=input().split()
N=int(N)
K=int(K)
list=[]
if N%K==0:
print((0))
else:
while N not in list:
list.append(N)
N=abs(N-K)
print((min(list)))
| N,K=input().split()
N=int(N)
K=int(K)
print((min(N%K,K-N%K)))
| p02719 |
n,k = list(map(int,input().split()))
answer = 0
if k == 1:
answer = 0
elif k >= n:
gap = k-n
if gap > n:
answer = n
else:
answer = gap
else:
while n > k:
n = n - k
if k >= n:
gap = k-n
if gap > n:
answer = n
else:
answer = gap
print(answer) | n,k = list(map(int,input().split()))
answer = 0
if k >= n:
gap = k-n
if gap > n:
answer = n
else:
answer = gap
else:
sho = n // k
if n % k == 0:
dec = sho - 1
else:
dec = sho
n = n - k*dec
if k >= n:
gap = k-n
if gap > n:
answer = n
else:
answe... | p02719 |
n,k = list(map(int,input().split()))
if n>=k:
t = n%k
else:
t = n
print((t if t <= k-t else k-t))
| #x>Kの時、x => x-k =>x-2k => x-3k ... : xをkで割った余りになる
#x<Kの時、x => k-x => x : max(x,k-x)
n,k = list(map(int,input().split()))
if n >= k:
n = n%k
print((n if n%k <= k-n else k-n)) | p02719 |
N, K = list(map(int, input().split()))
Nj = N
while True:
Ni = Nj
Nj = abs(Ni - K)
if Ni > N:
print(N)
break
elif Nj > Ni:
print(Ni)
break
elif K == 1 or Nj == K:
print((0))
break
else:
continue
| n, k = list(map(int, input().split()))
if n % k == 0:
print((0))
else:
l = [n]
p = n // k
c = n - (p * k)
half = k // 2
while c > half:
c = abs(c - k)
l.append(c)
print((min(l)))
| p02719 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.s... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.std... | p02719 |
n,k=list(map(int,input().split()))
n%=k
N=abs(n-k)
while N<n:
n=N
N=abs(n-k)
print(n)
| n,k=list(map(int,input().split()))
n%=k
N=abs(n-k)
if N<n:
n=N
print(n)
| p02719 |
import sys
sys.setrecursionlimit(1000000000)
n, k = list(map(int, input().split()))
if k == 1:
print((0))
elif n < k / 2:
print(n)
else:
while n >= k / 2:
n = abs(k - n)
print(n)
| n, k = list(map(int, input().split()))
if k > n:
tmp = n
else:
tmp = n % k
if tmp > k / 2:
tmp = k - tmp
print(tmp)
| p02719 |
n, k = list(map(int, input().split()))
L = []
if n > k:
n = n - k*(n//k)
for i in range(k+1):
L.append(abs(n-k))
n = abs(n-k)
print((min(L))) | n, k = list(map(int, input().split()))
L = []
if n > k:
n = n - k*(n//k)
if n*2 <= k:
print(n)
else:
print((k-n)) | p02719 |
n,k=list(map(int,input().split()))
if n%k==0:
print((0))
exit()
while abs(n-k)<n:
n=abs(n-k)
print(n) | n,k=list(map(int,input().split()))
print((min(n%k,abs(n%k-k)))) | p02719 |
if __name__ == '__main__':
n, k = [int(i) for i in input().split(" ")]
while abs(n - k) <= n:
if n%(k*10)==0:
n = int(n/(k*10))
else:
n = abs(n - k)
print(n) | if __name__ == '__main__':
n, k = [int(i) for i in input().split(" ")]
while abs(n - k) < n and n != 0:
n = n%k
if n != 0:
n = abs(n - k)
print(n)
| p02719 |
n = list(map(int, input().split()))
re = True
num = n[0]
if n[1] == 1:
print((0))
elif n[1] == 2:
if n[0]%2 == 0:
print((0))
else:
print((1))
else:
while re:
k = num - n[1]
if num > abs(k):
num = abs(k)
else:
re = False
print(num) | n = list(map(int, input().split()))
k = n[0] % n[1]
if abs(k - n[1]) > k:
print(k)
else:
print((abs(k - n[1]))) | p02719 |
n, k = list(map(int, input().split()))
ans = abs(n - k)
i = False
if n % k == 0:
ans = 0
i = True
while not i:
if ans > abs(ans - k):
ans = abs(ans - k)
else:
i = True
print(ans) | n, k = list(map(int, input().split()))
ans = n % k
i = False
if ans == 0:
i = True
while not i:
if ans > abs(ans - k):
ans = abs(ans - k)
else:
i = True
print(ans) | p02719 |
def replaceInt(N, M):
N = abs(N-M)
return N
N, M = [int(i) for i in input().split()]
if N == M :
output = 0
elif N < M :
if N <= M / 2:
output = N
else:
output = abs(M-N)
else :
if M == 1:
output = 0
else :
output_candidates = [N]
... | def replaceInt(N, M):
N = abs(N-M)
return N
N, M = [int(i) for i in input().split()]
if N == M :
output = 0
elif N < M :
if N <= M / 2:
output = N
else:
output = abs(M-N)
else :
if M == 1:
output = 0
else :
N = N % M
output_cand... | p02719 |
NK = input().split();
N,K = int(NK[0]),int(NK[1]);
min = N;
#桁が大きい時の処理
if(K == 1):
while(int(len(str(N))) > 2):
N = int(N - K * (N / 2));
# else:
# while(int(len(str(N))) > 2):
# N = int(N / K);
flag = True;
while flag == True:
N = abs(N - K);
if(N <= min):
... | import math
NK = input().split();
N,K = int(NK[0]),int(NK[1]);
min = N;
#桁が大きい時の処理
if(K == 1):
while(int(len(str(N))) > 2):
N = int(N - K * (N / 2));
else:
border = math.floor(N / K);
N = N - K * border;
flag = True;
while flag == True:
N = abs(N - K);
if(N <= min... | p02719 |
n,k = list(map(int, input().split()))
t = n // k
n -= t*k
print((min(abs(n-k), n))) | n, k = list(map(int, input().split()))
l = n // k
print((min(n - l * k, abs((n - l * k) - k)))) | p02719 |
def solve(n, k):
occurence = set()
diff = n % k
if diff == 0:
print(diff)
return
else:
while n not in occurence:
if k == 1:
print((0))
return
occurence.add(n)
n = abs(n - k)
if... | def solve(n, k):
occurence = set()
diff = n % k
n = diff
if diff == 0 or diff == 1:
print(diff)
return
else:
while n not in occurence:
if k == 1:
print((0))
return
occurence.add(n)
n ... | p02719 |
N, K = list(map(int, input().split()))
if K == 1:
res = 0
elif K == 2:
res = K % 2
else:
diff = abs(N-K)
while diff < N:
N = diff
diff = abs(N-K)
res = N
print(res)
| N, K = list(map(int, input().split()))
rem = N %K
print((min(rem, abs(rem - K))))
| p02719 |
n,k=list(map(int,input().split()))
if n>k:
n=n%k
print((min(n,k-n))) | n,k=list(map(int,input().split()))
n=n%k
print((min(n,k-n))) | p02719 |
N, K = list(map(int,input().split()))
if K == 1 or N == 0 or N == K:
print((0))
exit()
elif K == 0:
print(N)
exit()
elif N == 1 or N == K-1 or K == N-1:
print((1))
exit()
else:
res = []
ans = N
for i in range(max(N,K)):
ans = abs(ans - K)
res.append(ans... | N, K = list(map(int,input().split()))
if K == 1 or N == 0 or N == K or N%K==0:
print((0))
elif K == 0:
print(N)
elif N == 1 or N == K-1 or K == N-1 or N%K==1:
print((1))
elif N > K:
res = abs(N - (K*(N//K)))
if abs(res - K) < res:
print((abs(res-K)))
else:
print(res)
... | p02719 |
n, k = list(map(int, input().split()))
loop = True
while loop:
if n > abs(n - k):
if n > k:
n = min(n, n % k)
elif k > n:
n = min(n, k % n)
else:
loop = False
print(n)
| n, k = list(map(int, input().split()))
if n == k:
n = 0
else:
while n > abs(n - k):
if n > k:
n = min(n, n % k)
elif k > n:
n = min(n, k % n)
print(n)
| p02719 |
li = list(map(int, input().split()))
new_li = []
n = 0
while True:
if li[1] == 1:
print((0))
break
li[0] = abs(li[0]-li[1])
new_li.append(li[0])
if n>=2:
if new_li[n] == new_li[n-2]:
print((min(new_li)))
break
n += 1 | N, K = list(map(int, input().split()))
if N%K == 0:
print("0")
elif abs(N%K - K) < N:
print((abs(N%K - K)))
else:
print(N) | p02719 |
N,K = list(map(int,input().split()))
if K == 1 or N%K == 0:
print((0))
exit()
S = set()
S.add(N)
for x in range(N):
c = abs(N-K)
if N == c:
break
N = abs(N-K)
S.add(N)
print((min(S))) | N,K = list(map(int,input().split()))
T = N%K
L = [T,abs(T-K)]
print((min(L))) | p02719 |
import sys
N, K = list(map(int, input().split()))
first = N
list_a = []
if N % K == 0:
print((0))
sys.exit()
else:
while N > 0:
N = N - K
second = N + K
N = abs(N)
list_a.append(N)
list_a.append(second)
list_a.append(first)
list_a = sorted(list_a)
print((list_a[0]))
| import sys
N, K = list(map(int, input().split()))
first = N
list_a = []
if N % K == 0:
print((0))
sys.exit()
else:
X = N // K
N = N - (K * (X+1))
second = N + K
N = abs(N)
list_a.append(N)
list_a.append(second)
list_a.append(first)
list_a = sorted(list_a)
print((list_a[0]))
| p02719 |
N,K=list(map(int,input().split()))
if N % K ==0:
print((0))
exit()
ans = N
for i in range((N//K)+1):
N = abs(N-K)
ans =min(ans,N)
print(ans) | N,K=list(map(int,input().split()))
if N % K ==0:
print((0))
exit()
if N < K:
print((min(N,K-N)))
exit()
if N > K:
print((min(N%K,K-(N%K)))) | p02719 |
n, k = list(map(int,input().split()))
if k == 1:
print((0))
exit()
while n >= abs(n-k):
n = abs(n-k)
print(n) | n, k = list(map(int,input().split()))
print((min(n%k, k - n%k))) | p02719 |
N, K = [int(n) for n in input().split()]
def cmp(a, b):
if a > b:
return a%b
return abs(a-b)
while True:
ans = cmp(N, K)
if 0 <= ans <=2:
break
N = ans
print(ans)
| N, K = [int(n) for n in input().split()]
print((min(N%K, K-(N%K)))) | p02719 |
n, k = list(map(int, input().split()))
t = n // k
re = n - t * k
i = True
while i == True:
if abs(re - k) < re:
re = abs(re - k)
i = True
else:
i = False
print(re)
| n, k = list(map(int, input().split()))
t = n // k
re = n - t * k
if abs(re - k) < re:
re = abs(re - k)
i = True
print(re)
| p02719 |
N,K = list(map(int, input().split()))
if N % K == 0:
print((0))
elif N > K:
while N > 0:
hako1 = N
N -= K
hako2 = abs(N)
if hako1 > hako2:
print(hako2)
else:
print(hako1)
else:
if N >= abs(N-K):
print((abs(N-K)))
else:
print(N) | N,K = list(map(int, input().split()))
if N % K == 0:
print((0))
elif N > K:
hako1 = N%K
hako2 = abs(hako1-K)
if hako1 > hako2:
print(hako2)
else:
print(hako1)
else:
if N >= abs(N-K):
print((abs(N-K)))
else:
print(N) | p02719 |
N, K = [int(x) for x in input().split(" ")]
if N ==0 or K==1:
print((0))
else:
while N>abs(N-K):
N = abs(N%K-K)
print(N)
| N, K = [int(x) for x in input().split(" ")]
if N ==0 or K==1 or N == K:
print((0))
else:
while N>abs(N-K):
N = abs(N%K-K)
print(N)
| p02719 |
a,b = list(map(int, input().split()))
if b == 1:
print((0))
exit()
while True:
x = abs(a-b)
if x < a:
a = x
else:
print(a)
break | a,b = list(map(int, input().split()))
if a > b:
if a % b == 0:
print((0))
exit()
else:
print((min(a%b, b-(a%b))))
exit()
while True:
x = abs(a-b)
if x < a:
a = x
else:
print(a)
break | p02719 |
n,k = list(map(int,input().split()))
N = n
if n % k == 0:
print((0))
else:
while n > 0:
n -= k
if abs(n) > N:
print(N)
else:
print((abs(n)))
| n,k = list(map(int,input().split()))
a = n % k
print((min(abs(a-k),a))) | p02719 |
n, k = list(map(int, input().split()))
if n==k or k==1:
print((0))
else:
ans=n
res=[ans]
while(1):
ans=abs(ans-k)
if ans in res or ans == k:
break
res.append(ans)
print((min(res))) | n, k = list(map(int, input().split()))
print((min(n%k, k - n%k))) | p02719 |
N , K = input().split()
N = int(N)
K = int(K)
print((min(N % K , K - N % K))) | n, k = list(map(int,input().split()))
m = n %k
print((min(m, abs(m-k)))) | p02719 |
#
N, K = list(map(int,input().split()))
N %= K
min = N
for i in range(10**6):
N = abs(N-K)
if min > N:
min = N
if N == 0:
min = 0
break
print(min) | #input
N, K = list(map(int,input().split()))
#main
t = N % K
ans = min(t, K - t)
#output
print(ans) | p02719 |
n,k = list(map(int,input().split()))
if n%k==0:
print((0))
else:
while(n > abs(n-k)):
if k == 1:
n=0
break
n=abs(n-k)
print(n) | n,k = list(map(int,input().split()))
ans = min(n%k,k-(n%k))
print(ans) | p02719 |
import sys
N, K = list(map(int, input().split()))
if K == 1:
print((0))
sys.exit()
current = N
while True:
prev = current
current = abs(current - K)
next = abs(current - K)
if prev == next:
print((min(current, next)))
break
| import sys
N, K = list(map(int, input().split()))
if K == 1:
print((0))
sys.exit()
a = abs(N - K * (N // K + 1))
print((min(a, abs(a - K))))
| p02719 |
N, K = list(map(int, input().split()))
Nj = N
while True:
Ni = Nj
Nj = abs(Ni - K)
if Ni > N:
print(N)
break
elif Nj > Ni:
print(Ni)
break
elif K == 1 or Nj == K:
print((0))
break
else:
continue | N, K = list(map(int, input().split()))
a = N % K
print((min(abs(a - K), a))) | p02719 |
N,K=list(map(int,input().split()))
for i in range(18):
if N > 10 ** i * K:
for j in range(999):
if N > j*10 ** i * K:
N=N-j*10 ** i * K
while abs(N-K)<N:
N=abs(N-K)
print(N) | N,K=list(map(int,input().split()))
for i in reversed(list(range(18))):
while N > 10 ** i * K:
N=N-10 ** i * K
while abs(N-K)<N:
N=abs(N-K)
print(N) | p02719 |
n, k = list(map(int, input().split()))
if k == 1:
n = 0
else:
while True:
if abs(k - n) < n:
n = abs(k - n)
else:
FLG = True
break
print(n) | n, k = list(map(int, input().split()))
if n >= k:
n -= k * (n // k)
if k-n > n:
print(n)
else:
print((k-n)) | p02719 |
N, K = list(map(int, input().split()))
if N % K == 0:
print((0))
else:
li = []
li.append(N)
aoki = N
while aoki <= min(li):
aoki = abs(min(li) - K)
li.append(aoki)
print((min(li)))
| n, k = list(map(int, input().split()))
if n==0 or k==1:
print((0))
exit()
elif n<k:
print((min(n, abs(n-k))))
exit()
elif n % k == 0:
print((0))
exit()
else:
mx = n%k
print((min(abs(mx-k), mx))) | p02719 |
N,K = list(map(int,input().split()))
if(K==1 and N>1):
print((int(0)))
elif(N==0 and K>=1):
print((int(0)))
else:
i = 0
l = 100000000000000000
r = []
while(i==0):
r.append(N)
s = abs(N-K)
if(l>s):
l = s
N = s
if(N in r):
... | N,K = list(map(int,input().split()))
if(N==0):
print((int(0)))
else:
r = N%K
print((min(r,K-r)))
| p02719 |
n,k = list(map(int, input().split()))
mi = n
loop = True
if n%k==0:
mi = 0
loop = False
while loop:
loop = False
if mi > abs(n-k):
loop = True
n = abs(n-k)
mi = n
print(mi) | n,k = list(map(int, input().split()))
mi = n%k
if mi > abs(mi-k):
print((abs(mi-k)))
else:
print(mi) | p02719 |
X = list(map(int, input().split()))
N = X[0]
K = X[1]
if N % K == 0:
print((0))
else:
while True:
A = abs(N - K)
if N > A:
N = A
else:
break
print(N) | X = list(map(int, input().split()))
N = X[0]
K = X[1]
t = N % K
s = K - t
if t <= s:
print(t)
else:
print(s) | p02719 |
import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
if k == 1:
n = 0
print(n)
return
while n > k//2:
n = abs(n-k)
print(n)
main() | import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
a = n % k
print((min(a, k-a)))
main()
| p02719 |
n,k=list(map(int,input().split()))
if n==0 or k==0:
print((0))
exit()
if n%k==0:
print((0))
exit()
while n > abs(n-k):
n=abs(n-k)
print(n) | n,k=list(map(int,input().split()))
amari=n%k
if n==0:
print((0))
exit()
elif n%k==0:
print((0))
exit()
else:
print((min(amari,k-amari)))
'''
while n > abs(n-k):
n=abs(n-k)
print(n)
''' | p02719 |
def main():
N, K = list(map(int, input().split()))
# K: fixed
ans = 0
if N%K==0:
ans = 0
else:
if N>=K:
temp = K
while temp<N:
temp += K
... | def main():
N, K = list(map(int, input().split()))
# K: fixed
ans = 0
r = N%K
if N%K==0:
ans = 0
else:
ans = min(r, abs(r-K))
print(("{}".format(ans)))
if __name__=="__main__":
main() | p02719 |
n, k = list(map(int, input().split()))
if n % k == 0:
print((0))
else:
while True:
prev = n
n = abs(n - k)
if n >= prev:
break
print(prev)
| n, k = list(map(int, input().split()))
p = n // k
print((min(abs(n - p * k), abs(n - (p + 1) * k)))) | p02719 |
import sys
n,k=list(map(int,input().split()))
if n%k==0:
print((0))
sys.exit()
while abs(n-k)<n:
n=abs(n-k)
if n==0:
print(n)
sys.exit()
else:
print(n) | import sys
n,k=list(map(int,input().split()))
if n%k==0:
print((0))
sys.exit()
if n%k<abs(k-n%k):
print((n%k))
else:
print((abs(k-n%k))) | p02719 |
#coding: utf-8
A = list(map(int, input().split()))
N = A[0]
K = A[1]
n = 0
sw = 0
while True:
if N%K == 0:
N = 0
break
sw = abs(N-K)
n += 1
if N > sw:
N = sw
else:
break
print(N) | #coding: utf-8
A = list(map(int, input().split()))
N = A[0]
K = A[1]
n = 0
sw = 0
while True:
if N%K == 0:
N = 0
break
if (N/K) //1:
C = N//K
N = N-C*K
sw = abs(N-K)
n += 1
if N > sw:
N = sw
else:
break
print(N) | p02719 |
n,k = list(map(int,input().split()))
if k == 1:
print((0))
else:
for i in range(1000000000000000000):
if n > abs(n-k):
n = abs(n-k)
elif n <= abs(n-k):
break
print(n) | n,k = list(map(int,input().split()))
# if k == 1:
# print(0)
# else:
# for i in range(1000000000000000000):
# if n > abs(n-k):
# n = abs(n-k)
# elif n <= abs(n-k):
# break
# print(n)
amari = n % k
if abs(amari-k) < amari:
print((abs(amari-k)))
else:... | p02719 |
n,k = list(map(int,input().split()))
if(k==1):
print((0))
else:
t = n//k
for i in range(t):
n = abs(n-k)
if(n < abs(k-n)):
print(n)
else:
print((abs(k-n))) | N, K = list(map(int,input().split()))
t = N%K
if (K - t) >= t:
print(t)
else:
print((K - t)) | p02719 |
n, k = list(map(int, input().split()))
if n % k == 0:
print((0))
else:
ans = n
while ans > abs(n-k):
n = abs(n - k)
ans = min(n, ans)
print(ans) | n, k = list(map(int, input().split()))
if n % k == 0:
print((0))
else:
ans = n % k
#print(ans)
while ans > k//2:
n = abs(ans - k)
ans = min(n, ans)
print(ans) | p02719 |
import sys
import math
import heapq
mod=10**9+7
inf=float("inf")
from math import sqrt, ceil
from collections import deque, Counter, defaultdict, OrderedDict
#すべてのkeyが用意されてる defaultdict(int)で初期化
#順序を保ったdict
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from decimal import ROUND_H... | import sys
import math
import heapq
mod=10**9+7
inf=float("inf")
from math import sqrt, ceil
from collections import deque, Counter, defaultdict, OrderedDict
#すべてのkeyが用意されてる defaultdict(int)で初期化
#順序を保ったdict
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from decimal import ROUND_H... | p03600 |
import copy
ans=0
n=int(eval(input()))
l=[list(map(int,input().split())) for _ in [0]*n]
o=copy.deepcopy(l)
for k in range(n):
for i in range(n):
for j in range(n):
if l[i][j]>l[i][k]+l[k][j]:
print((-1))
exit()
for k in range(n):
for i in range(n):
for j in range(n):
... | INF = 10 ** 12
N = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
for j in range(N):
for k in range(N):
if a[i][j] > a[i][k] + a[k][j]:
print((-1))
exit()
res = 0
for i in range(N):
for j in range... | p03600 |
from itertools import product
N = int(eval(input()))
r = list(range(N))
A = [list(map(int, input().split())) for _ in r]
for i in r: A[i][i] = float('inf')
possible = True
ans = 0
for i,j in product(r, r) :
if j <= i: continue
for k in r:
if A[i][j] < A[i][k] + A[k][j]:
contin... | from itertools import product
N = int(eval(input()))
r = list(range(N))
A = [list(map(int, input().split())) for _ in r]
for i in r: A[i][i] = float('inf')
possible = True
ans = 0
for i in r :
for j in range(i+1,N):
for k in r:
if A[i][j] < A[i][k] + A[k][j]:
conti... | p03600 |
import sys
from copy import deepcopy as dc
input = sys.stdin.buffer.readline
N = int(eval(input()))
d = [list(map(int, input().split())) for _ in range(N)]
d2 = dc(d)
for k in range(N):
for i in range(N):
for j in range(N):
d2[i][j] = min(d2[i][k] + d2[k][j], d2[i][j])
f = 0
for i in range(N):
... | N = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(N)]
b = [a[i][: ] for i in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
b[i][j] = min(b[i][j], b[i][k] + b[k][j])
inf = 10 ** 10
if a == b:
dp = [[inf] * N for _ in range(N)]
for i in range(N):
for j in... | p03600 |
from collections import deque
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dist = [[float('inf')] * N for _ in range(N)]
for i in range(N):
dist[i][i] = 0
edges = []
for i in range(N-1):
for j in range(i+1, N):
edges.... | from copy import deepcopy
import sys
input = sys.stdin.readline
def floyd_warshall(dist):
v = len(dist)
for k in range(v):
for i in range(v):
for j in range(v):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
N = int(eval(input()))
A = [list(map(int, i... | p03600 |
from heapq import heappush, heappop
INF = 10 ** 20
n = int(eval(input()))
que = []
for i in range(n):
aList = list(map(int, input().split()))
for j in range(i, n):
heappush(que, (aList[j], i, j))
dist = [[INF] * n for _ in range(n)]
ans = 0
while que:
c, i, j = heappop(que)
minDi... | INF = 10 ** 20
n = int(eval(input()))
edges = [list(map(int, input().split())) for _ in range(n)]
dist = [[INF] * n for _ in range(n)]
edgeList = []
for i in range(n):
for j in range(i, n):
edgeList.append((edges[i][j], i, j))
edgeList.sort()
for k in range(n):
for i in range(n):
... | p03600 |
INF = 10 ** 20
n = int(eval(input()))
edges = [list(map(int, input().split())) for _ in range(n)]
dist = [[INF] * n for _ in range(n)]
edgeList = []
for i in range(n):
for j in range(i, n):
edgeList.append((edges[i][j], i, j))
edgeList.sort()
for k in range(n):
for i in range(n):
... | INF = 10 ** 20
n = int(eval(input()))
edges = [list(map(int, input().split())) for _ in range(n)]
dist = [[INF] * n for _ in range(n)]
edgeList = []
for i in range(n):
for j in range(i, n):
edgeList.append((edges[i][j], i, j))
edgeList.sort()
for k in range(n):
edgesk = edges[k]
for i... | p03600 |
N=int(eval(input()))
dist=[list(map(int,input().split())) for i in range(N)]
ans=sum([sum(dist[i]) for i in range(N)])
ans//=2
was=set()
for i in range(N):
if ans<0:break
for j in range(i+1,N):
if ans<0:break
for k in range(j+1,N):
a,b,c=dist[i][j],dist[i][k],dist[j][k]
... | import sys
input=sys.stdin.readline
N=int(eval(input()))
dist=[list(map(int,input().split())) for i in range(N)]
ans=sum([sum(dist[i]) for i in range(N)])
for i in range(N):
dist[i][i]=float('inf')
ans//=2
def main(ans):
for i in range(N):
for j in range(i+1,N):
Min=min(list(map(s... | p03600 |
n = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(n)]
def warshal_floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k]+d[k][j])
return d
import copy
B = copy.deepcopy(A)
B = warshal_floyd(B)
ans = 0
for i in ra... | def main():
n = int(eval(input()))
d = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(n):
if i == j:
continue
flag = True
for k in range(n):
if k == i or k == j:
... | p03600 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
import heapq
n = int(readline())
dist = [[INF] * n for _ in range(n)]
hq = []
table = [[0] * n for _ in range(n)]
for i in range(n):
a = list(map(i... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
import heapq
n = int(readline())
dist = [[INF] * n for _ in range(n)]
hq = []
table = [[0] * n for _ in range(n)]
for i in range(n):
a = list(map(i... | p03600 |
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
#print(a)
for k in range(n-1,-1,-1):
for i in range(n-1,-1,-1):
for j in range(n-1,-1,-1):
#print(k,i,j,a)
if (i==j or k==i or k==j):
continue
if (a[i][... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
#print(a)
for k in range(n-1,-1,-1):
for i in range(n-1,-1,-1):
for j in range(n-1,-1,-1):
#print(k,i,j,a)
... | p03600 |
N = int(eval(input()))
A,B,Ans = [],[],0
for i in range(N):
x = list(map(int,input().split()))
A.append(x.copy())
B.append(x.copy())
for k in range(N):
for i in range(N):
for j in range(N):
B[i][j] = min(B[i][j],B[i][k]+ B[k][j])
if A!=B:
print((-1))
else:
fo... | N = int(eval(input()))
A,B,Ans = [],[],0
for i in range(N):
x = list(map(int,input().split()))
A.append(x[:])
B.append(x[:])
for k in range(N):
for i in range(N):
for j in range(N):
B[i][j] = min(B[i][j],B[i][k]+ B[k][j])
if A!=B:
print((-1))
else:
for i in r... | p03600 |
from heapq import heappush, heappop
def prim_heap(edges, n):
visited = [False] * n
heap = []
start = 0
for e in edges[start]:
heappush(heap, e)
visited[start] = True
res = 0
while heap:
cost, v = heappop(heap)
if visited[v]:
continue
... | def warshall(d, n):
e = copy.deepcopy(d)
for k in range(n):
for i in range(n):
for j in range(n):
# print(d[i][k], d[k][j], d[i][j])
if i == k or k == j:
continue
if d[i][k] + d[k][j] < d[i][j]:
... | p03600 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03600 |
n=int(eval(input()))
d=[]
ans=0
for i in range(n):
tmp=[int(j) for j in input().split()]
d.append(tmp)
for i in range(n):
for j in range(i+1,n):
ans+=d[i][j]
for i in range(n):
for j in range(i+1,n):
for k in range(n):
if i==k or j==k:
continue
... | n=int(eval(input()))
d=[]
for i in range(n):
tmp=[int(j) for j in input().split()]
d.append(tmp)
ans=[[0]*n for i in range(n)]
for i in range(n):
for j in range(i+1,n):
ans[i][j]=d[i][j]
for i in range(n):
for j in range(i+1,n):
for k in range(n):
if i==k ... | p03600 |
from heapq import *
from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
n=int(input())
aa=LL... | p03600 |
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
def main():
for i in range(N):
for j in range(N):
if i == j:
continue
for k in range(N):
if i == k or j == k:
continue
if A... | def main():
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N):
A[i][i] = float('INF')
for i in range(N):
for j in range(i):
if i == j:
A[i][j] = float('INF')
continue
... | p03600 |
n = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(n)]
# 小さい順に調べていく
roads = []
for i in range(n-1):
for j in range(i+1, n):
roads.append((A[i][j], i, j))
roads = sorted(roads)
INF = 10**9*1
AD = [[INF]*n for _ in range(n)]
G = [[] for _ in range(n)]
edges = set()
from c... | n = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(n)]
INF = 10**9 + 1
dp = [[INF]*n for _ in range(n)]
# コスト登録
for i, line in enumerate(A):
for j, a in enumerate(line):
dp[i][j] = a
for k in range(n):
for i in range(n):
for j in range(n):
if i ... | p03600 |
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
def sol():
for k in range(N):
for i in range(N):
for j in range(N):
d = A[i][k] + A[k][j]
if d < A[i][j]:
return - 1
INF = 10**18
for k in ra... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
def sol():
for k in range(N):
for i in range(N):
for j in range(N):
d = A[i][k] + A[k][j]
if d < A[i][j]:
return - 1
ret = 0
for i in range(N):... | p03600 |
N, *L = list(map(int, open(0).read().split()))
cost = []
for i, m in enumerate(zip(*[iter(L)]*N)):
cost.append(m)
ans = 0
for i in range(N):
for j in range(i):
m = min(cost[i][k]+cost[k][j] if k!=i and k!=j else 10**10 for k in range(N))
if m<cost[i][j]:
print((-1))
import sys
s... | N, *L = list(map(int, open(0).read().split()))
cost = []
for m in zip(*[iter(L)]*N):
cost.append(m)
ans = 0
for i in range(N):
for j in range(i):
for k in range(N):
if k==i or k==j:
continue
if cost[i][j]>cost[i][k]+cost[k][j]:
print((-1))
import sys
sys.... | p03600 |
#!/usr/bin/env pypy3
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
import copy
################
class UnionFind():
"""
parents : 親要素(findしない場合は根ではないことの注意)，根の場合は"-(要素数）"
find(x):要素xの属するグループの根を返す
size(x):要素x... | #!/usr/bin/env pypy3
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
inf=10*20
N=I()
A=[[]for _ in range(N)]
A2=[[1]*N for _ in range(N)]
ans=0
for i in range(N):
... | p03600 |
import heapq
from collections import deque
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(N)]
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**9+1] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
... | import heapq
from collections import deque
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(N)]
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**9+1] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
... | p03600 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_()... | p03600 |
import sys
import copy
n = int(eval(input()))
dist = [list(map(int,input().split())) for _ in range(n)]
e = copy.deepcopy(dist)
for k in range(n):
for i in range(n):
for j in range(n):
if dist[i][j]>dist[i][k] + dist[k][j]:
print((-1))
sys.exit()
... | import sys
import copy
n = int(eval(input()))
dist = [list(map(int,input().split())) for _ in range(n)]
e = copy.deepcopy(dist)
for k in range(n):
for i in range(n):
for j in range(n):
if dist[i][j]>dist[i][k] + dist[k][j]:
print((-1))
sys.exit()
... | p03600 |
def main():
from heapq import heappush, heappop
from operator import itemgetter
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):
... | def main():
from heapq import heappush, heappop
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):
print((-1))
retur... | p03600 |
def main():
from heapq import heappush, heappop
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):
print((-1))
retur... | def main():
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
if a[i][j] > a[i][k] + a[k][j]:
print((-1))
return
ret = 0
f... | p03600 |
import heapq
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
used = [[False] * N for _ in range(N)]
ans = 0
for i in range(N):
for j in range(N):
via = i
for k in range(N):
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
... | import heapq
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N):
for j in range(N):
via_k = float('inf')
for k in range(N):
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
exit()
... | p03600 |
#!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
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, ... | p03600 |
#!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()... | p03600 |
from functools import reduce
import math
import copy
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# N の逆元... | from functools import reduce
import math
import copy
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# N の逆元... | p03600 |
import copy
from itertools import product, combinations
N = int(eval(input()))
dp = []
for _ in range(N):
dp.append(list(map(int, input().split(' '))))
original = copy.deepcopy(dp)
for k, i, j in product(list(range(N)), repeat=3):
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])
if dp == origi... | import copy
from itertools import product, combinations
N = int(eval(input()))
dp = []
for _ in range(N):
dp.append(list(map(int, input().split(' '))))
original = copy.deepcopy(dp)
for k, i, j in product(list(range(N)), repeat=3):
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])
if dp == origina... | p03600 |
import sys
from itertools import permutations, combinations
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(N)]
length = 0
possible = True
for a in range(N):
for b, l in enumerate(A[a]):
for ... | import sys
from itertools import permutations, combinations
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(N)]
length = 0
possible = True
for a, b in combinations(list(range(N)), 2):
Lab = A[a][b]
... | p03600 |
import sys
from itertools import permutations, combinations
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(N)]
length = 0
possible = True
for a, b in combinations(list(range(N)), 2):
Lab = A[a][b]
... | import sys
from itertools import combinations
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = dict()
for i in range(N):
A[i] = dict()
for j, a in enumerate(list(map(int, input().split()))): A[i][j] = a
length = 0
possible = True
for a, b in... | p03600 |
import sys
from itertools import permutations, combinations
N=eval(input())
d=[ [ float("inf") for j in range(N+1) ] for i in range(N+1) ]
hen=[ [ 0 for j in range(N+1) ] for i in range(N+1) ]
ans=0
for i in range(N):
L=list(map(int, sys.stdin.readline().split()))
d[i][i]=0
for j in range(i+1,N):
l... | import sys
from itertools import permutations, combinations
N=eval(input())
d=[ [ float("inf") for j in range(N+1) ] for i in range(N+1) ]
KOUHO=[]
for i in range(N):
L=list(map(int, sys.stdin.readline().split()))
d[i][i]=0
for j in range(i+1,N):
length=L[j]
d[i+1][j+1]=length
d[j+1][i+1]=lengt... | p03600 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
A = [[int(i) for i in readline().split()] for _ in range(N)]
via_min = [[10**15] * N for _ in range(N)]
for i in range(N):
for j in range(N):
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
A = [[int(i) for i in readline().split()] for _ in range(N)]
via_min = [[10**15] * N for _ in range(N)]
ans = 0
for i in range(N-1):
for j in range(i... | p03600 |
import heapq
INFTY = 10**12
def dist(cur,b):
d = [INFTY for _ in range(N)]
d[cur[1]] = 0
hist = [0 for _ in range(N)]
hist[cur[1]] = 1
heap = [cur]
while heap:
cur = heapq.heappop(heap)
hist[cur[1]] = 1
for x in B[cur[1]]:
if hist[x[1]]==0:
... | N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
cnt = 0
for i in range(N-1):
for j in range(i+1,N):
amin = 10**10
for k in range(N):
if k!=i and k!=j:
amin = min(amin,A[i][k]+A[k][j])
if A[i][j]>amin:
cnt = -1
... | p03600 |
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
cnt = 0
for i in range(N):
for j in range(N):
cnt += A[i][j]
flg = 0
B = [[0 for _ in range(N)] for _ in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
if A[i][j]>A[i][k]+A[k]... | N = int(eval(input()))
A = [[0 for _ in range(N+1)]]
for _ in range(N):
a = list(map(int,input().split()))
a.insert(0,0)
A.append(a)
tot = 0
for i in range(1,N):
for j in range(i,N+1):
tot += A[i][j]
for i in range(1,N):
for j in range(i+1,N+1):
for k in range(1,N+1):
... | p03600 |
from heapq import heappop, heappush
def bfs(x, y):
path = [float('inf')] * N
q = []
heappush(q, (0, x))
path[x] = 0
while q:
s, p = heappop(q)
for np, d in edge[p]:
nd = path[p] + d
if path[np] > nd:
path[np] = nd
... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N):
for j in range(N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] for k in rang... | p03600 |
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N):
for j in range(N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] for k in rang... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N - 1):
for j in range(i + 1, N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] fo... | p03600 |
N = int(eval(input()))
src = [list(map(int,input().split())) for i in range(N)]
ans = 0
for k in range(N):
for i in range(N):
for j in range(N):
if src[i][j] > src[i][k] + src[k][j]:
print((-1))
exit()
for i in range(N-1):
for j in range(i+1,N):
... | N = int(eval(input()))
A = [list(map(int,input().split())) for i in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
exit()
ans = 0
for i in range(N-1):
for j in range(i+1,N):
... | p03600 |
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
from heapq import*
N=int(eval(input()))
A=[list(map(int,input().split())) for i in range(N)]
data=[[] for i in range(N)]
for i in range(N):
for m in range(N):
... | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
from heapq import*
N=int(eval(input()))
A=[list(map(int,input().split())) for i in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
... | p03600 |
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
b = [[1]*n for i in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
if a[i][k] + a[k][j] < a[i][j]:
print((-1))
exit()
elif a[i][k] + a[k][j] =... | n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
b = [[1]*n for i in range(n)]
for k in range(n):
for i in range(n):
for j in range(n):
if a[i][k] + a[k][j] < a[i][j]:
print((-1))
exit()
elif a[i][k] + a[k][j] =... | p03600 |
import copy
N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
B = copy.deepcopy(A)
ans = 0
for i in range(N):
ans += sum(A[i])
for j in range(N):
if i == j:
continue
for k in range(N):
if k == i or k == j:
continue
... | import copy
N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
B = copy.deepcopy(A)
table = [[True]*N for i in range(N)]
ans = 0
for i in range(N):
for j in range(N):
if i == j:
continue
for k in range(N):
if k == i or k == j:
... | p03600 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.