PC版Dev-C++6.7.5版本9进制计算器程序代码

#include
#include
#include
using namespace std;

// 将九进制数转换为十进制
int nonaryToDecimal(string num) {
int decimal = 0;
int power = 0;
for (int i = num.size() - 1; i >= 0; i–) {
int digit = num[i] - ‘0’;
if (digit < 0 || digit > 8) {
cout << “输入的不是有效的九进制数！” << endl;
return -1;
}
decimal += digit * pow(9, power);
power++;
}
return decimal;
}

// 将十进制转换为九进制
string decimalToNonary(int num) {
string nonary;
while (num > 0) {
nonary += (num % 9) + ‘0’;
num /= 9;
}
reverse(nonary.begin(), nonary.end());
return nonary;
}

// 加法
string addNonary(string num1, string num2) {
int decimal1 = nonaryToDecimal(num1);
int decimal2 = nonaryToDecimal(num2);
if (decimal1 == -1 || decimal2 == -1) {
return “错误: 无效的输入”;
}
int sum = decimal1 + decimal2;
return decimalToNonary(sum);
}

// 减法
string subtractNonary(string num1, string num2) {
int decimal1 = nonaryToDecimal(num1);
int decimal2 = nonaryToDecimal(num2);
if (decimal1 == -1 || decimal2 == -1) {
return “错误: 无效的输入”;
}
int difference = decimal1 - decimal2;
if (difference < 0) {
return “错误: 结果为负数”;
}
return decimalToNonary(difference);
}

// 乘法
string multiplyNonary(string num1, string num2) {
int decimal1 = nonaryToDecimal(num1);
int decimal2 = nonaryToDecimal(num2);
if (decimal1 == -1 || decimal2 == -1) {
return “错误: 无效的输入”;
}
int product = decimal1 * decimal2;
return decimalToNonary(product);
}

// 除法
string divideNonary(string num1, string num2) {
int decimal1 = nonaryToDecimal(num1);
int decimal2 = nonaryToDecimal(num2);
if (decimal1 == -1 || decimal2 == -1) {
return “错误: 无效的输入”;
}
if (decimal2 == 0) {
return “错误: 除数不能为 0”;
}
int quotient = decimal1 / decimal2;
return decimalToNonary(quotient);
}

// 平方根
string squareRootNonary(string num) {
int decimal = nonaryToDecimal(num);
if (decimal == -1) {
return “错误: 无效的输入”;
}
if (decimal < 0) {
return “错误: 不能计算负数的平方根”;
}
double root = sqrt(decimal);
return decimalToNonary(static_cast(root));
}

// 幂运算
string powerNonary(string num, int exponent) {
int decimal = nonaryToDecimal(num);
if (decimal == -1) {
return “错误: 无效的输入”;
}
int powerResult = static_cast(pow(decimal, exponent));
return decimalToNonary(powerResult);
}

// 阶乘
string factorialNonary(string num) {
int decimal = nonaryToDecimal(num);
if (decimal == -1) {
return “错误: 无效的输入”;
}
if (decimal < 0) {
return “错误: 负数没有阶乘”;
}
int fact = 1;
for (int i = 1; i <= decimal; i++) {
fact *= i;
}
return decimalToNonary(fact);
}

int main() {
int choice;
string num1, num2, result;

do {
    cout << "1. 加法" << endl;
    cout << "2. 减法" << endl;
    cout << "3. 乘法" << endl;
    cout << "4. 除法" << endl;
    cout << "5. 平方根" << endl;
    cout << "6. 幂运算" << endl;
    cout << "7. 阶乘" << endl;
    cout << "8. 继续" << endl;
    cout << "9. 退出" << endl;
    cout << "请选择: ";
    cin >> choice;

    switch (choice) {
        case 1:
            cout << "请输入第一个九进制数: ";
            cin >> num1;
            cout << "请输入第二个九进制数: ";
            cin >> num2;
            result = addNonary(num1, num2);
            cout << "结果: " << result << endl;
            break;
        case 2:
            cout << "请输入被减数（九进制）: ";
            cin >> num1;
            cout << "请输入减数（九进制）: ";
            cin >> num2;
            result = subtractNonary(num1, num2);
            cout << "结果: " << result << endl;
            break;
        case 3:
            cout << "请输入第一个九进制数: ";
            cin >> num1;
            cout << "请输入第二个九进制数: ";
            cin >> num2;
            result = multiplyNonary(num1, num2);
            cout << "结果: " << result << endl;
            break;
        case 4:
            cout << "请输入被除数（九进制）: ";
            cin >> num1;
            cout << "请输入除数（九进制）: ";
            cin >> num2;
            result = divideNonary(num1, num2);
            cout << "结果: " << result << endl;
            break;
        case 5:
            cout << "请输入要计算平方根的九进制数: ";
            cin >> num1;
            result = squareRootNonary(num1);
            cout << "结果: " << result << endl;
            break;
        case 6:
            cout << "请输入底数（九进制）: ";
            cin >> num1;
            int exponent;
            cout << "请输入指数: ";
            cin >> exponent;
            result = powerNonary(num1, exponent);
            cout << "结果: " << result << endl;
            break;
        case 7:
            cout << "请输入要求阶乘的九进制数: ";
            cin >> num1;
            result = factorialNonary(num1);
            cout << "结果: " << result << endl;
            break;
        case 8:
            cout << "继续进行其他操作..." << endl;
            break;
        case 9:
            cout << "退出系统！" << endl;
            break;
        default:
            cout << "无效的选择，请重新输入！" << endl;
    }
} while (choice!= 9);

return 0;

}