contest 686

Author: arknave

codeforces/686/a.py

@@ -0,0 +1,15 @@
+n, x = map(int, input().split())
+
+distress = 0
+for _ in range(n):
+    s, v = input().split()
+    v = int(v)
+    if s == '+':
+        x += v
+    else:
+        if x < v:
+            distress += 1
+        else:
+            x -= v
+
+print(x, distress)

codeforces/686/b.py

@@ -0,0 +1,20 @@
+n = int(input())
+a = list(map(int, input().split()))
+
+swaps = []
+for i in range(n):
+    # find the value at element i
+    smallest = a[i]
+    best_pos = i
+    for j in range(i + 1, n):
+        if a[j] < smallest:
+            smallest = a[j]
+            best_pos = j
+    # swap from i to j
+    while best_pos > i:
+        a[best_pos - 1], a[best_pos] = a[best_pos], a[best_pos - 1]
+        swaps.append((best_pos, best_pos + 1))
+        best_pos -= 1
+
+for a, b in swaps:
+    print(a, b)

codeforces/686/c.py

@@ -0,0 +1,28 @@
+import itertools
+def tobase(n):
+    if n == 0:
+        return 1
+
+    l = 0
+    while n > 0:
+        l += 1
+        n //= 7
+
+    return l
+
+def main():
+    n, m = map(int, input().split())
+    nlen = tobase(n - 1)
+    mlen = tobase(m - 1)
+    places = nlen + mlen
+
+    ans = 0
+    for perm in itertools.permutations('0123456', places):
+        hour = ''.join(perm[:nlen])
+        minute = ''.join(perm[nlen:])
+        if int(hour, 7) < n and int(minute, 7) < m:
+            ans += 1
+
+    print(ans)
+
+main()