T4
2025-05-08 16:03:49
发布于：浙江
2阅读
0回复
0点赞
#include <iostream>
#include <vector>
// 递归函数，用于生成所有可能的抽奖情况
void generateLotteryCases(int n, std::vector<int>& current, int step) {
if (step == n) {
for (int i = 0; i < n; ++i) {
std::cout << current[i];
if (i < n - 1) {
std::cout << " ";
}
}
std::cout << std::endl;
return;
}
for (int i = 1; i <= n; ++i) {
current[step] = i;
generateLotteryCases(n, current, step + 1);
}
}
int main() {
int n;
std::cin >> n;
std::vector<int> current(n);
generateLotteryCases(n, current, 0);
return 0;
}
这里空空如也
有帮助，赞一个