C++实现：计算n个元素集合的不同非空子集划分数量

#include <iostream> #include <fstream> using namespace std; int countSubset(int n) { if (n == 1) { return 1; } else { return 2 * countSubset(n - 1); } } int main() { ifstream inputFile("input.txt"); int n; inputFile >> n; int result = countSubset(n) - 1; ofstream outputFile("output.txt"); outputFile << result << endl; return 0; } ######[AI写代码神器 | 266点数解答 | 2024-12-12 21:50:22]