input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
A,B,C,K = list(map(int,input().split()))
if A >= K:
print(K)
else :
if (K-A) <= B:
print(A)
else:
print((A-(K-A-B))) | A,B,C,K = list(map(int ,input().split()))
if A>=K:
print(K)
else:
if A+B>=K:
print(A)
else:
print((A-(K-A-B))) | p02682 |
a, b, c, k = list(map(int, input().split()))
if k > a + b:
print((a - (k - a - b)))
elif k > a:
print(a)
else:
print(k) | a, b, c, k = list(map(int, input().split()))
if k <= a+b:
print((min(k, a)))
else:
print((min(a, (a - (k - (b+a))))))
| p02682 |
A, B, C, K = list(map(int, input().split()))
count = 0
second = K-A-B
if A >= K:
count = K
else:
count = A
if second:
for j in range(second):
count -= 1
print(count)
| A, B, C, K = list(map(int, input().split()))
count = 0
second = K-A-B
if A >= K:
count = K
else:
count = A
if second > 0:
count -= second
print(count) | p02682 |
A, B, C, K = list(map(int, input().split()))
Ans = 0
if K <= A:
Ans = K
elif K <= A + B:
Ans = A
else:
Ans = A - (K - A - B)
print(Ans)
| A, B, C, K = list(map(int, input().split()))
if A >= K:
print(K)
elif A + B >= K:
print(A)
else:
print((2*A + B - K))
| p02682 |
a,b,c,k = list(map(int, input().split()))
count = 0
if a <= k:
count += a
else:
count += k
print(count)
exit()
k -= a
if b <= k:
k -= b
else:
print(count)
exit()
count -= k
print(count) | A,B,C,K=list(map(int,input().split()))
if (A+B)>=K and A<=K:
print(A)
elif (A+B)>=K and A>=K:
print(K)
elif (A+B)<K:
print((A-(K-A-B))) | p02682 |
#S = str(input())
A, B, C, K = list(map(int,input().split()))
if A <= K:
a = A
else:
a = K
if B <= K-a:
b = B
else:
b = K-a
c = K - a - b
ans = a - c
print(ans) | a, b, c, k = list(map(int, input().split()))
xa = min(k,a)
xb = min(k-xa,b)
xc = k- xa - xb
print((xa - xc))
| p02682 |
# B - Easy Linear Programming
a, b, c, k = list(map(int, input().split()))
if k <= a:
print(k)
elif a < k <= a + b:
print(a)
else:
print((a - (k - (a + b))))
| # B - Easy Linear Programming
a, b, c, k = list(map(int, input().split()))
print((min(k, a, a + a + b - k)))
| p02682 |
a, b, c, k = list(map(int, input().split()))
box = []
result = 0
if c == 0:
if a >= k:
print(k)
else:
print(a)
quit()
for i in range(a):
box.append(1)
for i in range(b):
box.append(0)
for i in range(c):
box.append(-1)
for i in range(k):
result = result + box[i]
print(result) | a, b, c, k = list(map(int, input().split()))
box = []
result = 0
if k <= a:
print(k)
quit()
else:
k = k - a
result = a
if k <= b:
print(result)
quit()
else:
k = k - b
if k <= c:
result = result - k
print(result)
quit()
else:
result = result -c
print(result)
quit() | p02682 |
A,B,C,K=list(map(int,input().split()))
if A+B>=K:
if A<=K:
print(A)
else:
print(K)
else:
print((A*2-K+B))
| A,B,C,K=list(map(int,input().split()))
if K<=A+B:
print((min(A,K)))
else:
print((A-(K-A-B)))
| p02682 |
#枚数
a, b, c, k = list(map(int, input().split()))
A = a
B = 0
C = -1 * c
if k - a >= 0:
if k -a -b > 0:
for i in range(c +1):
if a + b + i == k:
print((a + (-1)*i))
else:
print(a)
else:
print(k)
| #枚数
a, b, c, k = list(map(int, input().split()))
A = a
B = 0
C = -1 * c
if k - a >= 0:
if k -a -b >= 0:
print((a + (-1)*(k -a -b) ))
else:
print(a)
else:
print(k)
| p02682 |
A,B,C,K = list(map(int,input().split()))
result = 0
#A分引く
if (K - A) < 0:
for i in range(A):
if K <= 0:
break
result = result + 1
K -= 1
else:
K -= A
result += 1*A
if (K-B) < 0:
for i in range(B):
if K <= 0:
break
K -= 1
else:
K -= B
if (K-C) < 0:
for i in range(C):
if K <= 0:
break
K -= 1
result -= 1
else:
K -= C
result -= C
print(result)
| A,B,C,K = list(map(int,input().split()))
def abc(A,B,C,K):
result = 0
#A分引く
K = K - A
result = A + result
if K < 0:
K = K + A
result -= abs(abs(K)-A)
return result
K -= B
if K < 0:
return result
K -= C
result -= C
if K < 0:
K += C
result += abs(abs(K)-C)
return result
print((abc(A,B,C,K))) | p02682 |
A, B, C, K = list(map(int, input().split()))
if K >= A+B:
ans = A - (K-A-B)
else:
ans = K
print(ans)
| A, B, C, K = list(map(int, input().split()))
if K <= A:
print(K)
elif K <= A+B:
print(A)
else:
print((A-(K-A-B))) | p02682 |
import math
from functools import reduce
import itertools
A,B,C,K = list(map(int,input().split()))
count=0
if A>=K:
ans=K
else:
count+=A
if A+B>=K:
ans=A
else:
for i in range(K-(A+B)):
count-=(K-(A+B))
ans=count
print(ans)
| import math
from functools import reduce
import itertools
A,B,C,K = list(map(int,input().split()))
count=0
if A>=K:
ans=K
else:
count+=A
if A+B>=K:
ans=A
else:
count-=(K-(A+B))
ans=count
print(ans)
| p02682 |
def main():
A,B,_,K=list(map(int,input().split()))
print((min(A, K) - max(0, K-A-B)))
return
if __name__=='__main__':
main() | def main():
A,B,C,K=list(map(int,input().split()))
print((min(A, K) - max(0, K-A-B)))
return
if __name__=='__main__':
main() | p02682 |
A,B,C,K = list(map(int, input().split()))
count = 0
if A + B + C == K:
print((A - C))
elif A > K:
print(K)
elif A+B > K:
print(A)
else:
for i in reversed(list(range(0, K))):
if A > 0:
count += 1
A = A - 1
elif B > 0:
B = B - 1
else:
count -= 1
print(count) | A,B,C,K = list(map(int, input().split()))
count = 0
if A + B + C == K:
print((A - C))
elif A >= K:
print(K)
elif A+B >= K:
print(A)
else:
t = K - A - B
print((A - t)) | p02682 |
A, B, C, K = list(map(int, input().split()))
result = 0
if A >= K:
print(K)
else:
for i in range(K):
if A > (i + 1):
result += 1
continue
elif A == (i + 1):
result += 1
continue
if B > (i + 1 - A):
result += 0
continue
elif B == (i + 1 - A):
result += 0
continue
if C > (i + 1 - A - B):
result -= 1
continue
elif C == (i + 1 - A - B):
result -= 1
break
else:
break
print(result) | A, B, C, K = list(map(int, input().split()))
if A >= K:
print(K)
elif (A + B) >= K:
print(A)
elif (A + B + C) > K:
print((A - (K - A - B)))
elif (A + B + C) == K:
print((A - C)) | p02682 |
A, B, C, K = list(map(int, input().split()))
if A > K:
a = K
else:
a = A
if (A + B) < K:
for i in range(0,K-A-B):
a = a - 1
print(a) | A, B, C, K = list(map(int, input().split()))
if A > K:
a = K
else:
a = A
if (A + B) < K:
a = a - K + A + B
print(a) | p02682 |
a, b, c, k = input().split()
a, b, c, k = int(a), int(b), int(c), int(k)
result = 0
if a == k:
result = a
else:
for i in range(k):
if a != 0:
result = result + 1
a = a - 1
elif a == 0 and b != 0:
#result変わらず
b = b - 1
elif a == 0 and b == 0 and c != 0:
result = result - 1
c = c - 1
else:
break
print(result)
| a, b, c, k = list(map(int, input().split()))
if a >= k:
print(k)
exit()
if k-a-b <= 0:
print(a)
exit()
print((a-(k-a-b)))
| p02682 |
# -*- coding: utf-8 -*-
# 標準入力の取得
A, B, C, K = list(map(int, input().split()))
# 求解処理
result = int()
if K <= A:
result = K
elif A < K and K <= A + B:
result = A
elif A + B < K and K <= A + B + C:
result = 2*A + B - K
# 結果出力
print(result)
| # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""標準入力の取得
Returns:
tuple -- 標準入力
"""
A, B, C, K = list(map(int, input().split()))
return A, B, C, K
def main(A: int, B: int, C: int, K: int) -> None:
"""求解処理.
Kの値で場合分けする.
Arguments:
A {int} -- 整数
B {int} -- 整数
C {int} -- 整数
K {int} -- 整数
"""
result = int()
if K <= A:
result = K
elif A < K and K <= A + B:
result = A
elif A + B < K and K <= A + B + C:
result = 2*A + B - K
# 結果出力
print(result)
if __name__ == "__main__":
A, B, C, K = get_input()
main(A, B, C, K)
| p02682 |
a,b,c,k = list(map(int,input().split()))
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
print((a-(k-(a+b))))
| a,b,c,k = list(map(int,input().split()))
ans = 0
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
ans += a
k -= (a+b)
ans -= k
print(ans)
| p02682 |
a,b,c,k = list(map(int,input().split()))
ans = 0
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
ans += a
k -= (a+b)
ans -= k
print(ans)
| a,b,c,k = list(map(int,input().split()))
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
k -= (a+b)
print((a-k))
| p02682 |
A,B,C,K = list(map(int,input().split()))
if A >= K:
print(K)
elif (A+B)>=K:
print(A)
else:
print((A*2+B-K))
| A,B,C,K = list(map(int,input().split()))
if K <= A:
print(K)
elif K <= A+B:
print(A)
else:
print((2*A+B-K))
| p02682 |
a, b, c, k = list(map(int, input().split(' ')))
if a+b>k:
print(k)
else:
if a+b+c<=k:
print((a-c))
else:
print((a-(k-(a+b)))) | a, b, c, k = list(map(int, input().split(' ')))
if a+b>k:
print(k)
elif a+b+c<=k:
print((a-c))
else:
print((a-(k-(a+b)))) | p02682 |
a, b, c, k=input().split()
a=int(a)
b=int(b)
c=int(c)
k=int(k)
ans=0
if a>0 and k>0 and a<=k:
k=k-a
ans=ans+a
elif a>0 and k>0 and a>k:
ans=ans+k
k=0
while b>0 and k>0:
b+=-1
k+=-1
while c>0 and k>0:
ans+=-1
c+=-1
k+=-1
print(ans) | a, b, c, k=input().split()
a=int(a)
b=int(b)
c=int(c)
k=int(k)
ans=0
if a>0 and k>0 and a<=k:
k=k-a
ans=ans+a
elif a>0 and k>0 and a>k:
ans=ans+k
k=0
if b>0 and k>0 and b<=k:
k=k-b
elif b>0 and k>0 and b>k:
k=0
if c>0 and k>0 and c<=k:
k=k-c
ans=ans-c
elif c>0 and c>0 and c>k:
ans=ans-k
k=0
print(ans) | p02682 |
A,B,C,K=(int(x) for x in input().split())
if(K<A):
print(K)
elif(K>=A and K<=A+B):
print(A)
else:
print((A-(K-A-B))) | a,b,c,k=(int(x) for x in input().split())
xa=min(a,k)
k-=xa
xb=min(b,k)
k-=xb
xc=k
ans=xa-xc
print(ans) | p02682 |
# coding: utf-8
a,b,c,k = list(map(int, input().split()))
sum = 0
if b == 0 and c == 0:
print(k)
else:
for i in range(k):
if a > 0:
sum = sum + 1
a = a - 1
elif b > 0:
b = b - 1
elif c > 0:
sum = sum - 1
c = c - 1
print(sum) | # coding: utf-8
import sys
# sys.exit()
a,b,c,k = list(map(int, input().split()))
# sum = 0
if k <= a:
sum = k
print(sum)
sys.exit()
else:
sum = a
k = k - a
if k <= b:
print(sum)
sys.exit()
else:
k = k - b
sum = sum - k
print(sum)
| p02682 |
A, B, C, K = list(map(int, input().split()))
sum=0
if A>K:
sum += K
K = 0
else:
sum += A
K = K-A
if B>K:
K = 0
else:
K = K-B
if C>K:
sum -= K
K = 0
else:
sum -= C
K = K-C
print(sum) | A, B, C, K = list(map(int, input().split()))
sum = 0
X_a = min(A,K)
sum += X_a
K -= X_a
X_b = min(B,K)
K -= X_b
X_c = min(C,K)
sum -= X_c
print(sum) | p02682 |
a,b,c,k = list(map(int, input().split()))
print((min(k,a) - (k-a-b if k-b>a else 0)))
| a,b,c,k = list(map(int, input().split()))
print((min(k, a) - max(0, k-a-b)))
| p02682 |
a, b, c, k = list(map(int, input().split()))
cnt = 0
if k >= a:
k = k - a #3
cnt = cnt + 1*a #1
if k >= b:
k = k - b #1
if k >= c:
cnt = cnt + -1*c
k = k - c
else:
for i in range(0, k):
cnt += -1
k -= 1
else:
for i in range(0, k):
k -= 1
else:
for i in range(0, k):
cnt += 1
k -= 1
print(cnt) | a, b, c, k = list(map(int, input().split()))
cnt = 0
if k >= a:
k = k - a #3
cnt = cnt + 1*a #1
if k >= b:
k = k - b #1
if k >= c:
cnt = cnt + -1*c
k = k - c
else:
cnt = cnt + -1*k
k = k - k
else:
k = k - k
else:
cnt = cnt + 1*k
k = k - k
print(cnt) | p02682 |
a,b,c,k = list(map(int, input().split()))
ans = 0
if k <= a:
ans = k
k = 0
else:
ans = a
k -= a
if k <= b:
k = 0
else:
k -= b
ans = ans - k
print(ans)
| a,b,c,k=list(map(int,input().split()))
print((min(k,a)-max(k-a-b,0))) | p02682 |
a,b,c,k=list(map(int,input().split()))
print((min(k,a)-max(k-a-b,0))) | a,b,c,k=list(map(int,input().split()))
print((min(2*a+b-k,a,k))) | p02682 |
a,b,c,k = list(map(int, input().split()))
if k <= a:
ans = k
print(ans)
else:
ans = a
k = k-a
if k <= b:
print(ans)
else:
k = k-b
print((ans-k)) | a,b,c,k = list(map(int, input().split()))
if k <= a:
print(k)
else:
ans = a
k = k-a
if k <= b:
print(ans)
else:
k = k-b
print((ans-k)) | p02682 |
#Solver:Rute
a,b,c,k = list(map(int,input().split()))
if k<=a:
print(k)
elif a<k<a+b:
print(k)
else:
#-1のカードの枚数超過 (k-(a+b))枚
print((a-(k-(a+b)))) | #Solver:Rute
a,b,c,k = list(map(int,input().split()))
if 0<=k<=a:
print(k)
elif a<k<=a+b:
print(a)
else:
print((a-(k-(a+b)))) | p02682 |
A, B, C, K = list(map(int, input().split()))
if K <= A:
print(K)
exit(0)
K -= A
ans = A
if K <= B:
print(ans)
exit(0)
K -= B
print((ans-K))
| A, B, C, K = list(map(int, input().split()))
if K <= A:
print(K)
exit(0)
K -= A
if K <= B:
print(A)
exit(0)
print((A-(K-B)))
| p02682 |
def resolve():
A, B, C, K = map(int, input().split())
ans = 0
cnt = min(K, A)
ans += cnt * 1
K -= cnt
if K < 1:
return print(ans)
cnt = min(K, B)
ans += cnt * 0
K -= cnt
if K < 1:
return print(ans)
ans += K * -1
print(ans)
if __name__ == "__main__":
resolve()
|
def resolve():
a, b,c,k = list(map(int, input().split()))
ans = 0
used = min(k,a)
ans += used * 1
k -= used
used = min(k, b)
k -= used
ans += k*(-1)
print(ans)
if __name__ == "__main__":
resolve() | p02682 |
a,b,c,k = list(map(int, input().split()))
count = 0
if a <= k:
count += a
else:
count += k
print(count)
exit()
k -= a
if b <= k:
k -= b
else:
print(count)
exit()
for i in range(k):
count -= 1
print(count) | a,b,c,k = list(map(int, input().split()))
count = 0
if a <= k:
count += a
else:
count += k
print(count)
exit()
k -= a
if b <= k:
k -= b
else:
print(count)
exit()
count -= k
print(count) | p02682 |
a, b, c, k = list(map(int, input().split()))
if k <= a:
print(k)
elif k <= (a+b):
print(a)
else:
print((a-(k-a-b))) | a, b, c, k = list(map(int, input().split()))
if k <= a:
print(k)
elif k <= a+b:
print(a)
else:
print((a-(k-a-b)))
| p02682 |
a,b,c,k = list(map(int,input().split()))
if a+b >= k:
if a > k:
print(k)
else:
print(a)
else :
print((a-(k-a-b))) | a, b, c, k = list(map(int, input().split()))
ans = 0
if k < a:
ans = k
elif k <= a+b:
ans = a
else:
ans = a - (k-a-b)
print(ans) | p02682 |
a,b,c,k = list(map(int,input().split()))
if a + b >= k:
ans = min(a,k)
else:
ans = a - (k-a-b)
print(ans) | a,b,c,k = list(map(int,input().split()))
print((min(a,k)-max(k-a-b,0))) | p02682 |
a,b,c,k = list(map(int, input().split()))
cnt = 0
import sys
if a==k:
cnt = a
print(cnt)
sys.exit(0)
for i in range(k):
if a>0:
cnt += 1
a -= 1
elif b>0:
cnt += 0
b -= 1
elif c>0:
cnt -= 1
c -= 1
print(cnt) | a,b,c,k = list(map(int, input().split()))
cnt = 0
if a>=k:
cnt += k
else:
k -= a
cnt += a
if k>0:
k -= b
if k>0:
cnt -= k
print(cnt) | p02682 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c, k = list(map(int, readline().split()))
if a + b >= k:
print((min(a, k)))
else:
print((a - (k - a - b)))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c, k = list(map(int, read().split()))
print((min(a, k) if a + b >= k else 2 * a + b - k))
| p02682 |
a, b, c, d = list(map(int, input().split()))
ans = 0
if a == d:
print(a)
else:
for _ in range(a):
ans += 1
if d-a != 0:
for _ in range(d-a):
ans += 0
if d-a-b != 0:
for _ in range(d-a-b):
ans += -1
print(ans) | a, b, c, d = list(map(int, input().split()))
if a >= d:
print((d*1))
elif a < d:
if d-(a+b) <= 0:
print(a)
elif d-(a+b+c) <= 0:
print((a + (d-a-b)*(-1))) | p02682 |
a, b, c, k = list(map(int, input().split()))
r = 0
if a < k:
r += a
if a + b + c < k:
r -= c
elif a + b < k:
r -= k - a - b
else:
r = k
print(r)
| a, b, c, k = list(map(int, input().split()))
pa = min([a, k])
k -= pa
pb = min([b, k])
k -= pb
pc = min([c, k])
print((pa - pc)) | p02682 |
A,B,C,K = list(map(int,input().split()))
ans = min(K,A)
K -= A
if K > 0:
K -= B
if K > 0:
ans -= K
print(ans)
| A,B,C,K = list(map(int,input().split()))
print((min(K,A) - max(0,K-A-B)))
| p02682 |
a = input().rstrip().split(' ')
A,B,C,K = int(a[0]),int(a[1]),int(a[2]),int(a[3])
s = 0
if K - A <= 0:
print(K)
else:
K -= A
if K - B <= 0:
print(A)
else:
K -= B
print((A-K)) | A,B,C,K = list(map(int,input().split()))
xa = min(K,A)
K -= xa
xb = min(K,B)
K -= xb
ans = xa - K
print(ans) | p02682 |
a, b, c, k = list(map(int, input().split()))
if k < a:
print(k)
exit()
k -= (a+b)
if k <= 0:
print(a)
exit()
else:
ans = a
for i in range(k):
ans -= 1
print(ans) | a, b, c, k = list(map(int, input().split()))
if k < a:
print(k)
exit()
k -= (a+b)
if k <= 0:
print(a)
exit()
else:
ans = a
print((ans - k)) | p02682 |
a,b,c,k =list(map(int, input().split()))
ans = 0
while k > 0:
if a >= k:
ans += k
break
else:
ans += a
k -= a
if b >= k:
break
else:
k -= b
ans -= k
break
print(ans) | a,b,c,k =list(map(int, input().split()))
ans = 0
x = min(k , a)
ans += x
k2 = k - x
x2 = min(k2, b)
k3 = k2 - x2
x3 = min(k3, c)
ans -= k3
print(ans) | p02682 |
A,B,C,K=list(map(int,input().split()))
ans=0
if K >= A:
ans+=A
K-=A
A=0
while K > 0 and A > 0:
ans+=1
K-=1
A-=1
if K >= B:
K-=B
B=0
while K > 0 and B > 0:
K-=1
B-=1
if K >= C:
ans-=C
K-=C
C=0
while K > 0 and C > 0:
ans-=1
K-=1
C-=1
print(ans) | A,B,C,K=list(map(int,input().split()))
ans=0
if K >= A:
ans+=A
K-=A
A=0
else:
ans=K*1
K=0
if K >= B:
K-=B
B=0
else:
K=0
if K >= C:
ans-=C
K-=C
C=0
else:
ans=ans+K*(-1)
C=0
print(ans) | p02682 |
import sys
a, b, c, k = list(map(int, input().split()))
max = 0
if a < k:
for i in range(a, -1, -1):
for j in range(b, -1, -1):
for l in range(c+1):
if i+j+l == k:
print((i-l))
sys.exit()
else:
for i in range(k, -1, -1):
for j in range(b, -1, -1):
for l in range(c+1):
if i+j+l == k:
print((i-l))
sys.exit() | import sys
a, b, c, k = list(map(int, input().split()))
if a >= k:
print(k)
sys.exit()
else:
if b >= k-a:
print(a)
sys.exit()
else:
print((a-(k-a-b)))
sys.exit() | p02682 |
a,b,c,k = list(map(int,input().split()))
ans = 0
if k <= a:
print(k)
elif a<k<=b+a:
print(a)
elif b+a<k<a+b+c:
print((a-(k-a-b)))
else:
print((a-c))
| import sys
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9 + 7
input = sys.stdin.readline
def inp():
return int(eval(input()))
def inpl():
return list(map(int,input().split()))
def inpm():
return list(map(int,input().split()))
a,b,c,k = inpm()
print((min(min(k,a),2*a+b-k)))
| p02682 |
import sys
A, B, C, K = list(map(int, input().split()))
N = 0
if K - A < 0:
print(K)
sys.exit()
else:
N = A
K = K - A
if K - B < 0:
print(N)
sys.exit()
else:
K = K - B
print((N - K)) | import sys
A, B, C, K = list(map(int, input().split()))
c = 0
if K <= A:
c += K
print(c)
sys.exit()
else:
c += A
K -= A
if K <= B:
print(c)
sys.exit()
else:
K -= B
c -= K
print(c) | p02682 |
import sys
a,b,c,k = list(map(int,input().split()))
max=0
if(a==k):
print(a)
elif(c==0):
print((a%k))
else:
while(a>0 and k>0):
max+=1
a-=1
k-=1
if(k<=0):
print(max)
else:
while(b>0 and k>0):
b-=1
k-=1
if(k<=0):
print(max)
else:
while(c>0 and k>0):
max-=1
c-=1
k-=1
if(k<=0):
print(max)
| import sys
a,b,c,k = list(map(int,input().split()))
max=0
if(a==k):
print(a)
elif(a>k):
print(k)
else:
if(a<k):
max+=a
k=k-a
if(b>k):
print(max)
else:
k=k-b
if(k<=0):
print(max)
else:
if(c>=k):
max-=k
print(max)
elif(c<k):
max-=c
print(max)
| p02682 |
a, b, c, k = list(map(int, input().split()))
suma = 0
for i in range(k):
if a == 0 and b == 0:
suma = suma - k
break
elif a == 0 and c == 0:
break
elif b == 0 and c == 0:
suma = suma + k
break
if a > 0:
a = a - 1
k = k - 1
suma += 1
elif b > 0:
b = b - 1
k = k - 1
elif c > 0:
c = c - 1
k = k - 1
suma -= 1
print(suma) | a, b, c, k = list(map(int, input().split()))
suma = 0
if k > a:
if k > a + b:
if k == a + b + c:
print((a - c))
else:
k = k - (a + b)
print((a-k))
else:
print(a)
else:
print(k) | p02682 |
a, b, c, k = list(map(int, input().split()))
ans = 0
if a >= k:
ans = k
k = 0
else:
k -= a
ans = a
while k > 0:
k -= 1
if b > 0:
b -= 1
else:
c -= 1
ans -= 1
print(ans) | a, b, c, k = list(map(int, input().split()))
ans = 0
if a >= k:
ans = k
k = 0
else:
k -= a
ans = a
k -= b
if k > 0:
ans -= k
print(ans)
| p02682 |
A,B,C,K = list(map(int, input().split()))
num = 0
ans = 0
if(A == K):
print(A)
exit()
if(A+B == K):
print(A)
exit()
for i in range(0,K):
if(i < A):
ans += 1
elif(i < A+B):
ans += 0
else:
ans -= 1
print(ans) | A,B,C,K = list(map(int, input().split()))
num = 0
ans = 0
if(A >= K):
print(K)
elif(A < K and K <=(A+B)):
print(A)
else:
ans = A - (K-(A+B))
print(ans)
| p02682 |
a,b,c,k=list(map(int,input().split(" ")))
if a >= k:
print(k)
elif b >= k-a:
print(a)
else:
print((2*a+b-k)) | a,b,c,k=list(map(int,input().split()))
if a >= k:
print(k)
elif a+b < k:
print((a-(k-a-b)))
else:
print(a) | p02682 |
#!/usr/bin/env python3
import sys
def solve(A: int, B: int, C: int, K: int):
sum = 0
l = K - A
if l <= 0:
sum += K
else:
sum += A
l -= B
if l > 0:
sum -= l
print(sum)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
C = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(A, B, C, K)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
A, B, C, K = list(map(int, input().split()))
score = min(K, A) * 1
K -= A + B
if K > 0:
score -= K
print(score)
if __name__ == '__main__':
main()
| p02682 |
A,B,C,K = list(map(int, input().split()))
ans=0
if K <= A:
ans=K
elif K <= A + B :
ans=A
else:
ans= A - (K - A - B)
print(ans) | A,B,C,K = list(map(int, input().split()))
if K <= A:print(K)
elif K <= A + B :print(A)
else:print((A*2 + B - K)) | p02682 |
a,b,c,k = list(map(int,input().split()))
xa = min(a,k)
k -= xa
xb = min(b, k)
k -= xb
xc = k
print((xa-xc))
| a,b,c,k = list(map(int,input().split()))
if a+b >= k:
print((min(a,k)))
else:
print((a-(k-a-b)))
| p02682 |
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
A, B, C, K = list(map(int, read().split()))
ans = 0
ans += min(A, K)
K -= A
if K <= 0:
print(ans)
sys.exit()
K -= B
if K <= 0:
print(ans)
sys.exit()
ans -= min(C, K)
print(ans)
| import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
A, B, C, K = list(map(int, read().split()))
ans = 0
a = min(A, K)
K -= a
b = min(B, K)
K -= b
c = K
print((a - c))
| p02682 |
A, B, C, K = list(map(int, input().split()))
ct = 0
if B == 0:
if C == 0:
print(A)
exit()
for i in range(K):
if A > 0:
ct += 1
A -= 1
else:
if B > 0:
B -= 1
else:
ct -= 1
print(ct)
| A, B, C, K = list(map(int, input().split()))
if (K - A) <= 0:
print(K)
else:
if (K - A - B) <= 0:
print(A)
else:
c = (K - A - B)
print((A - c))
| p02682 |
def main():
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
dist = [[a[i][j] for j in range(n)] for i in range(n)]
total = sum([sum(a[i]) for i in range(n)])
for k in range(n):
for i in range(n):
if k==i:
continue
for j in range(n):
if i == j or k ==j:
continue
if dist[i][j] > dist[i][k] + dist[k][j]:
print((-1))
exit()
if dist[i][j] == dist[i][k] + dist[k][j]:
total -= dist[i][j]
print((total//2))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
total = sum([sum(a[i]) for i in range(n)])
for k in range(n):
for i in range(n):
if k == i:
continue
for j in range(n):
if i == j or k == j:
continue
if a[i][j] > a[i][k] + a[k][j]:
print((-1))
exit()
for i in range(n):
for j in range(n):
for k in range(n):
if i == k or j == k:
continue
if a[i][j] == a[i][k] + a[k][j]:
total -= a[i][j]
break
print((total//2))
if __name__ == '__main__':
main()
| p03602 |
N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
INF = 10 ** 9 + 1
for i in range(N):
A[i][i] = INF
ans = 0
for i in range(N):
Ai = A[i]
for j in range(i):
d = min(list(map(sum, list(zip(Ai, A[j])))))
if A[i][j] > d:
print('-1')
exit()
elif A[i][j] < d:
ans += A[i][j]
print(ans)
| N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
# Warshall-Floyd法
dist = [list(A[i]) for i in range(N)]
via = [[None for i in range(N)] for j in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
d = dist[i][k] + dist[k][j]
if dist[i][j] >= d:
dist[i][j] = d
if i != k and j != k:
via[i][j] = k
ans = 0
for i in range(N):
for j in range(i):
if dist[i][j] < A[i][j]:
ans = -1
break
if via[i][j] == None:
ans += dist[i][j]
if ans == -1:
break
print(ans)
| p03602 |
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import *
from bisect import *
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N = read()
A = []
for _ in range(N):
A.append(reads())
necc = [[True] * N for _ in range(N)]
for i, j, k in combinations(list(range(N)), 3):
a, b, c = sorted((
(A[i][j], i, j),
(A[i][k], i, k),
(A[j][k], j, k)
))
if a[0] + b[0] < c[0]:
print((-1)); exit()
elif a[0] + b[0] == c[0]:
necc[c[1]][c[2]] = False
ans = sum(A[i][j] for i, j in combinations(list(range(N)), 2) if necc[i][j])
print(ans) | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import *
from bisect import *
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N = read()
A = []
for _ in range(N):
A.append(reads())
necc = [[True] * N for _ in range(N)]
def fail():
print((-1)); exit()
for i, j, k in combinations(list(range(N)), 3):
if A[i][j] + A[j][k] < A[i][k] or A[i][j] + A[i][k] < A[j][k] or A[i][k] + A[j][k] < A[i][j]:
fail()
if A[i][j] + A[j][k] == A[i][k]:
necc[i][k] = False
if A[i][j] + A[i][k] == A[j][k]:
necc[j][k] = False
if A[i][k] + A[j][k] == A[i][j]:
necc[i][j] = False
ans = sum(A[i][j] for i, j in combinations(list(range(N)), 2) if necc[i][j])
print(ans) | p03602 |
def solve():
n = int(eval(input()))
a = []
for i in range(n):
tp = list(int(i) for i in input().split())
a.append(tp)
a2 = []
#warshall
for k in range(n):
for i in range(n):
for j in range(n):
if not k in [i,j]:
if a[i][j] > a[i][k] + a[k][j]:
#距離短縮可能
print((-1))
exit()
elif a[i][j] == a[i][k] + a[k][j]:
a2.append((i,j))
for i,j in a2:
a[i][j] = 0
ans = 0
for i in range(n):
for j in range(n):
if i < j:
ans += a[i][j]
print(ans)
solve() | import sys
input = sys.stdin.readline
def solve():
n = int(eval(input()))
a = [list(int(i) for i in input().split()) for _ in range(n)]
a2 = []
#warshall
for k in range(n):
for i in range(n):
for j in range(i+1,n):
if not k in [i,j]:
if a[i][j] > a[i][k] + a[k][j]:
#距離短縮可能
print((-1))
exit()
elif a[i][j] == a[i][k] + a[k][j]:
a2.append((i,j))
for i,j in a2:
a[i][j] = 0
ans = 0
for i in range(n):
for j in range(i+1,n):
ans += a[i][j]
print(ans)
solve() | p03602 |
while True:
n = int(eval(input()))
if not n:
break
ss = [s for s in input()[::-1]]
for i in range(n):
new = []
app = new.append
last = ss.pop()
count = 1
while ss:
a = ss.pop()
if a == last:
count += 1
else:
app(str(count))
app(last)
last = a
count = 1
app(str(count))
app(last)
new = "".join(new)
ss = [s for s in new[::-1]]
# print("".join(new))
print(("".join(new)))
| def main():
while True:
n = int(eval(input()))
if not n:
break
ss = [s for s in input()[::-1]]
for i in range(n):
new = []
app = new.append
last = ss.pop()
count = 1
while ss:
a = ss.pop()
if a == last:
count += 1
else:
app(str(count))
app(last)
last = a
count = 1
app(str(count))
app(last)
new = "".join(new)
ss = [s for s in new[::-1]]
# print("".join(new))
print(("".join(new)))
main()
| p00429 |
def f(a):
ans = ""
s = a[0]
c = 1
for i in range(1,len(a)):
if a[i] == s:
c += 1
else:
ans += str(c) + s
s = a[i]
c = 1
ans += str(c) + s
return ans
while 1:
n = eval(input())
if n == 0: break
a = input()
for i in range(n):
a = f(a)
print(a) | def f(a,n):
for j in range(n):
aa = ""
s = a[0]
c = 1
for i in range(1,len(a)):
if a[i] == s:
c += 1
else:
aa += str(c) + s
s = a[i]
c = 1
a = aa + str(c) + s
return a
while 1:
n = eval(input())
if n == 0: break
a = input()
print(f(a,n)) | p00429 |
import itertools
import math
N = int(eval(input()))
P = int(''.join(input().split()))
Q = int(''.join(input().split()))
N_list = []
for i in itertools.permutations(list(range(1,N+1))):
N_list.append(int(''.join([str(x) for x in i])))
pointer1 = 0
pointer2 = 0
for i,x in enumerate(N_list):
if x == P:
pointer1 = i
if x == Q:
pointer2 = i
print((abs(pointer1 - pointer2))) | import itertools
n = int(eval(input()))
p = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
a,b = 0,0
for i,x in enumerate(itertools.permutations(list(range(1,n+1)))):
if list(x) == p:
a = i
if list(x) == q:
b = i
print((abs(a-b))) | p02813 |
import itertools
n=int(eval(input()))
p=list(map(int,input().split()))
q=list(map(int,input().split()))
d=[]
k=0
s=0
a=0
b=0
nums = list(range(1,n+1))
d= [ list(balls) for balls in itertools.permutations(nums, n)]
for i in d:
k+=1
s+=1
if i==p:
a=s
if i==q:
b=k
print((abs(a-b)))
| import itertools
n=int(eval(input()))
p=list(map(int,input().split()))
q=list(map(int,input().split()))
nums = list(range(1,n+1))
d= [ list(i) for i in itertools.permutations(nums)]
a=0
b=0
for i in range(len(d)):
if p==d[i]:
a=i
if q==d[i]:
b=i
print((abs(a-b))) | p02813 |
# -*- coding: utf-8 -*-
from itertools import permutations as perm
N = int(eval(input()))
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
a = 0
b = 0
for Pi in sorted(perm(P)):
if P != Pi:
a += 1
if P == Pi:
a += 1
break
for Qi in sorted(perm(Q)):
if Q != Qi:
b += 1
if Q == Qi:
b += 1
break
print((abs(a-b))) | # -*- coding: utf-8 -*-
from itertools import permutations as p
N = int(eval(input()))
A = [i for i in range(1, N+1)]
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
cntp = 1
cntq = 1
for i in sorted(p(A)):
if i != P:
cntp += 1
if i == P:
cntp += 1
break
for i in sorted(p(A)):
if i != Q:
cntq += 1
if i == Q:
cntq += 1
break
print((abs(cntp-cntq))) | p02813 |
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())
XLMIIS = lambda x : [LMIIS() for _ in range(x)]
N = II()
P = input().replace(' ','')
Q = input().replace(' ','')
kouho = set(range(1,N+1))
def kaijo(n):
ans = 1
for i in range(1,n+1):
ans *= i
return ans
numbers = [0] * kaijo(N)
# print(len(numbers))
from copy import copy
def mkp(kouho,i,p):
if i == N-1:
numbers.append(p+kouho[0])
return
for j in range(len(kouho)):
kouho2 = copy(kouho)
kouho2.remove(kouho[j])
mkp(kouho2,i+1,p+kouho[j])
mkp(list(map(str,range(1,N+1))),0,'')
numbers = numbers[kaijo(N):]
print(abs(numbers.index(P)-numbers.index(Q)))
if __name__ == '__main__':
main()
| #coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())
XLMIIS = lambda x : [LMIIS() for _ in range(x)]
N = II()
P = LMIIS()
Q = LMIIS()
from math import factorial
def index(P):
candidates = list(range(1,N+1))
ans = 0
for i in range(N-1):
ans += candidates.index(P[i]) * factorial(N-1-i)
candidates.remove(P[i])
return ans + 1
print(abs(index(P)-index(Q)))
if __name__ == '__main__':
main()
| p02813 |
from itertools import permutations
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
iP = -1
iQ = -1
for idx, perm in enumerate(permutations(list(range(1, N+1)))):
lp = list(perm)
if lp == P:
iP = idx
if lp == Q:
iQ = idx
print((abs(iP - iQ))) | from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
iP, iQ = None, None
for idx, perm in enumerate(permutations(list(range(1, N + 1)))):
if perm == P:
iP = idx
if perm == Q:
iQ = idx
print((abs(iP - iQ))) | p02813 |
# ABC150C - Count Order
from itertools import permutations
def main():
N, *PQ = list(map(int, open(0).read().split()))
P, Q = PQ[:N], PQ[N:]
a, b = 0, 0
for i, perm in enumerate(permutations(list(range(1, N + 1)), N), 1):
perm = list(perm)
if perm == P:
a = i
if perm == Q:
b = i
ans = abs(a - b)
print(ans)
if __name__ == "__main__":
main()
| # ABC150C - Count Order
from itertools import permutations
def main():
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = list(permutations(list(range(1, N + 1))))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| p02813 |
import itertools
if __name__ == '__main__':
# P and Q are both rearrangements of (1, 2, ..., N)).
# N! possible permutations of size N
# among them, let P and Q be the a-th and the b-th
n = int(eval(input()))
p = input().split(' ')
q = input().split(' ')
for i in range(0, len(q)):
p[i] = int(p[i])
q[i] = int(q[i])
realnums = p.copy()
realnums.sort()
perm = list(itertools.permutations(realnums))
it = 0
qplace = 0
pplace = 0
for i in perm:
if list(i) == q:
qplace = it
if list(i) == p:
pplace = it
it += 1
print((abs(qplace - pplace))) | import itertools
if __name__ == '__main__':
# P and Q are both rearrangements of (1, 2, ..., N)).
# N! possible permutations of size N
# among them, let P and Q be the a-th and the b-th
n = int(eval(input()))
p = list(map(int, input().split(' ')))
q = list(map(int, input().split(' ')))
realnums = p.copy()
realnums.sort()
perm = list(map(list, itertools.permutations(realnums)))
print((abs(perm.index(q) - perm.index(p)))) | p02813 |
import itertools
(n,),p,q=[tuple(map(int, i.split())) for i in open(0)]
j=list(itertools.permutations(list(range(1, -~n))))
print((abs(j.index(p) - j.index(q)))) | import math
(n,),p,q=[list(map(int, i.split())) for i in open(0)]
def c(l):
s=0
t=list(range(1,n+1))
for i in range(n):
s+=t.index(l[i])*math.factorial(n-i-1)
t.remove(l[i])
return s
print((abs(c(p)-c(q)))) | p02813 |
import itertools
def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
l = [i for i in range(1, N+1)]
l = list(itertools.permutations(l))
a = 0
for k, v in enumerate(l):
if A == list(v):
a = k+1
b = 0
for k, v in enumerate(l):
if B == list(v):
b = k+1
return abs(a-b)
print((solve())) | import itertools
def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
l = [i for i in range(1, N+1)]
l = list(itertools.permutations(l))
a = 0
b = 0
for k, v in enumerate(l):
v = list(v)
if v == A:
a = k+1
if v == B:
b = k+1
return abs(a-b)
print((solve())) | p02813 |
import itertools
N=int(eval(input()))
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
list_a = list(range(1,N+1))
tuple_a = tuple(list_a)
ptr = list(itertools.permutations(tuple_a))
ptr_num = len(list(itertools.permutations(tuple_a)))
for i in range(0,ptr_num):
if ptr[i] == tuple(P):
P_num=i+1
if ptr[i] == tuple(Q):
Q_num=i+1
print((abs(P_num-Q_num)))
| import itertools
n=int(eval(input()))
p=tuple(map(int,input().split()))
q=tuple(map(int,input().split()))
jyunretsu=list(itertools.permutations(list(range(1,n+1))))
print((abs(jyunretsu.index(p)-jyunretsu.index(q)))) | p02813 |
import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
pp = "".join((str(n) for n in p))
q = list(map(int, input().split()))
qq = "".join((str(n) for n in q))
a = [i+1 for i in range(n)]
b = 0
c = 0
d = 0
for i in itertools.permutations(a):
d += 1
x = "".join((str(n) for n in i))
if pp == x:
b = d
if qq == x:
c = d
print((abs(b-c))) | import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
pp = "".join([str(i) for i in p])
q = list(map(int, input().split()))
qq = "".join([str(i) for i in q])
x = [i+1 for i in range(n)]
z = []
for v in itertools.permutations(x):
y = "".join([str(i) for i in v])
z.append(y)
a = z.index(pp)
b = z.index(qq)
print((abs(a-b))) | p02813 |
# coding UTF-8
#
# problem C
#
import itertools
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
seq = tuple(range(1,N+1))
seqlist = list(itertools.permutations(seq))
#print(seqlist)
#print(seqlist.index(P))
#print(seqlist.index(Q))
print((abs(seqlist.index(P)-abs(seqlist.index(Q)))))
| import sys
import itertools
readline = sys.stdin.readline
def main():
N = int(eval(input()))
P = tuple(map(int, readline().split()))
Q = tuple(map(int, readline().split()))
dictN = list(itertools.permutations(list(range(1, N+1))))
p = dictN.index(P)
q = dictN.index(Q)
ans = abs(p-q)
print(ans)
if __name__ == "__main__":
main()
| p02813 |
r = int(eval(input()))
tp = tuple(map(int,input().split()))
tq = tuple(map(int,input().split()))
import itertools
p, q = 0, 0
for i, ti in enumerate(itertools.permutations(list(range(1,r+1)))):
if tp == ti:
p = i
if tq == ti:
q = i
if p * q > 0:
break
print((abs(p-q))) | n = int(eval(input()))
tp = tuple(map(int, input().split()))
tq = tuple(map(int, input().split()))
import itertools as it
l = list(it.permutations(list(range(1, n+1))))
print((abs(l.index(tp) - l.index(tq)))) | p02813 |
n = int(eval(input()))
tp = tuple(map(int, input().split()))
tq = tuple(map(int, input().split()))
import itertools as it
l = list(it.permutations(list(range(1, n+1))))
print((abs(l.index(tp) - l.index(tq)))) | f=lambda:tuple(map(int,input().split()))
n=int(eval(input()))
tp,tq=f(),f()
import itertools as it
l=list(it.permutations(list(range(1,n+1))))
print((abs(l.index(tp)-l.index(tq)))) | p02813 |
n=int(eval(input()))
from itertools import *
p=[*permutations(list(range(1,n+1)))]
f=lambda:p.index(tuple(map(int,input().split())))
print((abs(f()-f()))) | f=lambda:tuple(map(int,input().split()))
n=f()[0]
from itertools import *
p=[*permutations(list(range(1,n+1)))].index
print((abs(p(f())-p(f())))) | p02813 |
import itertools
n=int(eval(input()))
p=tuple(map(int,input().split()))
q=tuple(map(int,input().split()))
arrs=list(itertools.permutations(list(range(1,n+1))))
cnt1=0
cnt2=0
for i in range(len(arrs)):
if arrs[i]==p:
cnt1=i
if arrs[i]==q:
cnt2=i
print((abs(cnt2-cnt1))) | def fact(n):
ret=1
for i in range(2,n+1):
ret=ret*i
return ret
n=int(eval(input()))
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
cnt1=0
cnt2=0
checked1=[0]*(n+1)
checked2=[0]*(n+1)
for i in range(n):
checked1[arr1[i]]=1
checked2[arr2[i]]=1
cnt1+=(arr1[i]-1-sum(checked1[:arr1[i]]))*fact(n-i-1)
cnt2+=(arr2[i]-1-sum(checked2[:arr2[i]]))*fact(n-i-1)
print((abs(cnt1-cnt2))) | p02813 |
import itertools
N = int(eval(input()))
NL = [str(i) for i in range(1,N+1)]
P = input().replace(' ', '')
Q = input().replace(' ', '')
NLL = sorted(list(itertools.permutations(NL,N)))
a = 0
b = 0
for i in range(len(NLL)):
if ''.join(list(NLL[i])) == P:
a = i+1
if ''.join(list(NLL[i])) == Q:
b = i+1
print((abs(a-b))) | import itertools
import math
N = int(eval(input()))
P = ''.join(input().split())
Q = ''.join(input().split())
np = sorted(list([''.join(x) for x in itertools.permutations([str(i+1) for i in range(N)])]))
print((abs((np.index(P)+1)-(np.index(Q)+1)))) | p02813 |
import itertools
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
l = []
c = []
ls = []
for i in range(N):
l.append(i + 1)
c.append(0)
# 重複なしのあらゆる並び
l = list(map(list, itertools.permutations(l)))
print((abs(l.index(P) - l.index(Q))))
| import itertools
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
l = []
for i in range(N):
l.append(i + 1)
# 重複なしのあらゆる並び(itertools.permutations)
l = list(map(list, itertools.permutations(l)))
print((abs(l.index(P) - l.index(Q))))
| p02813 |
import itertools
n = int(eval(input()))
l = sorted(list(itertools.permutations([i for i in range(1,n+1)])))
al = tuple([int(i) for i in input().split()])
bl = tuple([int(i) for i in input().split()])
a,b = 0,0
if al == bl:
print((0))
else:
for idx,i in enumerate(l):
if i == al:
a = idx
elif i == bl:
b = idx
else:
pass
print((abs(a-b))) | import itertools
n = int(eval(input()))
pl = tuple([int(i) for i in input().split()])
ql = tuple([int(i) for i in input().split()])
all_list = list(itertools.permutations(list(range(1,n+1))))
print((abs(all_list.index(pl) - all_list.index(ql))))
| p02813 |
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
t = [0]*8
t[1] = 1
for i in range(2,n):
t[i] = i * t[i - 1]
a = 0
l = list(range(1, n+1))
for i in range(n):
a += l.index(p[i]) * t[len(l) - 1]
l.remove(p[i])
b = 0
l = list(range(1, n+1))
for i in range(n):
b += l.index(q[i]) * t[len(l) - 1]
l.remove(q[i])
print((abs(a - b))) | n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
s = [0]*(n+1)
s[1] = 1
for i in range(2, n+1):
s[i] = s[i-1]*i
x = 0
l = [i for i in range(1, n+1)]
for i in p:
x += l.index(i) * s[len(l) - 1]
l.remove(i)
y = 0
l = [i for i in range(1, n+1)]
for i in q:
y += l.index(i) * s[len(l) - 1]
l.remove(i)
print((abs(x-y))) | p02813 |
from itertools import permutations
n = int(eval(input()))
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
t = 0
x = 0
y = 0
for i in permutations(list(range(1,n+1)),n):
t += 1
if i == p: x = t
if i == q: y = t
print((abs(x-y))) | from itertools import permutations
n = int(eval(input()))
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
nums = list(permutations(list(range(1,n+1)), n))
print((abs(nums.index(q) - nums.index(p)))) | p02813 |
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
import itertools
per = list(itertools.permutations(list(range(1, N+1))))
p = -1
q = -1
for i in range(len(per)):
if P == list(per[i]):
p = i
if Q == list(per[i]):
q = i
print((abs(p - q))) | N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
import itertools
per = list(itertools.permutations(list(range(1, N+1))))
p = 0
q = 0
for i in range(len(per)):
if P == list(per[i]):
p = i
if Q == list(per[i]):
q = i
print((abs(p - q))) | p02813 |
import itertools
n = int(eval(input()))
a = tuple(map(int, input().split()))
b = tuple(map(int, input().split()))
l = list(itertools.permutations(list(range(1,n+1))))
print((abs(l.index(a) - l.index(b))))
| import itertools
n = int(eval(input()))
a = tuple([int(i) for i in input().split()])
b = tuple([int(i) for i in input().split()])
l = list(itertools.permutations(list(range(1,n+1))))
print((abs(l.index(a) - l.index(b))))
| p02813 |
from collections import deque
N = int(eval(input()))
P = [int(x) for x in input().split()]
Q = [int(x) for x in input().split()]
st = deque([[i] for i in range(N, 0, -1)])
ord = 0
a = 0
b = 0
while(len(st) > 0):
if a > 0 and b > 0: break
now = st.pop()
if len(now) == N:
ord += 1
if P == now:
a = ord
if Q == now:
b = ord
for i in range(N, 0, -1):
if i in now: continue
st.append(now + [i])
print((abs(b - a))) | from itertools import permutations
N = int(eval(input()))
P = tuple(int(x) for x in input().split())
Q = tuple(int(x) for x in input().split())
perm = list(permutations(list(range(1, N + 1)), N))
i = 0
a = 0; b = 0;
for i in range(len(perm)):
if a > 0 and b > 0: break
if perm[i] == P: a = i + 1
if perm[i] == Q: b = i + 1
print((abs(b - a))) | p02813 |
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
import itertools
X = list(itertools.permutations(list(range(1,N+1)),N))
for i in range(len(X)):
x = X[i]
if P == x:
a = i
if Q == x:
b = i
print((abs(a-b))) | N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
import itertools
X = list(itertools.permutations(list(range(1,N+1)),N))
print((abs(X.index(Q)-X.index(P)))) | p02813 |
def dfs(res, chk):
if len(res) == n:
global idx
global pi
global qi
idx += 1
pb = all(res[i]+1 == p for i, p in enumerate(P))
qb = all(res[i]+1 == q for i, q in enumerate(Q))
if pb:
pi = idx
if qb:
qi = idx
return
for i in range(n):
if chk & (1 << i):
continue
else:
dfs(res + [i], chk^(1 << i))
n = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
idx = 0
pi = qi = 0
perm = []
dfs([], 0)
print((abs(pi-qi))) | # AtCoder Beginner Contest 150
# C - Count Order
# https://atcoder.jp/contests/abc150/tasks/abc150_c
from itertools import permutations
N = int(eval(input()))
P = tuple(i-1 for i in map(int, input().split()))
Q = tuple(i-1 for i in map(int, input().split()))
F = list(permutations(list(range(N))))
print((abs(F.index(P) - F.index(Q))))
| p02813 |
n=int(eval(input()))
p=list(map(int,input().split()))
q=list(map(int,input().split()))
from itertools import permutations
for i,j in enumerate(permutations([i+1 for i in range(n)],n)):
if p==list(j):a=i
if q==list(j):b=i
print((abs(a-b))) | n=int(eval(input()))
p=tuple(map(int,input().split()))
q=tuple(map(int,input().split()))
from itertools import permutations
for i,x in enumerate(permutations([i+1 for i in range(n)],n)):
if x==p:a=i
if x==q:b=i
print((abs(a-b))) | p02813 |
n = int(eval(input()))
#a,b = map(int,input().split())
L1 = tuple(map(int,input().split()))
L2 = tuple(map(int,input().split()))
L = [x+1 for x in range(n)]
li = []
import itertools
for x in itertools.permutations(L,n):
#print(x)
li.append(x)
#print(li)
print((abs(li.index(L1)-li.index(L2)))) | n = int(eval(input()))
a = tuple(map(int,input().split()))
b = tuple(map(int,input().split()))
l = tuple(x+1 for x in range(n))
#print(a,b,l)
c,d = 0,0
cnt = 0
from itertools import permutations
for k in permutations(l):
#print(k)
cnt += 1
if a ==k:
c = cnt
if b ==k:
d = cnt
print((abs(c-d))) | p02813 |
import sys
from itertools import permutations
n = int(sys.stdin.readline().rstrip())
p, q = [tuple(map(int, sys.stdin.readline().split())) for _ in range(2)]
def main():
perms = list(permutations(list(range(1, n+1))))
return abs(perms.index(p) - perms.index(q))
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n = int(sys.stdin.readline().rstrip())
*p, = list(map(int, sys.stdin.readline().split()))
*q, = list(map(int, sys.stdin.readline().split()))
factorial = [1] * (n + 1)
for i in range(n): factorial[i+1] = factorial[i] * (i + 1)
def main():
d = 0
a = [0] * (n + 1); b = [0] * (n + 1)
for i in range(n - 1):
a[p[i]] = b[q[i]] = 1
c1 = c2 = 0
for j in range(1, p[i]): c1 += a[j]
for j in range(1, q[i]): c2 += b[j]
d += ((q[i] - c2) - (p[i] - c1)) * factorial[n-(i+1)]
print((abs(d)))
if __name__ == '__main__':
main() | p02813 |
import itertools
n = int(eval(input()))
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
# 多分1~4で3!の順列になる
ls = list(itertools.permutations(list(range(1,n+1)))) #順列生成
# 絶対値absで辞書順のpからqをひく
print((abs(ls.index(p)-ls.index(q)))) | N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
fac = [0] * 8
# 1番目の桁
fac[1] = 1
for i in range(2, N):
# 最上位の桁が7の場合7!の6周目終わりが30240番目が先頭になる。
fac[i] = i * fac[i - 1]
a = 0
l = list(range(1, N + 1))
# l=3の時fac[2] 2!の2周目終わった時点え次のスタートが5になる
# 5の1番目のルートとなる
for i in range(N):
a += l.index(P[i]) * fac[len(l) - 1]
l.remove(P[i])
b = 0
l = list(range(1, N + 1))
for i in range(N):
b += l.index(Q[i]) * fac[len(l) - 1]
l.remove(Q[i])
print((abs(a - b))) | p02813 |
from itertools import permutations
N = int(eval(input()))
P = "".join(list(input().split()))
Q = "".join(list(input().split()))
#print("P:", P)
A = ""
for i in range(1, N + 1):
A += str(i)
A = list(permutations(A, N))
A.sort()
#print("A:", A)
B = []
for i in range(len(A)):
B.append("".join(A[i]))
for i in range(len(B)):
if P == B[i]:
a = i
if Q == B[i]:
b = i
print((abs(a-b))) | from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
A = list(permutations(list(range(1, N + 1))))
#print("A:", A)
print((abs((A.index(P) - A.index(Q))))) | p02813 |
from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
A = list(permutations(list(range(1, N + 1))))
#print("A:", A)
print((abs((A.index(P) - A.index(Q))))) | from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
D = list(permutations(list(range(1, N + 1))))
print((abs(D.index(P) - D.index(Q)))) | p02813 |
from itertools import permutations
N = int(eval(input()))
Ps = list(map(int, input().split()))
Qs = list(map(int, input().split()))
for i, Rs in enumerate(permutations(list(range(1, N+1))), 1):
Rs = list(Rs)
if Ps == Rs:
a = i
if Qs == Rs:
b = i
print((abs(a-b)))
| from itertools import permutations
N = int(eval(input()))
Ps = tuple(map(int, input().split()))
Qs = tuple(map(int, input().split()))
noP, noQ = 0, 0
for no, Rs in enumerate(permutations(list(range(1, N+1)), r=N), start=1):
if Ps == Rs:
noP = no
if Qs == Rs:
noQ = no
print((abs(noP-noQ)))
| p02813 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.