# サイコロを2回振るとき 少なくとも1回は1が出る確率
import random

num = 1000000
count = 0
for _ in range(num):
    dices = [random.choice([1,2,3,4,5,6]),random.choice([1,2,3,4,5,6])]
    if 1 in dices:
        count+=1

print(f"少なくとも1が1回はでた回数 : {count}")
print(f"{count * 100 / num}%")

# n人の生徒の中に誕生日が同じ人がいる確率
import random
from collections import Counter

birthdays = list(range(365))
num = 30
cnt, all_cnt = 0,0
for i in range(1000000):
    all_cnt+=1
    tmp = random.choices(birthdays,k=num)
    c = Counter(tmp)
    mx = c.most_common(1)
    if mx[0][1]>1:
        cnt+=1
print(f"誕生日が同じ人がいた回数 : {cnt}")
print(f"誕生日が同じ人がいる確率 : {cnt * 100 /all_cnt}%")

# コインを投げて4回表が出た後の出目の確率
import random

def simulate_coin_tosses(trials):
    result = {'表':0,'裏':0}
    coins = [random.choice(['表', '裏']) for _ in range(trials)]
    for i in range(0, trials-5):
        if coins[i:i+4] == ['表', '表', '表', '表']:
            next = coins[i+4]
            result[next]+=1
    return result['表'], result['裏']

# 試行回数
k = 1000000
total_heads, total_tails = simulate_coin_tosses(k)

print(f"試行回数: {k}")
print(f"表の合計回数: {total_heads}")
print(f"裏の合計回数: {total_tails}")
print(f"4回表が出た後の裏が出る確率は : {total_tails * 100 / (total_heads + total_tails):.6}%")

# コインをnum回投げて、連続して表が出る最高回数
import random

def max_consecutive_heads(trials):
    coins = [random.choice(['表', '裏']) for _ in range(trials)]
    #print(coins)
    #print(f"表の数 : {coins.count('表')}")
    max_count, current_count = 0, 0
    for coin in coins:
        if coin == '表':
            current_count += 1
            max_count = max(max_count, current_count)
        else:
            current_count = 0
    return max_count

# 試行回数
num = 1000
max_heads = [max_consecutive_heads(num) for _ in range(1000)]
mean_heads = sum(max_heads) / len(max_heads)
print(f"試行回数: {num}")
print(f"連続して出現した表の最高回数: {mean_heads}")

import random
from collections import Counter
from itertools import combinations

# ポーカーの役
POKER_HANDS = {
    0: "ハイカード",
    1: "ワンペア",
    2: "ツーペア",
    3: "スリーカード",
    4: "ストレート",
    5: "フラッシュ",
    6: "フルハウス",
    7: "フォーカード",
    8: "ストレートフラッシュ",
    9: "ロイヤルストレートフラッシュ"
}

# カードのランクとスート（HA=ハートのエース, D2=ダイヤの2）
RANKS = "23456789TJQKA"
SUITS = "HDSC"  # ハート, ダイヤ, スペード, クラブ
DECK = [s + r for r in RANKS for s in SUITS]

# 役の評価（スコアをタプルで返す）
def evaluate_hand(hand):
    ranks = sorted([RANKS.index(c[1]) for c in hand], reverse=True)
    suits = [c[0] for c in hand]
    rank_counts = Counter(ranks)
    flush = len(set(suits)) == 1
    straight = len(rank_counts) == 5 and (max(ranks) - min(ranks) == 4 or set(ranks) == {12, 3, 2, 1, 0})  # A-2-3-4-5対応

    # 役の判定（同率はRankで比較）
    if straight and flush:
        if set(ranks) == {12, 11, 10, 9, 8}:  # A, K, Q, J, 10
            return (9, max(ranks))  # ロイヤルストレートフラッシュ
        return (8, max(ranks)) # ストレートフラッシュ
    if 4 in rank_counts.values():
        return (7, max(k for k, v in rank_counts.items() if v == 4))  # フォーカード
    if 3 in rank_counts.values() and 2 in rank_counts.values():
        return (6, max(k for k, v in rank_counts.items() if v == 3))  # フルハウス
    if flush:
        return (5, ranks)  # フラッシュ
    if straight:
        return (4, max(ranks))  # ストレート
    if 3 in rank_counts.values():
        return (3, max(k for k, v in rank_counts.items() if v == 3))  # スリーカード
    if list(rank_counts.values()).count(2) == 2:
        return (2, sorted([k for k, v in rank_counts.items() if v == 2], reverse=True))  # ツーペア
    if 2 in rank_counts.values():
        return (1, max(k for k, v in rank_counts.items() if v == 2))  # ワンペア
    return (0, ranks)  # ハイカード

# モンテカルロ法で勝率計算
def monte_carlo_win_rate(my_hand, num_simulations=10000):
    wins = 0
    user_num = 3
    for _ in range(num_simulations):
        deck = DECK.copy()
        for card in my_hand:
            deck.remove(card)

        # 4人分の手札をランダムに配る
        random.shuffle(deck)
        opponent_hands = [deck[i * 2: (i + 1) * 2] for i in range(user_num)]
        community_cards = deck[6:11]

        # 各プレイヤーのベストハンドを評価
        my_best = max(evaluate_hand(list(comb)) for comb in combinations(my_hand + community_cards, 5))
        opponent_best = [max(evaluate_hand(list(comb)) for comb in combinations(hand + community_cards, 5)) for hand in opponent_hands]

        # 自分が最も強い手を持っているか判定
        if my_best > max(opponent_best):
            wins += 1

    return wins / num_simulations

# 例: 自分の手札をセットして勝率を計算
my_hand = ["HA", "HK"]  # ハートのエース・キング
win_rate = monte_carlo_win_rate(my_hand, num_simulations=5000)
print(f"勝率: {win_rate:.2%}")

RANKS = "23456789TJQKA"
H_DECK = [s + r for r in RANKS for s in "H"]
D_DECK = [s + r for r in RANKS for s in "D"]
combi = [[h, d] for h in H_DECK for d in D_DECK]
result = {":".join(c):0 for c in combi}
for my_hand in combi:
  result[":".join(my_hand)] = monte_carlo_win_rate(my_hand, num_simulations=5000)

# ビンゴの場合True , ビンゴでない場合はFalse
def check_bingo(b):
    # 横
    for i in range(5):
        if sum(b[i*5:i*5+5])==0:
            return True
    # 縦
    for i in range(5):
        b1,b2,b3,b4,b5 = b[i],b[i+5],b[i+10],b[i+15],b[i+20]
        if sum([b1,b2,b3,b4,b5])==0:
            return True
    # 斜め
    d1 = [b[d*6] for d in range(5)]
    d2 = [b[d*4] for d in range(1,6)]
    if sum(d1)==0 or sum(d2)==0:
        return True
    return False

# リストの中に数値がある場合はインデックスを、ない場合は-1を返す
def find_index(b,x):
    return b.index(x) if x in b else -1

# 何ターンでビンゴしたかをカウントする
def bingo_count(bingo,numbers):
    count=0
    for num in numbers:
        index = find_index(bingo,num)
        if index!=-1:
            bingo[index] = 0
        count+=1
        if check_bingo(bingo):
            return count
        else:
            continue
    return count

import random
numbers = [i for i in range(1,76)]
random.shuffle(numbers)

n = 1000000
calc = {k:0 for k in range(1,76)}
for i in range(n):
    # ランダムで数値を25個取得してビンゴ用紙を作る
    bingo = random.sample(numbers,25)
    # 真ん中は開ける(数値0は穴開き)
    bingo[12] = 0
    ans = bingo_count(bingo,numbers)
    calc[ans]+=1

# 結果
print("総回数 : {0}回".format(n))
tmp = []
for k,v in calc.items():
    r = v / n * 100
    print("{0:02} 回目, : {1:06}回 , {2:.05}%".format(k,v,r))
    tmp.append([k,v,r])

# 描画
import matplotlib.pyplot as plt
import pandas as pd

df_b = pd.DataFrame(tmp,columns=["num","count","rate"])
df_b["cumsum"] = df_b["rate"].cumsum()

fig, ax1 = plt.subplots(figsize=(16,8))
ax2 = ax1.twinx()
ax1.bar(df_b["num"],df_b["rate"])
ax2.plot(df_b["cumsum"],color="red")
plt.show()

# 結果のプリント用
def print_bingo(bingo):
    for i,b in enumerate(bingo):
        if i%5==0:
            print()
        print(b,end="\t")
    print()

# ビンゴでない場合True , ビンゴの場合はFalse
def check_bingo(b):
    # 横
    for i in range(5):
        if sum(b[i*5:i*5+5])==5:
            return False
    # 縦
    for i in range(5):
        b1,b2,b3,b4,b5 = b[i],b[i+5],b[i+10],b[i+15],b[i+20]
        if sum([b1,b2,b3,b4,b5])==5:
            return False
    # 斜め
    d1 = [b[d*6] for d in range(5)]
    d2 = [b[d*4] for d in range(1,6)]
    if sum(d1)==5 or sum(d2)==5:
        return False
    return True

count = 0
all_count = 0
seq = [i for i in range(0,25)]

combi = list(itertools.combinations(seq,5))
for c in combi:
    all_count +=1

    # ビンゴを用意(1==穴あき)
    bingo = [1] * 25

    # 穴なしに戻す(0==穴なし)
    for i in c:
        bingo[i]=0

    # ビンゴでないかどうかの判定
    if check_bingo(bingo):
        print(c)
        print_bingo(bingo)
        print()
        count +=1

print(count,all_count)