source string | code string | inputs string | outputs string | metadata string |
|---|---|---|---|---|
google_code_jam | def func(lst):
cnt = 0
for i in range(len(lst)-1):
j = lst.index(min(lst[i:]))
lst[i:j+1] = lst[i:j+1][::-1]
cnt += (j-i+1)
return cnt
for t in range(int(input())):
input()
lst = list(map(int,input().split()))
print(f'Case #{t+1}: {func(lst)}') | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def func(lst):
cnt = 0
for i in range(len(lst)-1):
j = lst.index(min(lst[i:]))
lst[i:j+1] = lst[i:j+1][::-1]
cnt += (j-i+1)
return cnt
for t in range(int(input())):
input()
lst = list(map(int,input().split()))
print(f'Case #{t+1}: {func(lst)}') | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def reverseSort(L):
mini = 1000000000
retVal = 0
for i in range(0,len(L)-1):
j = L.index(min(L[i:])) + 1
L = L[:i] + (L[i:j][::-1]) + L[j:]
retVal += j - i
return retVal
T = int(input())
for i in range(T):
N = int(input())
L = list(map(int, input().rstrip().split()))
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def rev_sort(N, L):
sorted_list = sorted(L)
indexes = [sorted_list.index(x) for x in L]
res = 0
for i in range(N - 1): # no need to reverse last elem
# distance from i to index of value i in indexes
#print(indexes)
pos = indexes.index(i, i) # start from i, since [0, i) are alread... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | iteration = 0
T = int(input())
for i in range(T):
iteration = 0
N = input()
v = [int(x) for x in input().split(" ")]
for z in range(0,len(v)-1):
j = v.index(min(v[z:len(v)]))
v = v[0:z] + list(reversed(v[z:j+1])) + v[j+1:len(v)]
#print("{} {} {}".format( v[0:i] , list(reversed(v[... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def reverse(seq, start, stop):
size = stop + start
for i in range(start, (size + 1) // 2 ):
j = size - i
seq[i], seq[j] = seq[j], seq[i]
t = int(input())
for test in range(1, t+1):
n = int(input())
dlzka = 0
case = [int(s) for s in input().split(" ")]
for i in range(n):
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | #!/usr/bin/env python3
import sys
import numpy as np
def compute(lst):
lst = np.array(lst)
costcounter = 0
N = len(lst)
for i in range(len(lst) - 1):
j = lst.argmin()
if (i < j):
lst[i:j + 1] = lst[i:j + 1][::-1]
lst[i] = N + 1
costcounter += j - i + 1
r... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | for case in range(int(input())):
n = int(input())
arr = list(map(int, input().split()))
mysum = 0
for i in range(n - 1):
jval = arr[i]
j = i
for k in range(i, n):
if arr[k] < jval:
jval = arr[k]
j = k
revarr = []
for k i... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | #!/usr/bin/env python3
import sys
def solve(*args):
(N,) = args
N = int(N)
L = list(map(int, sys.stdin.readline().strip().split(" ")))
length = len(L)
cost = 0
for i in range(1, length):
j = L.index(min(L[i-1:])) + 1
L = L[:i-1] + list(reversed(L[i-1:j])) + L[j:]
cost +... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def rev(L, i, j):
# end = i + (j-i+0.5)/2
end = i + int((j-i)/2 + 0.5)
for ri in range(i, int(end)):
t = L[ri]
L[ri] = L[i+j-ri]
L[i+j-ri] = t
T = int(input())
for c_nr in range(T):
N = int(input())
L = input()
L = [int(e) for e in L.split()]
if len(L) == 1:
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | import logging
logging.basicConfig(level=logging.DEBUG, format='%(asctime)s - %(levelname)s - %(message)s')
def computeCost(L):
cost = 0
for i in range(len(L) - 1):
j = L.index(min(L[i:]))
cost += j - i + 1
L = L[:i] + (L[j:i-1:-1] if i > 0 else L[j::-1]) + L[j+1:]
logging.debug... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | from sys import stdin
def readline():
return stdin.readline().strip()
def reverse(arr, i, j):
for h in range((j - i + 1) // 2):
arr[i + h], arr[j - h] = arr[j - h], arr[i + h]
t = int(readline())
for t_i in range(t):
n = int(readline())
arr = list(map(int, readline().split()))
cost = 0... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam |
def compute(arr):
ops = 0
# print(arr)
for i in range(len(arr)-1):
arr_slice = arr[i:]
arr_slice = arr_slice[:arr_slice.index(min(arr_slice))+1]
arr[i:i+len(arr_slice)] = arr_slice[::-1]
# print(arr)
ops += len(arr_slice)
return ops
if __name__ == '__main... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | import sys
totalCase = 0
arrayLength = 0
case = 1
for line in sys.stdin:
if totalCase == 0:
totalCase = int(line)
elif arrayLength == 0:
arrayLength = int(line)
else:
print("Case #%d: " % case, end="")
array = list(map(int, line.split(" ")))
#print(array)
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def revSort(a):
co = []
for i in range(len(a)):
j = a.index(min(a[i:]))
x = a[i:j + 1]
x = x[::-1]
x = a[:i] + x + a[j + 1:]
a = x.copy()
co.append(j - i + 1)
return sum(co)
te = int(input())
for t in range(te):
n = int(input())
l = list... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | sum_cost = 0
def partial_reverse(lst, b, e):
global sum_cost
sum_cost = sum_cost + e-b
lst[b:e] = lst[b:e][::-1]
return lst
def reversort(lst):
size = len(lst)
for i in range(0, size-1):
j = lst.index(min(lst[i:size+1]))
lst = partial_reverse(lst, i, j+1)
return case
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def reverse_sort(lst):
result = 0
for loc in range(0, len(lst) - 1):
min_index = lst.index(min(lst[loc:]))
if min_index != loc:
lst = lst[0:loc] + lst[loc:min_index+1][::-1] + lst[min_index+1:]
result += ((min_index + 1) - (loc + 1) + 1)
ret... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | T = int(input())
for t in range(T):
N = int(input())
arr = [0]*N
elementString = input()
elements = elementString.split(' ')
for i in range(N):
arr[i] = int(elements[i])
ans = 0
for i in range(N-1):
mn = N+1
index = None
for j in range(i, N):
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam |
def revsort(N, L):
cost = 0
for i in range(N-1):
c = L[i:].index(min(L[i:]))+1
L = L[:i] + list(reversed(L[i:i+c])) + L[i+c:]
cost += c
return cost
T = int(input())
for x in range(1, T+1):
N = int(input())
L = list(map(int, input().split()))
cost = revsort(N, L)
pri... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def Reversort(L,n):
cost=0
for i in range(n):
try:
j=L.index(min(L[i:]))
tl = list(reversed(L[i:j+1]))
L=L[:i] + tl + L[j+1:]
except:
pass
cost+=(j-i+1)
return cost
ans=[]
j=1
for i in range(int(input())):
n=int(in... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def solve(lst):
n = len(lst)
total = 0
for i in range(n - 1):
j = lst.index(min(lst[i:]))
lst[i:j + 1] = lst[i:j + 1][::-1]
total += j - i + 1
return total
T = int(input())
for i in range(1, T + 1):
n = int(input())
lst = [int(x) for x in input().split()] ... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def sol(arr):
n = len(arr)
res = 0
for i in range(n-1):
_, p = min((x,j) for j,x in enumerate(arr[i:]))
p += i
arr[i:p+1] = reversed(arr[i:p+1])
res += (p-i)+1
return res
def main():
tt = int(input())
for t in range(tt):
_n = input()
arr = [int(x)... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | from sys import stdin
test_lines = stdin.readlines()
num_tests = int(test_lines[0].strip())
def min_index(l):
best = 0
best_val = l[0]
for i in range(1, len(l)):
if l[i] < best_val:
best_val = l[i]
best = i
return best
def calc(l):
result = 0
while len(l) > 1:... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | t=int(input())
for q in range(t):
n=int(input())
a = [int(i) for i in input().split()][:n]
#print(a)
cost=0
for i in range(n-1):
sl=a[i:n]
#print(sl,end=" ")
ji=min(sl)
#print(ji,end=" ")
j=a.index(ji)
a[i:j+1] = reversed(a[i:j+1])
#print(a)
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | import copy
from sys import stdin, stdout, stderr, argv
from collections import deque
import heapq
import time
def get_array_int():
return list(map(int, infile.readline().strip().split()))
def get_int_as_array():
return [int(x) for x in infile.readline().strip()]
def get_array_tuple():
return tuple(ma... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def solve(t,n):
count = 0
for i in range(n-1):
m = i
for j in range(i+1,n):
if l[j] < l[m]:
m = j
if m !=i:
t = rev(t,i,m)
count+=m-i+1
else:
count +=1
return count
def rev(l,i,n):
k = (n-i+1)//2
for j in range(k):
l[j+i],l[n-j] = l[n-j],l[j+i]
return l
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def Reversort(L):
cost = 0
for i in range (len(L) - 1):
j = L.index(min(L[i:]))
cost += len(L[i:j+1])
# print (L)
L = L[:i] + L[i:j+1][::-1] + L[j+1:]
# print (L)
return cost
answers = []
for _ in range(int(input())):
N = int(input())
L = [int(i) for i ... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def cost(l):
total = 0
for i in range(len(l) - 1):
j = min(range(i, len(l)), key = lambda x: l[x])
total += j - i + 1
l[i : j + 1] = list(reversed(l[i : j + 1]))
return total
t = int(input())
for i in range(1, t + 1):
n = int(input())
l = [int(w) for w in input().split()]
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | cases = int(input())
for case in range(1, cases+1):
input()
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + min(range(len(arr[i:])), key=arr[i:].__getitem__)
ans += j-i + 1
arr[i:j+1] = reversed(arr[i:j+1])
print(f"Case #{case}: {ans-1}")
| ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def Solution(arr_s):
le = len(arr_s)
min_val = 0
if(le == 1):
return 0
arr = [i for i in arr_s]
arr_s.sort()
min_val = arr_s[0]
pos = arr.index(min_val)
if(pos != le-1):
temp = [i for i in arr[:pos+1]]
temp.reverse()
arr = temp+arr[pos+1:]
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def Reversort(L, count):
cost = 0
for i in range(len(L) - 1):
sublst = L[i:count]
j = L.index(min(sublst))
L[i:j+1] = reversed(L[i:j+1])
cost += (j-i) + 1
return cost
for x in range(int(input())):
count = int(input())
list_d = list(map(int, input().split()))
cos... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def reverse(L, y, j):
for i in range((j - y) // 2 + 1):
a = L[y + i]
L[y + i] = L[j - i]
L[j - i] = a
return L
def reversort(L):
O = 0
for i in range(len(L) - 1):
minind = -1
minval = len(L) + 1
for k in range(i, len(L)):
if L[k] < minval:
... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | testCases = int(input())
def getReversed(arr, i, j):
newArr = arr[:i]
for ind in range(j,i-1,-1):
newArr.append(arr[ind])
for ind in range(j+1, len(arr)):
newArr.append(arr[ind])
return newArr
def getMin(arr, i):
minEle = i
for ind in range(i+1, len(arr)):
if arr[minEle] ... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | f=int(input())
for k in range(1,f+1):
count=0
h=int(input())
c=list(map(int,input().split()))
for i in range(0,h-1):
min =c[i]
p=i
for j in range(i,h):
if c[j]<min:
min=c[j]
p=j
c[i:p+1]=reversed(c[i:p+1])
count+=(p-i+1)... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def rev(arr, i, j):
while i < j:
arr[i], arr[j] = arr[j], arr[i]
i += 1
j -= 1
def solve(arr, n):
cost = 0
for i in range(n - 1):
ind = arr.index(i + 1)
rev(arr, i, ind)
cost += ind - i + 1
return cost
test_cases = int(input()... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | t = int(input())
for _ in range(t):
n = int(input())
L = list(map(int,input().split()))
ans = 0
for i in range(n-1):
for j in range(i,n):
if L[j] == i+1:
L[i:j+1] = L[i:j+1][::-1]
ans += j-i+1
#print('cost of '+str(i)+'=', j-i+1)
#p... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | t = int(input())
for i_t in range(1,t+1):
n = int(input())
a = [int(tmp) for tmp in input().split(" ")]
cost = 0
for idx in range(1,n):
min_idx = a.index(idx)
cost += min_idx-idx+2
a[idx-1:min_idx+1] = a[idx-1:min_idx+1][::-1]
print('Case #{}: {}'.format(i_t,cost)) | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | t = int(input())
t1= 1
while(t1 <= t):
n = int(input())
l = list(map(int,input().split()))
c = 0
def findminvalpos(i):
m = min(l[i:n])
for j in range(i,n):
if l[j] == m:
return j
def rev(i,j):
global c
t = l[i:j][::-1]
c = c + le... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | #!/usr/bin/python3
total = input()
data = []
data.append(total)
T = int(total)
for i in range(int(total)*2):
data.append(input())
i=0
j=0
k=0
for i in range(T):
N = int(data[2*i+1])
cost = 0
elements = []
elements = data[2*(i+1)].split()
elements = [int(x) for x in elements]
for j in ra... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | def reversort(lst):
costs = []
for i in range(len(lst) - 1):
j = lst.index(min(lst[i:]))
lst = reverse(lst, i, j)
iteration_cost = j - i + 1
costs.append(iteration_cost)
return costs
def reverse(lst, i, j):
a = lst[i:j + 1]
a.reverse()
return lst[:i]... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | #!/usr/bin/env python
# -*- coding: UTF-8 -*-
if __name__ == '__main__':
T = int(input())
for caseNr in range(1, T + 1):
N = int(input())
L = [int(x) for x in input().split(' ')]
cost = 0
# print(N)
# print(L)
for i in range(N - 1):
min_value = m... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
google_code_jam | N = int(input())
def read_instance():
_ = input()
numbers = list(map(int, input().split()))
return numbers
def reverse(numbers):
return numbers[::-1]
def solve(instance):
k = len(instance)
cost = 0
for i, idx in enumerate(range(k-1), 1):
idx_of_i = instance.index(i)
sublis... | ['3\n4\n4 2 1 3\n2\n1 2\n7\n7 6 5 4 3 2 1\n', '100\n71\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 71 69 67 65 63 61 59 57 55 53 51 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1\n3\n2 3 1\n18\n10 3 6 8 7 1 5 4 2 9 11 12 14 13 15 16 17 18\... | ['Case #1: 6\nCase #2: 1\nCase #3: 12', 'Case #1: 2555\nCase #2: 5\nCase #3: 39\nCase #4: 2664\nCase #5: 40\nCase #6: 508\nCase #7: 2146\nCase #8: 2446\nCase #9: 2637\nCase #10: 189\nCase #11: 2127\nCase #12: 2460\nCase #13: 76\nCase #14: 2459\nCase #15: 2775\nCase #16: 2210\nCase #17: 1564\nCase #18: 1935\nCase #19: 6... | {"contest": "2021qr", "problem_folder": "A"} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.