Cod sursa(job #2901382)
Utilizator | Data | 13 mai 2022 17:26:22 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int v[20]; /// solutia mea
int n;
void backtracking(int poz)
{
if(poz >= 2)
{
for(int i = 1; i < poz; i++)
out << v[i] << " ";
out << "\n";
}
if(poz == n + 1)
return;
for(int i = v[poz - 1] + 1; i <= n; i++)
{
v[poz] = i;
backtracking(poz + 1);
v[poz] = 0;
}
}
int main()
{
in >> n;
backtracking(1);
return 0;
}