全部

Author: zfhrp6

cf784a.py

@@ -0,0 +1,2 @@
+print(30-int(input()))
+# print(27)

cf784e.py

@@ -0,0 +1,2 @@
+v1,v2,v3,v4=int(input()),int(input()),int(input()),int(input())
+print( ( (v1|v2)&(v3^v4) )|( (v2&v3)^(v1|v4) ) )

cf784f.py

@@ -0,0 +1,5 @@
+s = input()
+l = s.split()[0]
+ns = s.split()[1:]
+# print(l,ns)
+print(' '.join(sorted(ns)))

cf784g.py

@@ -0,0 +1,66 @@
+def shift(s,n=1):
+    ret = ''
+    ret += '>' * (s-1)
+    for i in range(10):
+        ret += '{}[-]{}[<+>-]'.format('<'*n, '>'*n)
+        ret += '>'
+    ret += '<'*10
+    ret += '<' * (s-1)
+    return ret
+
+exp = input()
+nums = []
+ops = []
+for c in exp:
+    if c in '0123456789':
+        nums.append(int(c))
+    else:
+        ops.append(c)
+lg = len(nums)
+
+ret = ''
+for n in nums:
+    ret += '+' * n
+    ret += '>'
+    ret += '\n'
+ret += '<'*lg
+ret += '\n'
+
+pos = 1
+for op in ops:
+    if op == '-':
+        ret += '>[-<->]'
+    elif op == '+':
+        ret += '>[-<+>]'
+    pos += 1
+    ret += '<'*(pos-1)
+    ret += shift(pos+1)
+    ret += '>'*(pos-1)
+    ret += '\n'
+ret += '.'
+print(ret)
+
+
+
+
+def ope(op, idx1, val1, idx2, val2, ridx):
+    ret = ''
+    if op == '+':
+        ret += '>' * ridx
+        ret += '+' * (val1+val2)
+        ret += '<' * ridx
+    elif op == '-':
+        ret += '>' * ridx
+        ret += '-' 
+
+
+def move(sidx, eidx):
+    if sidx <= eidx:
+        raise Exception
+    ret = ''
+    ret += '>' * (eidx - 1)
+    ret += '[-]'
+    ret += '>' * (sidx - eidx)
+    ret += '[-{}+{}]'.format('<'*(sidx-eidx),'>'*(sidx-eidx))
+    ret += '<' * (sidx-1)
+    return ret

cf784g_2.py

@@ -0,0 +1,16 @@
+exp = input()
+ans = str(eval(exp))
+
+l=len(ans)
+print('>'*l+'++++++++')
+print('[', end='')
+for i in range(l):
+    print('<++++++', end='')
+print('>'*l+'-]')
+print('<'*l)
+
+num = 48
+num = 0
+for c in ans:
+    print('+'*(num+int(c))+'.>')
+# print('+'*ans+'.')

codefes2016_a/a.py

@@ -0,0 +1,3 @@
+s = input()
+
+print(s[:4] + ' ' + s[4:])

codefes2016_a/b.py

@@ -0,0 +1,11 @@
+N = int(input())
+As = list(map(int, input().split()))
+As.insert(0,-1)
+cnt = 0
+for i in range(N+1):
+    j = As[i]
+    if j <= i:
+        continue
+    if As[j] == i:
+        cnt += 1
+print(cnt)

codefes2016_a/c.py

@@ -0,0 +1,32 @@
+s = input()
+K = int(input())
+
+def cord(c):
+    return ord(c)-97
+
+def cchr(n):
+    return chr(n+97)
+
+def smcheck(c, k):
+    return 26-cord(c) <= k
+
+def smcnt(c, k):
+    return 26-cord(c)
+
+ans = ''
+for c in s:
+    sc = smcnt(c, K)
+    if sc <= K and sc < 26:
+        K -= sc
+        ans += cchr((cord(c) + sc)%26)
+        # print(K,ans)
+    else:
+        ans += c
+if K>26:
+    K = K%26
+if K>0:
+    lc = ans[-1]
+    ans = ans[:-1]
+    ans += cchr((cord(lc)+K)%26)
+
+print(ans)

codefes2016_a/d.py

@@ -0,0 +1,6 @@
+R, C = list(map(int, input().split()))
+N = int(input())
+di = {}
+for i in range(N):
+    ri, ci, ai = list(map(int, input().split()))
+

codefes2016_b/a.py

@@ -0,0 +1,10 @@
+s = input()
+cs = 'CODEFESTIVAL2016'
+cnt = 0
+
+for i in range(len(cs)):
+    if s[i]==cs[i]:
+        continue
+    else:
+        cnt += 1
+print(cnt)

codefes2016_b/b.py

@@ -0,0 +1,23 @@
+N, A, B = list(map(int, input().split()))
+S = input()
+a_cnt = 0
+b_cnt = 0
+ab_cnt = 0
+
+for c in S:
+    if c == 'a':
+        if ab_cnt < A+B:
+            print('Yes')
+            a_cnt += 1
+            ab_cnt += 1
+        else:
+            print('No')
+    elif c == 'b':
+        if ab_cnt < A+B and b_cnt < B:
+            print('Yes')
+            b_cnt += 1
+            ab_cnt += 1
+        else:
+            print('No')
+    else:
+        print('No')

codefes2016_b/c.py

@@ -0,0 +1,66 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+import array
+import collections
+import heapq
+
+
+AdjacentVertex = collections.namedtuple("AdjacentVertex", "vertex cost")
+INF = 2 ** 31 - 1
+NO_VERTEX = -1
+
+
+# Prim法で頂点0からの最小全域木を求める
+def compute_mst_prim(max_v, adj_list):
+    # pred[u]は頂点uの「ひとつ前」の頂点を表す
+    pred = collections.defaultdict(lambda: NO_VERTEX)
+    # uとpred[u]を結ぶ辺の重みがkey[u]に入る
+    key = collections.defaultdict(lambda: INF)
+    key[0] = 0
+    # 二分ヒープを優先度付きキューとして用いる
+    pq = [(key[v], v) for v in range(max_v)]
+    heapq.heapify(pq)
+    # 優先度付きキューに頂点が入っているかを示す配列
+    in_pq = array.array("B", (True for _ in range(max_v)))
+    while pq:
+        _, u = heapq.heappop(pq)
+        in_pq[u] = False
+        for v, v_cost in adj_list[u]:
+            if in_pq[v]:
+                weight = v_cost
+                if weight < key[v]:
+                    pred[v] = u
+                    key[v] = weight
+                    heapq.heappush(pq, (weight, v))
+                    in_pq[v] = True
+    return (pred, key)
+
+
+def main():
+    W, H = list(map(int, input().split()))
+    # max_v, max_e = map(int, input().split())
+    max_v = (W+1) * (H+1)
+    max_e = (W+1)*H + (H+1)*W
+    adjacency_list = collections.defaultdict(set)
+    for _w in range(W):
+        p = int(input())
+        for _h in range(H):
+            adjacency_list[_w*H+_h].add(AdjacentVertex((_w+1)*H+_h, p))
+            adjacency_list[(_w+1)*H+_h].add(AdjacentVertex(_w*H+_h, p))
+    for _h in range(H):
+        q = int(input())
+        for _w in range(W):
+            adjacency_list[_w*H+_h].add(AdjacentVertex((_w+1)*H+_h, q))
+            adjacency_list[(_w+1)*H+_h].add(AdjacentVertex(_w*H+_h, q))
+    # for _ in range(max_e):
+    #     s, t, w = map(int, input().split())
+    #     adjacency_list[s].add(AdjacentVertex(t, w))
+    #     adjacency_list[t].add(AdjacentVertex(s, w))
+    (_, key) = compute_mst_prim(max_v, adjacency_list)
+    print(sum(key.values()))
+
+
+if __name__ == '__main__':
+    main()
+

codefes2016_b/c2.py

@@ -0,0 +1,10 @@
+W, H = list(map(int, input().split()))
+ps, qs = [], []
+for _ in range(W):
+    ps.append(int(input()))
+for _ in range(H):
+    qs.append(int(input()))
+
+already = {}
+already.add('0,0')
+

codefes2016_b/d.py

@@ -0,0 +1,34 @@
+N = int(input())
+As = []
+for _ in range(N):
+    As.append(int(input()))
+
+ans = 0
+m_p = 1
+for idx,a in enumerate(As):
+    if As[idx] <= m_p:
+        continue
+    while As[idx] > m_p:
+        ans += 1
+        As[idx] -= m_p
+    m_p = max(m_p, As[idx]+1)
+print(ans)
+
+
+'''
+3 1-2
+1 
+4 2-1
+1
+5 3-1
+9 3-2
+2
+6 4-1
+5 4-1
+3
+5 4-1
+8 4-1
+9 4-1
+7 5-1
+9 5-1
+'''

codefes2016_c/a.py

@@ -0,0 +1,6 @@
+s = input()
+
+if 'C' in s and 'F' in s and s.index('C') < s.rindex('F'):
+    print('Yes')
+else:
+    print('No')

codefes2016_c/b.py

@@ -0,0 +1,16 @@
+K, T = list(map(int, input().split()))
+a = list(map(int, input().split()))
+
+# def remax(seq):
+#     m = max(seq)
+#     for idx,i in enumerate(seq):
+#         if m==i:
+#             return (idx, m)
+#
+# lastK = -1
+# cnt = 0
+# for _k in range(K):
+#     remax
+#
+
+print(max(0,max(a)*2-sum(a)-1))

codefes2016_c/c.py

@@ -0,0 +1,61 @@
+N = int(input())
+T = list(map(int, input().split()))
+A = list(map(int, input().split()))
+
+fixed_peek_t = {}
+unfixed_peek_t = {}
+fixed_peek_a = {}
+unfixed_peek_a = {}
+
+lp = 0
+for idx, height in enumerate(T):
+    if lp < height:
+        fixed_peek_t[idx] = height
+    elif idx not in fixed_peek_t:
+        unfixed_peek_t[idx] = height
+    lp = height
+
+lp = 0
+for _idx, height in enumerate(reversed(A)):
+    idx = N-1 - _idx
+    if lp < height:
+        fixed_peek_a[idx] = height
+    elif idx not in fixed_peek_a:
+        unfixed_peek_a[idx] = height
+    lp = height
+
+# print(unfixed_peek_t)
+# print(fixed_peek_t)
+# print(unfixed_peek_a)
+# print(fixed_peek_a)
+
+if max(A) != max(T):
+    print(0)
+else:
+    failflag = 0
+    for k,v in fixed_peek_t.items():
+        if k not in fixed_peek_a:
+            continue
+        if v != fixed_peek_a[k]:
+            failflag = 1
+            break
+        if k in unfixed_peek_a and v > unfixed_peek_a[k]:
+            failflag = 1
+            break
+    for k,v in unfixed_peek_t.items():
+        if k not in fixed_peek_a:
+            continue
+        if v < fixed_peek_a[k]:
+            failflag = 1
+            break
+    if failflag == 0:
+        cnt = 1
+        for k,v in unfixed_peek_t.items():
+            if k not in unfixed_peek_a:
+                continue
+            cnt *= min(v, unfixed_peek_a[k])
+            cnt %= 10**9 + 7
+
+        print(cnt)
+    else:
+        print(0)