pip3 install radon

import random
 
def guess_number():
    # 生成一個隨機數(shù)作為答案
    answer = random.randint(1, 100)
 
    # 初始化猜測次數(shù)
    guesses = 0
 
    print("歡迎來到猜數(shù)字游戲！我已經(jīng)想好了一個1到100之間的數(shù)字，你需要猜出這個數(shù)字是多少。")
 
    # 開始循環(huán)，直到玩家猜中數(shù)字為止
    while True:
        # 獲取玩家的猜測
        guess = int(input("請輸入你猜測的數(shù)字："))
 
        # 增加猜測次數(shù)
        guesses += 1
 
        # 檢查玩家猜測的數(shù)字與答案的關(guān)系
        if guess < answer:
            print("你猜的數(shù)字太小了，請繼續(xù)努力！")
        elif guess > answer:
            print("你猜的數(shù)字太大了，請再試一次！")
        else:
            print(f"恭喜你，你猜對了！答案是 {answer}。你一共猜了 {guesses} 次。")
            break  # 結(jié)束循環(huán)
 
 
# 調(diào)用函數(shù)開始游戲
guess_number()

from radon.complexity import cc_visit
 
# 定義一個Python文件路徑
file_path = 'complex_func.py'
 
# 使用cc_visit函數(shù)計算代碼的圈復(fù)雜度
with open(file_path, 'r') as file:
    code = file.read()
    results = cc_visit(code)
    print(results)
 
# 打印結(jié)果
for result in results:
    print(result)

import radon
from radon.complexity import cc_rank, cc_visit
 
 
def calculate_complexity(source_code):
    """
    Calculate the cyclomatic complexity of the given source code.
    Parameters:
    source_code (str): The source code to analyze.
    Returns:
    int: The cyclomatic complexity.
    str: The complexity rating.
    """
    try:
        # Visit the AST and calculate the complexity
        results = cc_visit(source_code)
        complexity = results[0].complexity
        # Get the complexity rating
        rating = cc_rank(complexity)
        return complexity, rating
    except Exception as e:
        print("Error:", e)
        return None, None
 
 
# Example usage:
if __name__ == "__main__":
    code = """
def rank(self):
    rating_num = float(self.rating)
    if rating_num >= 8.5:
        return 'S'
    elif rating_num >= 8:
        return 'A'
    elif rating_num >= 7:
        return 'B'
    elif rating_num >= 6:
        return 'C'
    else:
        return 'D'
    """
    complexity, rating = calculate_complexity(code)
    if complexity is not None and rating is not None:
        print("Cyclomatic Complexity:", complexity)
        print("Complexity Rating:", rating)

def rank(self):
    breakpoints = (6, 7, 8, 8.5)
    grades = ('D', 'C', 'B', 'A', 'S')
    index = bisect.bisect(breakpoints, float(self.rating))
    return grades[index]