pythonで競技プログラミング　覚え書き

N=input()

ans=100000

for bit in range(1<<len(N)):
    
    tmp=''
    if bit==0:
        tmp=N
        if int(tmp)%3==0:
            print(0)
            exit()
    for i in range(len(N)):
        if bit&(1<<i):
            tmp+=N[i]
    if int(tmp)%3==0 and len(N)-len(tmp)<ans:
        ans=len(N)-len(tmp)
if ans==100000:
    print(-1)
else:
    print(ans)

ABCD=input()
for bit in range(1<<3):
    tmp=ABCD[0]
    tmp2=int(ABCD[0])
    for i in range(3):
        if bit&(1<<i):
            tmp+='+'+ABCD[i+1]
            tmp2+=int(ABCD[i+1])
        else:
            tmp+='-'+ABCD[i+1]
            tmp2-=int(ABCD[i+1])
    if tmp2==7:
        print(tmp+'=7')
        exit()

S=input()
akiba=['KIH','B','R']
for bit in range(1<<4):
    tmp=''
    for i in range(4):
        if bit&(1<<i):
            tmp+='A'
        if i<3:
            tmp+=akiba[i]
    if tmp==S:
        print('YES')
        exit()
print('NO')

import heapq

N,K=map(int,input().split())
ab=[list(map(int,input().split()))for i in range(N)]
heapq.heapify(ab)
ans=0
for i in range(K):
    tmp=heapq.heappop(ab)
    ans+=tmp[0]
    heapq.heappush(ab,[tmp[0]+tmp[1],tmp[1]])

print(ans)

import heapq

N,M=map(int,input().split())
A=list(map(int,input().split()))
for i in range(N):
    A[i]=-A[i]
heapq.heapify(A)
for i in range(1,M+1):
    tmp=heapq.heappop(A)
    heapq.heappush(A,-(-tmp//2))
print(-1*sum(A))

import heapq

N,M=map(int,input().split())
AB=[list(map(int,input().split()))for i in range(N)]
ABlist=[[]for i in range(10**5+1)]
for i in range(N):
    ABlist[AB[i][0]].append(-AB[i][1])
ans=0
q=[]
heapq.heapify(q)
for i in range(1,M+1):
    for j in ABlist[i]:
        heapq.heappush(q,j)
    if len(q)>0:
        ans+=-heapq.heappop(q)
print(ans)

from collections import deque
S=list(input())
S=deque(S)
Q=int(input())
rev=0
for i in range(Q):
    tmp=list(input())
    if tmp[0]=='1':
        rev+=1
    if tmp[0]=='2':
        if tmp[2]=='1':
            if rev%2==0:
                S.appendleft(tmp[4])
            else:
                S.append(tmp[4])
        else:
            if rev%2==0:
                S.append(tmp[4])
            else:
                S.appendleft(tmp[4])
if rev%2!=0:
    S.reverse()
print(''.join(S))

from collections import deque

n=int(input())
a=list(map(int,input().split()))
ans=deque()
for i in range(n):
    if i%2==0:
        ans.append(a[i])
    else:
        ans.appendleft(a[i])
if n%2!=0:
    ans.reverse()
ans=list(ans)
ans=[str(i) for i in ans]
ans=' '.join(ans)
print(ans)

R,C=map(int,input().split())

c=[list(input())for i in range(R)]
for i in range(R):
    for j in range(C):
        if c[i][j]=='s':
            sx=j
            sy=i
        if c[i][j]=='g':
            gx=j
            gy=i

seen=[[1000]*C for i in range(R)]
que=[[sy,sx]]
seen[sy][sx]=1
ans=0

now=list()
while len(que)>0:
    now.append(que[-1])
    del que[-1]

    if now[0][0]==gy and now[0][1]==gx:
        ans=1
        break

    dy=[0,0,1,-1]
    dx=[1,-1,0,0]

    for i in range(4):
        tmp_y=now[0][0]+dy[i]
        tmp_x=now[0][1]+dx[i]
        if tmp_x<0 or C-1<tmp_x or tmp_y<0 or R-1<tmp_y:
            continue
        if c[tmp_y][tmp_x]=='#':
            continue
        if seen[tmp_y][tmp_x]!=1000:
            continue
        que.append([tmp_y,tmp_x])
        seen[tmp_y][tmp_x]=1
    del now[0]

if ans==1:
    print('Yes')
else:
    print('No')

import itertools

N,W=map(int,input().split())
STP=[list(map(int,input().split()))for i in range(N)]
bkt=[0]*3*10**5
ans=[0]
tmp=0
for i in range(N):
    bkt[STP[i][0]]+=STP[i][2]
    bkt[STP[i][1]]-=STP[i][2]
ans=itertools.accumulate(bkt)
if max(ans)>W:
    print('No')
else:
    print('Yes')