九九乘法表

复制def multiplication_table(base=10, style="chinese"):
    """生成任意进制的九九乘法表。
    
    Args:
        base: 进制（2-36）
        style: "chinese"（中式，下三角）或 "western"（西式，完整方阵）
    Returns:
        字符串格式的乘法表
    """
    if base < 2 or base > 36:
        raise ValueError("进制必须在 2 到 36 之间")
    
    digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    lines = []
    
    if style == "chinese":
        for i in range(1, base):
            row = []
            for j in range(1, i + 1):
                product = i * j
                # 将乘积转为指定进制
                p = ""
                temp = product
                if temp == 0:
                    p = "0"
                else:
                    while temp > 0:
                        p = digits[temp % base] + p
                        temp //= base
                row.append(f"{digits[i]}×{digits[j]}={p}")
            lines.append("  ".join(row))
    else:  # western
        for i in range(1, base):
            row = []
            for j in range(1, base):
                product = i * j
                p = ""
                temp = product
                if temp == 0:
                    p = "0"
                else:
                    while temp > 0:
                        p = digits[temp % base] + p
                        temp //= base
                row.append(f"{digits[i]}×{digits[j]}={p}")
            lines.append("  ".join(row))
    
    return "\n".join(lines)

# 示例：生成 10 进制中式乘法表
print("10 进制中式乘法表：")
print(multiplication_table(10, "chinese"))
print()

# 示例：生成 16 进制西式乘法表（仅前 5 行）
print("16 进制西式乘法表（前 5 行）：")
table = multiplication_table(16, "western")
for line in table.split("\n")[:5]:
    print(line)

复制package main

import (
	"fmt"
	"strconv"
	"strings"
)

// 数字转任意进制字符串
func toBase(n, base int) string {
	if n == 0 {
		return "0"
	}
	digits := "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
	result := ""
	for n > 0 {
		result = string(digits[n%base]) + result
		n /= base
	}
	return result
}

// 生成乘法表
func multiplicationTable(base int, style string) string {
	if base < 2 || base > 36 {
		return "进制必须在 2 到 36 之间"
	}

	digits := "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
	var lines []string

	if style == "chinese" {
		for i := 1; i < base; i++ {
			var row []string
			for j := 1; j <= i; j++ {
				product := i * j
				row = append(row, fmt.Sprintf("%c×%c=%s", digits[i], digits[j], toBase(product, base)))
			}
			lines = append(lines, strings.Join(row, "  "))
		}
	} else {
		for i := 1; i < base; i++ {
			var row []string
			for j := 1; j < base; j++ {
				product := i * j
				row = append(row, fmt.Sprintf("%c×%c=%s", digits[i], digits[j], toBase(product, base)))
			}
			lines = append(lines, strings.Join(row, "  "))
		}
	}
	return strings.Join(lines, "\n")
}

func main() {
	// 示例：8 进制中式乘法表
	fmt.Println("8 进制中式乘法表：")
	fmt.Println(multiplicationTable(8, "chinese"))
	fmt.Println()

	// 示例：12 进制西式乘法表（前 3 行）
	fmt.Println("12 进制西式乘法表（前 3 行）：")
	table := multiplicationTable(12, "western")
	lines := strings.Split(table, "\n")
	for i := 0; i < 3 && i < len(lines); i++ {
		fmt.Println(lines[i])
	}

	// 处理 strconv 导入（实际未使用，仅用于演示）
	_ = strconv.Itoa(0)
}

复制/**
 * 将数字转换为任意进制字符串
 * @param {number} n - 要转换的数字
 * @param {number} base - 进制（2-36）
 * @returns {string}
 */
function toBase(n, base) {
    if (n === 0) return "0";
    const digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    let result = "";
    while (n > 0) {
        result = digits[n % base] + result;
        n = Math.floor(n / base);
    }
    return result;
}

/**
 * 生成乘法表
 * @param {number} base - 进制（2-36）
 * @param {'chinese'|'western'} style - 样式
 * @returns {string}
 */
function multiplicationTable(base, style = "chinese") {
    if (base < 2 || base > 36) {
        throw new Error("进制必须在 2 到 36 之间");
    }

    const digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    const lines = [];

    if (style === "chinese") {
        for (let i = 1; i < base; i++) {
            const row = [];
            for (let j = 1; j <= i; j++) {
                const product = i * j;
                row.push(`${digits[i]}×${digits[j]}=${toBase(product, base)}`);
            }
            lines.push(row.join("  "));
        }
    } else {
        for (let i = 1; i < base; i++) {
            const row = [];
            for (let j = 1; j < base; j++) {
                const product = i * j;
                row.push(`${digits[i]}×${digits[j]}=${toBase(product, base)}`);
            }
            lines.push(row.join("  "));
        }
    }
    return lines.join("\n");
}

// 示例：5 进制中式乘法表
console.log("5 进制中式乘法表：");
console.log(multiplicationTable(5, "chinese"));
console.log();

// 示例：10 进制西式乘法表（前 3 行）
console.log("10 进制西式乘法表（前 3 行）：");
const table = multiplicationTable(10, "western");
console.log(table.split("\n").slice(0, 3).join("\n"));