5
1

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 1 year has passed since last update.

bit全探索動画 コード全文

Posted at
# 入力の受け取り
N=input()

# Nの桁数
d=len(N)

# 答え
ans=100

# num=(000...0)~(111...1)
for num in range(1<<d):
    # 桁を消して作れる数字
    N_tmp=""
    # 消した個数
    ans_tmp=0
    
    # shift=0~(d-1)
    for shift in range(d):
        # 1 & (numをshift個右シフト)=1ならば
        if 1 & num>>shift == 1:
            # その桁を使う
            N_tmp=N_tmp+N[shift]

        # 1 & (numをshift個右シフト)=0ならば
        else:
            # 桁を消した個数をカウント
            ans_tmp+=1

    # N_tmpが空なら
    # ⇔num=(000...0)の場合
    if N_tmp=="":
        # 次のnumへ
        continue

    # 整数にして3で割り切れる場合
    if int(N_tmp)%3==0:
        # ansよりans_tmpが小さければ更新
        ans=min(ans,ans_tmp)

# 答えが更新されていなければ
if ans==100:
    # 「-1」を出力⇔3の倍数は作れない
    print(-1)
# 答えが更新されていれば
else:
    # 答えを出力
    print(ans)
5
1
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
5
1

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?